/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/brs4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:26:04,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:26:04,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:26:04,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:26:04,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:26:04,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:26:04,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:26:04,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:26:04,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:26:04,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:26:04,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:26:04,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:26:04,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:26:04,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:26:04,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:26:04,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:26:04,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:26:04,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:26:04,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:26:04,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:26:04,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:26:04,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:26:04,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:26:04,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:26:04,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:26:04,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:26:04,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:26:04,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:26:04,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:26:04,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:26:04,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:26:04,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:26:04,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:26:04,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:26:04,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:26:04,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:26:04,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:26:04,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:26:04,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:26:04,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:26:04,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:26:04,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:26:04,807 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:26:04,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:26:04,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:26:04,810 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:26:04,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:26:04,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:26:04,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:26:04,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:26:04,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:26:04,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:26:04,811 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:26:04,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:26:04,813 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:26:04,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:26:04,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:26:04,814 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:26:04,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:26:04,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:26:04,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:26:04,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:26:04,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:26:04,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:26:04,815 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-11 02:26:05,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:26:05,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:26:05,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:26:05,088 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:26:05,088 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:26:05,089 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs4f.c [2020-07-11 02:26:05,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d40bcbc/f38d94aa9a984182b85d40357e17d93c/FLAG0a7122206 [2020-07-11 02:26:05,650 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:26:05,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs4f.c [2020-07-11 02:26:05,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d40bcbc/f38d94aa9a984182b85d40357e17d93c/FLAG0a7122206 [2020-07-11 02:26:06,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d40bcbc/f38d94aa9a984182b85d40357e17d93c [2020-07-11 02:26:06,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:26:06,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:26:06,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:06,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:26:06,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:26:06,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a520b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06, skipping insertion in model container [2020-07-11 02:26:06,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:26:06,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:26:06,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:06,260 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:26:06,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:06,384 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:26:06,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06 WrapperNode [2020-07-11 02:26:06,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:06,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:26:06,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:26:06,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:26:06,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (1/1) ... [2020-07-11 02:26:06,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:26:06,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:26:06,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:26:06,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:26:06,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (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-11 02:26:06,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:26:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:26:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:26:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:26:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:26:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:26:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:26:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:26:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:26:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:26:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:26:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:26:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:26:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:26:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:26:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:26:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:26:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:26:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:26:06,898 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:26:06,898 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 02:26:06,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:06 BoogieIcfgContainer [2020-07-11 02:26:06,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:26:06,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:26:06,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:26:06,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:26:06,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:26:06" (1/3) ... [2020-07-11 02:26:06,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b4d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:06, skipping insertion in model container [2020-07-11 02:26:06,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:06" (2/3) ... [2020-07-11 02:26:06,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b4d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:06, skipping insertion in model container [2020-07-11 02:26:06,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:06" (3/3) ... [2020-07-11 02:26:06,911 INFO L109 eAbstractionObserver]: Analyzing ICFG brs4f.c [2020-07-11 02:26:06,919 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:26:06,924 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:26:06,937 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:26:06,955 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:26:06,955 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:26:06,955 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:26:06,956 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:26:06,956 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:26:06,956 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:26:06,956 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:26:06,956 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:26:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-11 02:26:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 02:26:06,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:06,987 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] [2020-07-11 02:26:06,987 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-11 02:26:07,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:07,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904445299] [2020-07-11 02:26:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:07,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(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; {62#true} is VALID [2020-07-11 02:26:07,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-11 02:26:07,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-11 02:26:07,288 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-11 02:26:07,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-11 02:26:07,290 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-11 02:26:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:07,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-11 02:26:07,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-11 02:26:07,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-11 02:26:07,301 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-11 02:26:07,303 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:07,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(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; {62#true} is VALID [2020-07-11 02:26:07,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-11 02:26:07,304 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-11 02:26:07,305 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-11 02:26:07,305 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-11 02:26:07,306 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-11 02:26:07,306 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-11 02:26:07,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-11 02:26:07,307 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-11 02:26:07,308 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-11 02:26:07,308 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-11 02:26:07,309 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-11 02:26:07,309 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-11 02:26:07,309 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-11 02:26:07,310 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-11 02:26:07,310 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-11 02:26:07,311 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-11 02:26:07,311 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-11 02:26:07,312 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-11 02:26:07,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-11 02:26:07,312 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-11 02:26:07,314 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-11 02:26:07,314 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-11 02:26:07,315 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-11 02:26:07,315 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-11 02:26:07,315 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 4 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-11 02:26:07,316 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-11 02:26:07,316 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-11 02:26:07,317 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-11 02:26:07,321 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-11 02:26:07,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904445299] [2020-07-11 02:26:07,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:07,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:26:07,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98594233] [2020-07-11 02:26:07,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 02:26:07,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:07,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:26:07,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:07,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:26:07,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:26:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:26:07,419 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-11 02:26:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:07,871 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-11 02:26:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:26:07,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 02:26:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-11 02:26:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-11 02:26:07,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-11 02:26:08,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:08,055 INFO L225 Difference]: With dead ends: 101 [2020-07-11 02:26:08,056 INFO L226 Difference]: Without dead ends: 47 [2020-07-11 02:26:08,060 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-11 02:26:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-11 02:26:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-11 02:26:08,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:08,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-11 02:26:08,147 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 02:26:08,147 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 02:26:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:08,153 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-11 02:26:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:26:08,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:08,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 02:26:08,155 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 02:26:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:08,162 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-11 02:26:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:26:08,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:08,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:08,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:08,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 02:26:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-11 02:26:08,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-11 02:26:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:08,170 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-11 02:26:08,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:26:08,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-11 02:26:08,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:26:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 02:26:08,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:08,237 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] [2020-07-11 02:26:08,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:26:08,237 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-11 02:26:08,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:08,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268982] [2020-07-11 02:26:08,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:08,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(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; {467#true} is VALID [2020-07-11 02:26:08,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-11 02:26:08,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-11 02:26:08,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-11 02:26:08,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-11 02:26:08,376 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-11 02:26:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:08,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-11 02:26:08,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-11 02:26:08,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-11 02:26:08,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:08,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(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; {467#true} is VALID [2020-07-11 02:26:08,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-11 02:26:08,398 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-11 02:26:08,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-11 02:26:08,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-11 02:26:08,398 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-11 02:26:08,399 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-11 02:26:08,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-11 02:26:08,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-11 02:26:08,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-11 02:26:08,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,401 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-11 02:26:08,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-11 02:26:08,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-11 02:26:08,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-11 02:26:08,403 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:08,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:26:08,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-11 02:26:08,408 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-11 02:26:08,408 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-11 02:26:08,409 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-11 02:26:08,409 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 4 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-11 02:26:08,409 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-11 02:26:08,410 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-11 02:26:08,410 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-11 02:26:08,412 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-11 02:26:08,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268982] [2020-07-11 02:26:08,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:08,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:26:08,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29215533] [2020-07-11 02:26:08,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-11 02:26:08,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:08,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:26:08,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:08,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:26:08,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:26:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:26:08,452 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-11 02:26:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:08,899 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-11 02:26:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:26:08,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-11 02:26:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-11 02:26:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-11 02:26:08,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-11 02:26:09,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:09,013 INFO L225 Difference]: With dead ends: 81 [2020-07-11 02:26:09,013 INFO L226 Difference]: Without dead ends: 56 [2020-07-11 02:26:09,014 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-11 02:26:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-11 02:26:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-11 02:26:09,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:09,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-11 02:26:09,107 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-11 02:26:09,107 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-11 02:26:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:09,113 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-11 02:26:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-11 02:26:09,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:09,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:09,114 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-11 02:26:09,114 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-11 02:26:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:09,118 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-11 02:26:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-11 02:26:09,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:09,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:09,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:09,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-11 02:26:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-11 02:26:09,122 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-11 02:26:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:09,123 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-11 02:26:09,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:26:09,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-11 02:26:09,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-11 02:26:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 02:26:09,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:09,189 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] [2020-07-11 02:26:09,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:26:09,189 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-11 02:26:09,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:09,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865303856] [2020-07-11 02:26:09,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:09,290 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:26:09,290 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:26:09,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:26:09,333 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:26:09,333 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:09,333 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:09,334 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:26:09,335 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:26:09,336 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:26:09,337 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-11 02:26:09,338 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:26:09,339 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 02:26:09,340 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-11 02:26:09,341 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-11 02:26:09,342 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-11 02:26:09,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:26:09 BoogieIcfgContainer [2020-07-11 02:26:09,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:26:09,352 INFO L168 Benchmark]: Toolchain (without parser) took 3328.70 ms. Allocated memory was 139.5 MB in the beginning and 245.9 MB in the end (delta: 106.4 MB). Free memory was 102.9 MB in the beginning and 141.4 MB in the end (delta: -38.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,353 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.57 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 183.1 MB in the end (delta: -80.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,355 INFO L168 Benchmark]: Boogie Preprocessor took 55.69 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,356 INFO L168 Benchmark]: RCFGBuilder took 460.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.9 MB in the beginning and 152.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,357 INFO L168 Benchmark]: TraceAbstraction took 2441.58 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 152.1 MB in the beginning and 141.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:09,360 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.25 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.57 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 183.1 MB in the end (delta: -80.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.69 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 460.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.9 MB in the beginning and 152.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2441.58 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 152.1 MB in the beginning and 141.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 52.7 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)=42, 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] long long sum[1]; VAL [\old(N)=0, N=1, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] COND TRUE i