/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:48:52,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:48:52,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:48:52,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:48:52,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:48:52,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:48:52,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:48:52,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:48:52,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:48:52,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:48:52,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:48:52,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:48:52,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:48:52,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:48:52,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:48:52,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:48:52,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:48:52,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:48:52,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:48:52,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:48:52,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:48:52,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:48:52,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:48:52,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:48:52,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:48:52,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:48:52,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:48:52,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:48:52,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:48:52,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:48:52,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:48:52,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:48:52,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:48:52,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:48:52,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:48:52,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:48:52,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:48:52,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:48:52,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:48:52,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:48:52,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:48:52,161 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:48:52,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:48:52,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:48:52,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:48:52,177 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:48:52,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:48:52,177 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:52,177 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:48:52,177 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:48:52,177 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:48:52,178 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:48:52,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:48:52,179 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:48:52,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:48:52,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:48:52,179 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:48:52,180 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:48:52,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:48:52,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:48:52,180 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:48:52,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:52,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:48:52,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:48:52,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:48:52,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:48:52,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:48:52,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:48:52,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:48:52,361 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:48:52,361 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:48:52,362 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:52,423 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_e5KC6o/tmp/17ba57e47bfa4844b03045e0572eabf8/FLAG23efd4c7d [2020-07-01 12:48:52,753 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:48:52,754 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:52,754 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:48:52,761 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_e5KC6o/tmp/17ba57e47bfa4844b03045e0572eabf8/FLAG23efd4c7d [2020-07-01 12:48:53,160 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_e5KC6o/tmp/17ba57e47bfa4844b03045e0572eabf8 [2020-07-01 12:48:53,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:48:53,173 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:48:53,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:53,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:48:53,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:48:53,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239e43bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53, skipping insertion in model container [2020-07-01 12:48:53,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:48:53,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:48:53,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:53,453 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:48:53,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:53,486 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:48:53,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53 WrapperNode [2020-07-01 12:48:53,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:53,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:53,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:48:53,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:48:53,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:53,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:48:53,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:48:53,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:48:53,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:48:53,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:48:53,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:48:53,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:48:53,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:48:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:48:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:48:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:48:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:48:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:48:53,934 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:48:53,935 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:48:53,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:53 BoogieIcfgContainer [2020-07-01 12:48:53,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:48:53,939 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:48:53,940 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:48:53,942 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:48:53,942 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:53" (1/1) ... [2020-07-01 12:48:53,957 INFO L313 BlockEncoder]: Initial Icfg 54 locations, 57 edges [2020-07-01 12:48:53,959 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:48:53,959 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:48:53,960 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:48:53,960 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:53,962 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:48:53,963 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:48:53,963 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:48:53,990 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:48:54,034 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:48:54,039 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:48:54,041 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:54,074 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:48:54,077 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:48:54,079 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:48:54,079 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:54,079 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:48:54,080 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:48:54,081 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 82 edges [2020-07-01 12:48:54,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:54 BasicIcfg [2020-07-01 12:48:54,081 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:48:54,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:48:54,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:48:54,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:48:54,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:48:53" (1/4) ... [2020-07-01 12:48:54,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a2505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:54, skipping insertion in model container [2020-07-01 12:48:54,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (2/4) ... [2020-07-01 12:48:54,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a2505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:54, skipping insertion in model container [2020-07-01 12:48:54,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:53" (3/4) ... [2020-07-01 12:48:54,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a2505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:54, skipping insertion in model container [2020-07-01 12:48:54,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:54" (4/4) ... [2020-07-01 12:48:54,090 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:54,101 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:48:54,109 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:48:54,123 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:48:54,147 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:48:54,147 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:48:54,148 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:54,148 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:54,148 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:54,148 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:48:54,148 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:54,148 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:48:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 12:48:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:54,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:54,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:54,172 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 126408, now seen corresponding path program 1 times [2020-07-01 12:48:54,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:54,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632897572] [2020-07-01 12:48:54,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:54,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632897572] [2020-07-01 12:48:54,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:54,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:54,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415648331] [2020-07-01 12:48:54,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:54,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:54,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,369 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:48:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:54,529 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2020-07-01 12:48:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:54,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:54,543 INFO L225 Difference]: With dead ends: 90 [2020-07-01 12:48:54,544 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:48:54,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:48:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:48:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:48:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2020-07-01 12:48:54,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 3 [2020-07-01 12:48:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:54,604 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2020-07-01 12:48:54,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2020-07-01 12:48:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:54,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:54,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:54,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:48:54,606 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 126470, now seen corresponding path program 1 times [2020-07-01 12:48:54,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:54,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182897647] [2020-07-01 12:48:54,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:54,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182897647] [2020-07-01 12:48:54,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:54,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:54,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426034987] [2020-07-01 12:48:54,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:54,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:54,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,680 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 3 states. [2020-07-01 12:48:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:54,818 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:48:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:54,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:54,821 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:48:54,821 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:48:54,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:48:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:48:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:48:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 12:48:54,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 3 [2020-07-01 12:48:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:54,828 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 12:48:54,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 12:48:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:54,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:54,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:54,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:48:54,829 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash 126468, now seen corresponding path program 1 times [2020-07-01 12:48:54,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:54,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151707179] [2020-07-01 12:48:54,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:54,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151707179] [2020-07-01 12:48:54,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:54,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:54,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679221337] [2020-07-01 12:48:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:54,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,864 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. [2020-07-01 12:48:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:54,951 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2020-07-01 12:48:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:54,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:54,952 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:48:54,952 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:48:54,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:48:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:48:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:48:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2020-07-01 12:48:54,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 3 [2020-07-01 12:48:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:54,959 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2020-07-01 12:48:54,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2020-07-01 12:48:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:54,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:54,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:54,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:48:54,960 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash 3917741, now seen corresponding path program 1 times [2020-07-01 12:48:54,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:54,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664852549] [2020-07-01 12:48:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664852549] [2020-07-01 12:48:55,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407776440] [2020-07-01 12:48:55,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:55,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,025 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand 3 states. [2020-07-01 12:48:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,116 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2020-07-01 12:48:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:55,118 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:48:55,118 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:48:55,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:48:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:48:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:48:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-01 12:48:55,123 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 4 [2020-07-01 12:48:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:55,123 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-01 12:48:55,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-01 12:48:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:55,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:55,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:55,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:48:55,124 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 3917743, now seen corresponding path program 1 times [2020-07-01 12:48:55,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431072308] [2020-07-01 12:48:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431072308] [2020-07-01 12:48:55,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110882728] [2020-07-01 12:48:55,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:55,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,153 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 3 states. [2020-07-01 12:48:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,203 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-01 12:48:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:55,205 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:48:55,205 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:48:55,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:48:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:48:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:48:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-01 12:48:55,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 4 [2020-07-01 12:48:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:55,210 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-01 12:48:55,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2020-07-01 12:48:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:55,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:55,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:55,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:48:55,211 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 3917744, now seen corresponding path program 1 times [2020-07-01 12:48:55,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95917657] [2020-07-01 12:48:55,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95917657] [2020-07-01 12:48:55,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192197015] [2020-07-01 12:48:55,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:55,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,258 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 3 states. [2020-07-01 12:48:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,314 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-07-01 12:48:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:55,315 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:48:55,315 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:48:55,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:48:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:48:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:48:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-07-01 12:48:55,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 4 [2020-07-01 12:48:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:55,320 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-01 12:48:55,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-01 12:48:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:55,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:55,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:55,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:48:55,321 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash 121448417, now seen corresponding path program 1 times [2020-07-01 12:48:55,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738081165] [2020-07-01 12:48:55,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738081165] [2020-07-01 12:48:55,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534529787] [2020-07-01 12:48:55,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:55,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,355 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2020-07-01 12:48:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,403 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-01 12:48:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:55,405 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:48:55,405 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:48:55,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:48:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:48:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:48:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-01 12:48:55,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 5 [2020-07-01 12:48:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:55,409 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-01 12:48:55,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-01 12:48:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:55,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:55,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:55,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:48:55,410 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 121448419, now seen corresponding path program 1 times [2020-07-01 12:48:55,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036363337] [2020-07-01 12:48:55,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036363337] [2020-07-01 12:48:55,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983017966] [2020-07-01 12:48:55,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:55,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,448 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-07-01 12:48:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,490 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-01 12:48:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:55,491 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:48:55,491 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:48:55,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:48:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:48:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:48:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:48:55,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:48:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:55,492 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:48:55,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:48:55,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:48:55,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:48:55,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:48:55,553 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:48:55,553 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:48:55,553 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L264 CegarLoopResult]: At program point L15-3(lines 14 18) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 0 ULTIMATE.start_test_fun_~j_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~i_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~i_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_test_fun_~i_ref~0.base))) [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point L15-4(lines 15 18) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:48:55,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:48:55,555 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,556 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,557 INFO L268 CegarLoopResult]: For program point L13(lines 13 20) no Hoare annotation was computed. [2020-07-01 12:48:55,557 INFO L264 CegarLoopResult]: At program point L13-2(lines 12 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 0 ULTIMATE.start_test_fun_~j_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~i_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~i_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_test_fun_~i_ref~0.base))) [2020-07-01 12:48:55,557 INFO L268 CegarLoopResult]: For program point L13-3(lines 13 20) no Hoare annotation was computed. [2020-07-01 12:48:55,557 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:48:55,557 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:55,558 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:48:55,559 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:48:55,562 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:48:55,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:55 BasicIcfg [2020-07-01 12:48:55,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:48:55,586 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:48:55,586 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:48:55,590 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:48:55,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:55,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:48:53" (1/5) ... [2020-07-01 12:48:55,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45f41eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:55, skipping insertion in model container [2020-07-01 12:48:55,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:55,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:53" (2/5) ... [2020-07-01 12:48:55,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45f41eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:55, skipping insertion in model container [2020-07-01 12:48:55,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:55,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:53" (3/5) ... [2020-07-01 12:48:55,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45f41eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:55, skipping insertion in model container [2020-07-01 12:48:55,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:55,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:54" (4/5) ... [2020-07-01 12:48:55,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45f41eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:55, skipping insertion in model container [2020-07-01 12:48:55,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:55,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:55" (5/5) ... [2020-07-01 12:48:55,594 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:55,615 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:48:55,615 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:48:55,615 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:55,615 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:55,616 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:55,616 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:48:55,616 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:55,616 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:48:55,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:48:55,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:48:55,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:55,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:55,632 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:55,632 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:55,632 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:48:55,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:48:55,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:48:55,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:55,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:55,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:55,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:55,641 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 15#L-1true [173] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~i_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~i_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~i_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~j_1 |v_ULTIMATE.start_test_fun_#in~j_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~i_1 |v_ULTIMATE.start_test_fun_#in~i_1|) (= |v_ULTIMATE.start_test_fun_#in~j_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_1, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#in~j=|v_ULTIMATE.start_test_fun_#in~j_1|, ULTIMATE.start_test_fun_#in~i=|v_ULTIMATE.start_test_fun_#in~i_1|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~j_ref~0.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~i_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_~i, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#in~j, ULTIMATE.start_test_fun_#in~i, ULTIMATE.start_test_fun_~j, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_~i_ref~0.base, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_~j_ref~0.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~c~0.base] 17#L10true [79] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 v_ULTIMATE.start_test_fun_~i_3))) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~i_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 34#L10-1true [122] L10-1-->L11: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3) v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 v_ULTIMATE.start_test_fun_~j_3))) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} AuxVars[] AssignedVars[#memory_int] 39#L11true [96] L11-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 40#L13-2true [2020-07-01 12:48:55,642 INFO L796 eck$LassoCheckResult]: Loop: 40#L13-2true [130] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_6) v_ULTIMATE.start_test_fun_~i_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L13true [134] L13-->L14: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 23#L14true [84] L14-->L15-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~j_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_5) (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~j_ref~0.base_6)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_6 (store (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_6) v_ULTIMATE.start_test_fun_~j_ref~0.offset_5 0)))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_6, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_6, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 43#L15-3true [103] L15-3-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) v_ULTIMATE.start_test_fun_~j_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~j_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~j_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 25#L15true [88] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~i_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) v_ULTIMATE.start_test_fun_~i_ref~0.offset_7)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~i_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 47#L15-1true [157] L15-1-->L15-4: Formula: (> (+ |v_ULTIMATE.start_test_fun_#t~mem5_4| 1) |v_ULTIMATE.start_test_fun_#t~mem4_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 41#L15-4true [99] L15-4-->L19: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_9 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~i_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~i_ref~0.base_12) v_ULTIMATE.start_test_fun_~i_ref~0.offset_9)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~i_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_9, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_12, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_9, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 33#L19true [235] L19-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_13) (= (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~i_ref~0.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~i_ref~0.base_18) v_ULTIMATE.start_test_fun_~i_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_28|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~i_ref~0.base_18)) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~i_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_13, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_13, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 40#L13-2true [2020-07-01 12:48:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 121597286, now seen corresponding path program 1 times [2020-07-01 12:48:55,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822991800] [2020-07-01 12:48:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:55,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822991800] [2020-07-01 12:48:55,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:55,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:55,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101815228] [2020-07-01 12:48:55,668 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:48:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1706221499, now seen corresponding path program 1 times [2020-07-01 12:48:55,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:55,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295372157] [2020-07-01 12:48:55,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:55,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:48:55,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:55,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:55,806 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:48:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:55,904 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:48:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:55,907 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:48:55,912 INFO L168 Benchmark]: Toolchain (without parser) took 2737.91 ms. Allocated memory was 514.9 MB in the beginning and 585.1 MB in the end (delta: 70.3 MB). Free memory was 439.1 MB in the beginning and 423.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 85.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,912 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:55,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.16 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 439.1 MB in the beginning and 526.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 560.5 MB. Free memory was 526.6 MB in the beginning and 524.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,914 INFO L168 Benchmark]: Boogie Preprocessor took 24.77 ms. Allocated memory is still 560.5 MB. Free memory was 524.6 MB in the beginning and 523.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,915 INFO L168 Benchmark]: RCFGBuilder took 384.44 ms. Allocated memory is still 560.5 MB. Free memory was 523.3 MB in the beginning and 498.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,915 INFO L168 Benchmark]: BlockEncodingV2 took 142.02 ms. Allocated memory is still 560.5 MB. Free memory was 498.3 MB in the beginning and 486.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,916 INFO L168 Benchmark]: TraceAbstraction took 1503.12 ms. Allocated memory was 560.5 MB in the beginning and 585.1 MB in the end (delta: 24.6 MB). Free memory was 485.4 MB in the beginning and 461.9 MB in the end (delta: 23.5 MB). Peak memory consumption was 48.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,916 INFO L168 Benchmark]: BuchiAutomizer took 323.04 ms. Allocated memory is still 585.1 MB. Free memory was 461.9 MB in the beginning and 423.9 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:55,920 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 54 locations, 57 edges - StatisticsResult: Encoded RCFG 46 locations, 82 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.16 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 439.1 MB in the beginning and 526.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 560.5 MB. Free memory was 526.6 MB in the beginning and 524.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.77 ms. Allocated memory is still 560.5 MB. Free memory was 524.6 MB in the beginning and 523.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 384.44 ms. Allocated memory is still 560.5 MB. Free memory was 523.3 MB in the beginning and 498.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 142.02 ms. Allocated memory is still 560.5 MB. Free memory was 498.3 MB in the beginning and 486.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1503.12 ms. Allocated memory was 560.5 MB in the beginning and 585.1 MB in the end (delta: 24.6 MB). Free memory was 485.4 MB in the beginning and 461.9 MB in the end (delta: 23.5 MB). Peak memory consumption was 48.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 323.04 ms. Allocated memory is still 585.1 MB. Free memory was 461.9 MB in the beginning and 423.9 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:48:55,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[c] && 0 == j_ref) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[i_ref] == 4) && 0 == i_ref) && 4 == unknown-#length-unknown[j_ref]) && 1 == \valid[j_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i_ref] - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:48:55,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:55,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:55,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[c] && 0 == j_ref) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[i_ref] == 4) && 0 == i_ref) && 4 == unknown-#length-unknown[j_ref]) && 1 == \valid[j_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 339 SDslu, 4 SDs, 0 SdLazy, 319 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:48:49.962 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_e5KC6o/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:48:56.162 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check