/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/condnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:35:07,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:35:07,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:35:07,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:35:07,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:35:07,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:35:07,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:35:07,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:35:07,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:35:07,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:35:07,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:35:07,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:35:07,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:35:07,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:35:07,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:35:07,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:35:07,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:35:07,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:35:07,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:35:07,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:35:07,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:35:07,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:35:07,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:35:07,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:35:07,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:35:07,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:35:07,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:35:07,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:35:07,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:35:07,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:35:07,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:35:07,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:35:07,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:35:07,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:35:07,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:35:07,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:35:07,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:35:07,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:35:07,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:35:07,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:35:07,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:35:07,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:35:07,712 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:35:07,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:35:07,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:35:07,719 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:35:07,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:35:07,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:35:07,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:35:07,720 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:35:07,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:35:07,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:35:07,721 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:35:07,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:35:07,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:35:07,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:07,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:35:07,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:35:07,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:35:07,722 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:35:08,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:35:08,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:35:08,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:35:08,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:35:08,072 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:35:08,073 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condnf.c [2020-07-08 23:35:08,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b699663cc/cc01b5bfc06c475caea32672e318cbb6/FLAGfc33ad7ec [2020-07-08 23:35:08,750 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:35:08,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condnf.c [2020-07-08 23:35:08,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b699663cc/cc01b5bfc06c475caea32672e318cbb6/FLAGfc33ad7ec [2020-07-08 23:35:09,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b699663cc/cc01b5bfc06c475caea32672e318cbb6 [2020-07-08 23:35:09,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:35:09,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:35:09,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:09,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:35:09,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:35:09,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0efb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09, skipping insertion in model container [2020-07-08 23:35:09,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:35:09,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:35:09,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:09,391 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:35:09,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:09,440 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:35:09,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09 WrapperNode [2020-07-08 23:35:09,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:09,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:35:09,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:35:09,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:35:09,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... [2020-07-08 23:35:09,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:35:09,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:35:09,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:35:09,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:35:09,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:35:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:35:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:35:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:35:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:35:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:35:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:35:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:35:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:35:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:35:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:35:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:35:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:35:10,264 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:35:10,266 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 23:35:10,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:10 BoogieIcfgContainer [2020-07-08 23:35:10,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:10,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:10,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:10,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:10,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:35:09" (1/3) ... [2020-07-08 23:35:10,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc5696d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:10, skipping insertion in model container [2020-07-08 23:35:10,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:09" (2/3) ... [2020-07-08 23:35:10,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc5696d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:10, skipping insertion in model container [2020-07-08 23:35:10,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:10" (3/3) ... [2020-07-08 23:35:10,301 INFO L109 eAbstractionObserver]: Analyzing ICFG condnf.c [2020-07-08 23:35:10,314 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:10,326 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:10,345 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:10,382 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:10,382 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:10,382 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:10,382 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:10,383 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:10,383 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:10,383 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:10,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-07-08 23:35:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:35:10,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:10,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:10,424 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash -386984160, now seen corresponding path program 1 times [2020-07-08 23:35:10,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:10,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810740666] [2020-07-08 23:35:10,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:10,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {65#true} is VALID [2020-07-08 23:35:10,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-08 23:35:10,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-08 23:35:10,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-08 23:35:10,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 23:35:10,719 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-08 23:35:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:10,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-08 23:35:10,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-08 23:35:10,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 23:35:10,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-08 23:35:10,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {77#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:10,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {65#true} is VALID [2020-07-08 23:35:10,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-08 23:35:10,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-08 23:35:10,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-08 23:35:10,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 23:35:10,738 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-08 23:35:10,738 INFO L263 TraceCheckUtils]: 7: Hoare triple {65#true} call #t~ret9 := main(); {65#true} is VALID [2020-07-08 23:35:10,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65#true} is VALID [2020-07-08 23:35:10,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#true} ~N~0 := #t~nondet0; {65#true} is VALID [2020-07-08 23:35:10,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {65#true} havoc #t~nondet0; {65#true} is VALID [2020-07-08 23:35:10,741 INFO L280 TraceCheckUtils]: 11: Hoare triple {65#true} assume !(~N~0 <= 0); {65#true} is VALID [2020-07-08 23:35:10,742 INFO L263 TraceCheckUtils]: 12: Hoare triple {65#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {65#true} is VALID [2020-07-08 23:35:10,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-08 23:35:10,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-08 23:35:10,743 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 23:35:10,743 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-08 23:35:10,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {65#true} havoc ~i~0; {65#true} is VALID [2020-07-08 23:35:10,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {65#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {65#true} is VALID [2020-07-08 23:35:10,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {65#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {65#true} is VALID [2020-07-08 23:35:10,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#true} ~i~0 := 0; {65#true} is VALID [2020-07-08 23:35:10,747 INFO L280 TraceCheckUtils]: 21: Hoare triple {65#true} assume !true; {66#false} is VALID [2020-07-08 23:35:10,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-08 23:35:10,748 INFO L280 TraceCheckUtils]: 23: Hoare triple {66#false} assume !true; {66#false} is VALID [2020-07-08 23:35:10,748 INFO L280 TraceCheckUtils]: 24: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-08 23:35:10,749 INFO L280 TraceCheckUtils]: 25: Hoare triple {66#false} assume !!(~i~0 < ~N~0); {66#false} is VALID [2020-07-08 23:35:10,749 INFO L280 TraceCheckUtils]: 26: Hoare triple {66#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {66#false} is VALID [2020-07-08 23:35:10,750 INFO L263 TraceCheckUtils]: 27: Hoare triple {66#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {66#false} is VALID [2020-07-08 23:35:10,750 INFO L280 TraceCheckUtils]: 28: Hoare triple {66#false} ~cond := #in~cond; {66#false} is VALID [2020-07-08 23:35:10,751 INFO L280 TraceCheckUtils]: 29: Hoare triple {66#false} assume 0 == ~cond; {66#false} is VALID [2020-07-08 23:35:10,751 INFO L280 TraceCheckUtils]: 30: Hoare triple {66#false} assume !false; {66#false} is VALID [2020-07-08 23:35:10,758 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-08 23:35:10,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810740666] [2020-07-08 23:35:10,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:10,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:10,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850535354] [2020-07-08 23:35:10,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:35:10,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:10,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:10,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:10,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:10,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:10,891 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-07-08 23:35:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:11,407 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2020-07-08 23:35:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:11,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:35:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-08 23:35:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-08 23:35:11,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2020-07-08 23:35:11,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:11,648 INFO L225 Difference]: With dead ends: 107 [2020-07-08 23:35:11,649 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 23:35:11,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08 23:35:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 23:35:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-08 23:35:11,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:11,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-08 23:35:11,780 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 23:35:11,781 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 23:35:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:11,788 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-08 23:35:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 23:35:11,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:11,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:11,790 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 23:35:11,790 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 23:35:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:11,797 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-08 23:35:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 23:35:11,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:11,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:11,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:11,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 23:35:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-08 23:35:11,806 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 31 [2020-07-08 23:35:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:11,806 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-08 23:35:11,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:35:11,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-08 23:35:11,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 23:35:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:35:11,898 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:11,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:11,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:35:11,898 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1278196063, now seen corresponding path program 1 times [2020-07-08 23:35:11,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:11,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799010305] [2020-07-08 23:35:11,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:12,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {514#true} is VALID [2020-07-08 23:35:12,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-08 23:35:12,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-08 23:35:12,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-08 23:35:12,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:35:12,099 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-08 23:35:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:12,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-08 23:35:12,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-08 23:35:12,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:35:12,111 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:12,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {514#true} is VALID [2020-07-08 23:35:12,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-08 23:35:12,114 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-08 23:35:12,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-08 23:35:12,115 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:35:12,115 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-08 23:35:12,115 INFO L263 TraceCheckUtils]: 7: Hoare triple {514#true} call #t~ret9 := main(); {514#true} is VALID [2020-07-08 23:35:12,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {514#true} is VALID [2020-07-08 23:35:12,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} ~N~0 := #t~nondet0; {514#true} is VALID [2020-07-08 23:35:12,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} havoc #t~nondet0; {514#true} is VALID [2020-07-08 23:35:12,117 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} assume !(~N~0 <= 0); {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,118 INFO L263 TraceCheckUtils]: 12: Hoare triple {522#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {514#true} is VALID [2020-07-08 23:35:12,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-08 23:35:12,119 INFO L280 TraceCheckUtils]: 14: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-08 23:35:12,119 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:35:12,121 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,122 INFO L280 TraceCheckUtils]: 17: Hoare triple {522#(<= 1 ~N~0)} havoc ~i~0; {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,122 INFO L280 TraceCheckUtils]: 18: Hoare triple {522#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,123 INFO L280 TraceCheckUtils]: 19: Hoare triple {522#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {522#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:12,124 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(<= 1 ~N~0)} ~i~0 := 0; {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:12,126 INFO L280 TraceCheckUtils]: 21: Hoare triple {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 23:35:12,126 INFO L280 TraceCheckUtils]: 22: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-08 23:35:12,127 INFO L280 TraceCheckUtils]: 23: Hoare triple {515#false} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 23:35:12,127 INFO L280 TraceCheckUtils]: 24: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-08 23:35:12,127 INFO L280 TraceCheckUtils]: 25: Hoare triple {515#false} assume !!(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 23:35:12,128 INFO L280 TraceCheckUtils]: 26: Hoare triple {515#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {515#false} is VALID [2020-07-08 23:35:12,128 INFO L263 TraceCheckUtils]: 27: Hoare triple {515#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {515#false} is VALID [2020-07-08 23:35:12,128 INFO L280 TraceCheckUtils]: 28: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2020-07-08 23:35:12,129 INFO L280 TraceCheckUtils]: 29: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2020-07-08 23:35:12,129 INFO L280 TraceCheckUtils]: 30: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-08 23:35:12,133 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-08 23:35:12,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799010305] [2020-07-08 23:35:12,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:12,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:35:12,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432730954] [2020-07-08 23:35:12,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:35:12,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:12,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:35:12,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:12,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:35:12,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:35:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:35:12,182 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-07-08 23:35:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:12,915 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-07-08 23:35:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:35:12,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:35:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-08 23:35:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-08 23:35:12,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2020-07-08 23:35:13,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:13,124 INFO L225 Difference]: With dead ends: 105 [2020-07-08 23:35:13,125 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 23:35:13,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:35:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 23:35:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2020-07-08 23:35:13,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:13,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 57 states. [2020-07-08 23:35:13,247 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 57 states. [2020-07-08 23:35:13,248 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 57 states. [2020-07-08 23:35:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:13,255 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-08 23:35:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-08 23:35:13,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:13,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:13,256 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 78 states. [2020-07-08 23:35:13,257 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 78 states. [2020-07-08 23:35:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:13,262 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-08 23:35:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-08 23:35:13,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:13,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:13,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:13,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 23:35:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-08 23:35:13,269 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 31 [2020-07-08 23:35:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:13,269 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-08 23:35:13,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:35:13,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-08 23:35:13,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-08 23:35:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 23:35:13,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:13,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:13,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:35:13,380 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash -620119431, now seen corresponding path program 1 times [2020-07-08 23:35:13,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:13,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1542773989] [2020-07-08 23:35:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:13,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {1034#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1014#true} is VALID [2020-07-08 23:35:13,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {1014#true} #valid := #valid[0 := 0]; {1014#true} is VALID [2020-07-08 23:35:13,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {1014#true} assume 0 < #StackHeapBarrier; {1014#true} is VALID [2020-07-08 23:35:13,791 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#true} ~N~0 := 0; {1014#true} is VALID [2020-07-08 23:35:13,791 INFO L280 TraceCheckUtils]: 4: Hoare triple {1014#true} assume true; {1014#true} is VALID [2020-07-08 23:35:13,792 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1014#true} {1014#true} #113#return; {1014#true} is VALID [2020-07-08 23:35:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:13,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {1014#true} ~cond := #in~cond; {1014#true} is VALID [2020-07-08 23:35:13,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {1014#true} assume !(0 == ~cond); {1014#true} is VALID [2020-07-08 23:35:13,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {1014#true} assume true; {1014#true} is VALID [2020-07-08 23:35:13,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1014#true} {1014#true} #109#return; {1014#true} is VALID [2020-07-08 23:35:13,814 INFO L263 TraceCheckUtils]: 0: Hoare triple {1014#true} call ULTIMATE.init(); {1034#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:13,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {1034#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1014#true} is VALID [2020-07-08 23:35:13,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {1014#true} #valid := #valid[0 := 0]; {1014#true} is VALID [2020-07-08 23:35:13,815 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#true} assume 0 < #StackHeapBarrier; {1014#true} is VALID [2020-07-08 23:35:13,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {1014#true} ~N~0 := 0; {1014#true} is VALID [2020-07-08 23:35:13,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {1014#true} assume true; {1014#true} is VALID [2020-07-08 23:35:13,819 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1014#true} {1014#true} #113#return; {1014#true} is VALID [2020-07-08 23:35:13,819 INFO L263 TraceCheckUtils]: 7: Hoare triple {1014#true} call #t~ret9 := main(); {1014#true} is VALID [2020-07-08 23:35:13,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {1014#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1014#true} is VALID [2020-07-08 23:35:13,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {1014#true} ~N~0 := #t~nondet0; {1014#true} is VALID [2020-07-08 23:35:13,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {1014#true} havoc #t~nondet0; {1014#true} is VALID [2020-07-08 23:35:13,821 INFO L280 TraceCheckUtils]: 11: Hoare triple {1014#true} assume !(~N~0 <= 0); {1014#true} is VALID [2020-07-08 23:35:13,822 INFO L263 TraceCheckUtils]: 12: Hoare triple {1014#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1014#true} is VALID [2020-07-08 23:35:13,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {1014#true} ~cond := #in~cond; {1014#true} is VALID [2020-07-08 23:35:13,828 INFO L280 TraceCheckUtils]: 14: Hoare triple {1014#true} assume !(0 == ~cond); {1014#true} is VALID [2020-07-08 23:35:13,828 INFO L280 TraceCheckUtils]: 15: Hoare triple {1014#true} assume true; {1014#true} is VALID [2020-07-08 23:35:13,829 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1014#true} {1014#true} #109#return; {1014#true} is VALID [2020-07-08 23:35:13,829 INFO L280 TraceCheckUtils]: 17: Hoare triple {1014#true} havoc ~i~0; {1014#true} is VALID [2020-07-08 23:35:13,832 INFO L280 TraceCheckUtils]: 18: Hoare triple {1014#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {1026#(= 0 |main_#t~malloc1.offset|)} is VALID [2020-07-08 23:35:13,833 INFO L280 TraceCheckUtils]: 19: Hoare triple {1026#(= 0 |main_#t~malloc1.offset|)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,834 INFO L280 TraceCheckUtils]: 20: Hoare triple {1027#(= 0 main_~a~0.offset)} ~i~0 := 0; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,836 INFO L280 TraceCheckUtils]: 21: Hoare triple {1027#(= 0 main_~a~0.offset)} assume !!(~i~0 < ~N~0); {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,837 INFO L280 TraceCheckUtils]: 22: Hoare triple {1027#(= 0 main_~a~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,839 INFO L280 TraceCheckUtils]: 23: Hoare triple {1027#(= 0 main_~a~0.offset)} SUMMARY for call write~int(#t~nondet3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L30-1 {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,840 INFO L280 TraceCheckUtils]: 24: Hoare triple {1027#(= 0 main_~a~0.offset)} havoc #t~nondet3; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {1027#(= 0 main_~a~0.offset)} #t~post2 := ~i~0; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,842 INFO L280 TraceCheckUtils]: 26: Hoare triple {1027#(= 0 main_~a~0.offset)} ~i~0 := 1 + #t~post2; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,842 INFO L280 TraceCheckUtils]: 27: Hoare triple {1027#(= 0 main_~a~0.offset)} havoc #t~post2; {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,843 INFO L280 TraceCheckUtils]: 28: Hoare triple {1027#(= 0 main_~a~0.offset)} assume !(~i~0 < ~N~0); {1027#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:13,864 INFO L280 TraceCheckUtils]: 29: Hoare triple {1027#(= 0 main_~a~0.offset)} ~i~0 := 0; {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,866 INFO L280 TraceCheckUtils]: 30: Hoare triple {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,868 INFO L280 TraceCheckUtils]: 31: Hoare triple {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L35 {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,870 INFO L280 TraceCheckUtils]: 32: Hoare triple {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !(#t~mem5 > ~N~0); {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,871 INFO L280 TraceCheckUtils]: 33: Hoare triple {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} havoc #t~mem5; {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,873 INFO L280 TraceCheckUtils]: 34: Hoare triple {1028#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} SUMMARY for call write~int(~N~0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L38 {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,875 INFO L280 TraceCheckUtils]: 35: Hoare triple {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} #t~post4 := ~i~0; {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2020-07-08 23:35:13,880 INFO L280 TraceCheckUtils]: 36: Hoare triple {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} ~i~0 := 1 + #t~post4; {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2020-07-08 23:35:13,882 INFO L280 TraceCheckUtils]: 37: Hoare triple {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} havoc #t~post4; {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2020-07-08 23:35:13,883 INFO L280 TraceCheckUtils]: 38: Hoare triple {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} assume !(~i~0 < ~N~0); {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2020-07-08 23:35:13,884 INFO L280 TraceCheckUtils]: 39: Hoare triple {1030#(and (= 0 main_~a~0.offset) (= ~N~0 (select (select |#memory_int| main_~a~0.base) 0)))} ~i~0 := 0; {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,886 INFO L280 TraceCheckUtils]: 40: Hoare triple {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:13,887 INFO L280 TraceCheckUtils]: 41: Hoare triple {1029#(and (= ~N~0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {1031#(= ~N~0 |main_#t~mem8|)} is VALID [2020-07-08 23:35:13,888 INFO L263 TraceCheckUtils]: 42: Hoare triple {1031#(= ~N~0 |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {1032#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:35:13,889 INFO L280 TraceCheckUtils]: 43: Hoare triple {1032#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1033#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:35:13,890 INFO L280 TraceCheckUtils]: 44: Hoare triple {1033#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1015#false} is VALID [2020-07-08 23:35:13,890 INFO L280 TraceCheckUtils]: 45: Hoare triple {1015#false} assume !false; {1015#false} is VALID [2020-07-08 23:35:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 23:35:13,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1542773989] [2020-07-08 23:35:13,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:35:13,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:35:13,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237480424] [2020-07-08 23:35:13,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-07-08 23:35:13,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:13,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:35:13,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:13,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:35:13,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:35:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:35:13,959 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2020-07-08 23:35:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:15,531 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-07-08 23:35:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:35:15,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-07-08 23:35:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:35:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2020-07-08 23:35:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:35:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2020-07-08 23:35:15,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 119 transitions. [2020-07-08 23:35:15,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:15,752 INFO L225 Difference]: With dead ends: 111 [2020-07-08 23:35:15,752 INFO L226 Difference]: Without dead ends: 109 [2020-07-08 23:35:15,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:35:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-08 23:35:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2020-07-08 23:35:15,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:15,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 73 states. [2020-07-08 23:35:15,958 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 73 states. [2020-07-08 23:35:15,958 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 73 states. [2020-07-08 23:35:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:15,965 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2020-07-08 23:35:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2020-07-08 23:35:15,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:15,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:15,967 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 109 states. [2020-07-08 23:35:15,967 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 109 states. [2020-07-08 23:35:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:15,973 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2020-07-08 23:35:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2020-07-08 23:35:15,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:15,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:15,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:15,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-08 23:35:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-07-08 23:35:15,978 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 46 [2020-07-08 23:35:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:15,979 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-07-08 23:35:15,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:35:15,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 78 transitions. [2020-07-08 23:35:16,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-07-08 23:35:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:35:16,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:16,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:16,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:35:16,118 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1321326334, now seen corresponding path program 1 times [2020-07-08 23:35:16,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:16,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503425047] [2020-07-08 23:35:16,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:16,226 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:35:16,226 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:35:16,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:35:16,322 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:16,323 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:35:16,324 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:35:16,325 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:35:16,326 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 23:35:16,327 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-08 23:35:16,328 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L28-7 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L42-6 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 23:35:16,329 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:35:16,330 WARN L170 areAnnotationChecker]: L28-5 has no Hoare annotation [2020-07-08 23:35:16,331 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-08 23:35:16,331 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:35:16,331 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-08 23:35:16,331 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 23:35:16,331 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 23:35:16,331 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:35:16,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:35:16 BoogieIcfgContainer [2020-07-08 23:35:16,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:35:16,339 INFO L168 Benchmark]: Toolchain (without parser) took 7224.73 ms. Allocated memory was 144.7 MB in the beginning and 284.7 MB in the end (delta: 140.0 MB). Free memory was 103.0 MB in the beginning and 208.7 MB in the end (delta: -105.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,340 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.26 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 91.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,342 INFO L168 Benchmark]: Boogie Preprocessor took 166.95 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.9 MB in the beginning and 180.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,343 INFO L168 Benchmark]: RCFGBuilder took 672.60 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 152.0 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,344 INFO L168 Benchmark]: TraceAbstraction took 6047.56 ms. Allocated memory was 202.4 MB in the beginning and 284.7 MB in the end (delta: 82.3 MB). Free memory was 151.4 MB in the beginning and 208.7 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:16,348 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 324.26 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 91.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.95 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.9 MB in the beginning and 180.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 672.60 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 152.0 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6047.56 ms. Allocated memory was 202.4 MB in the beginning and 284.7 MB in the end (delta: 82.3 MB). Free memory was 151.4 MB in the beginning and 208.7 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=6, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND TRUE i N VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L36] EXPR a[i] VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L36] a[i] = a[i] VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND FALSE !(i