/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/sina1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:12,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:12,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:12,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:12,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:12,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:12,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:12,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:12,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:12,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:12,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:12,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:12,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:12,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:12,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:12,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:12,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:12,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:12,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:12,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:12,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:12,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:12,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:12,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:12,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:12,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:12,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:12,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:12,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:12,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:12,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:12,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:12,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:12,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:12,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:12,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:12,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:12,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:12,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:12,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:12,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:12,171 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:36:12,199 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:12,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:12,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:12,204 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:12,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:12,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:12,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:12,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:12,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:12,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:12,207 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:12,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:12,208 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:12,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:12,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:12,209 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:12,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:12,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:12,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:12,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:12,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:12,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:12,210 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:36:12,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:12,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:12,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:12,516 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:12,517 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:12,517 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-08 23:36:12,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47568b003/4fa5d324d59b4375ab38eb16278d90d5/FLAG6bf6f18b4 [2020-07-08 23:36:13,101 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:13,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-08 23:36:13,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47568b003/4fa5d324d59b4375ab38eb16278d90d5/FLAG6bf6f18b4 [2020-07-08 23:36:13,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47568b003/4fa5d324d59b4375ab38eb16278d90d5 [2020-07-08 23:36:13,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:13,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:13,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:13,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:13,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:13,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7530e3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13, skipping insertion in model container [2020-07-08 23:36:13,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:13,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:13,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:13,707 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:13,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:13,750 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:13,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13 WrapperNode [2020-07-08 23:36:13,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:13,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:13,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:13,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:13,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (1/1) ... [2020-07-08 23:36:13,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:13,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:13,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:13,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:13,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (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:36:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:36:13,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:36:13,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:36:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:36:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:36:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:36:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:36:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:36:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:36:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:14,416 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:14,416 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 23:36:14,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:14 BoogieIcfgContainer [2020-07-08 23:36:14,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:14,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:14,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:14,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:14,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:13" (1/3) ... [2020-07-08 23:36:14,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d40cd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:14, skipping insertion in model container [2020-07-08 23:36:14,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:13" (2/3) ... [2020-07-08 23:36:14,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d40cd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:14, skipping insertion in model container [2020-07-08 23:36:14,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:14" (3/3) ... [2020-07-08 23:36:14,430 INFO L109 eAbstractionObserver]: Analyzing ICFG sina1f.c [2020-07-08 23:36:14,440 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:14,449 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:14,462 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:14,483 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:14,484 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:14,484 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:14,484 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:14,484 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:14,485 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:14,485 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:14,485 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-08 23:36:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:36:14,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:14,515 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] [2020-07-08 23:36:14,515 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 864246722, now seen corresponding path program 1 times [2020-07-08 23:36:14,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:14,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [301527360] [2020-07-08 23:36:14,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:14,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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; {64#true} is VALID [2020-07-08 23:36:14,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-08 23:36:14,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-08 23:36:14,774 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-08 23:36:14,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-08 23:36:14,775 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-08 23:36:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:14,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-08 23:36:14,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-08 23:36:14,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-08 23:36:14,789 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-08 23:36:14,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {76#(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:36:14,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(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; {64#true} is VALID [2020-07-08 23:36:14,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-08 23:36:14,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-08 23:36:14,793 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-08 23:36:14,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-08 23:36:14,794 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-08 23:36:14,794 INFO L263 TraceCheckUtils]: 7: Hoare triple {64#true} call #t~ret8 := main(); {64#true} is VALID [2020-07-08 23:36:14,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {64#true} is VALID [2020-07-08 23:36:14,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#true} ~N~0 := #t~nondet0; {64#true} is VALID [2020-07-08 23:36:14,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {64#true} havoc #t~nondet0; {64#true} is VALID [2020-07-08 23:36:14,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {64#true} assume !(~N~0 <= 0); {64#true} is VALID [2020-07-08 23:36:14,797 INFO L263 TraceCheckUtils]: 12: Hoare triple {64#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {64#true} is VALID [2020-07-08 23:36:14,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-08 23:36:14,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-08 23:36:14,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-08 23:36:14,798 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-08 23:36:14,799 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#true} havoc ~i~0; {64#true} is VALID [2020-07-08 23:36:14,799 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {64#true} is VALID [2020-07-08 23:36:14,800 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {64#true} is VALID [2020-07-08 23:36:14,800 INFO L280 TraceCheckUtils]: 20: Hoare triple {64#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {64#true} is VALID [2020-07-08 23:36:14,801 INFO L280 TraceCheckUtils]: 21: Hoare triple {64#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {64#true} is VALID [2020-07-08 23:36:14,801 INFO L280 TraceCheckUtils]: 22: Hoare triple {64#true} ~i~0 := 0; {64#true} is VALID [2020-07-08 23:36:14,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-08 23:36:14,805 INFO L280 TraceCheckUtils]: 24: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-08 23:36:14,805 INFO L280 TraceCheckUtils]: 25: Hoare triple {65#false} assume !(~i~0 < ~N~0); {65#false} is VALID [2020-07-08 23:36:14,806 INFO L280 TraceCheckUtils]: 26: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-08 23:36:14,806 INFO L280 TraceCheckUtils]: 27: Hoare triple {65#false} assume !!(~i~0 < ~N~0); {65#false} is VALID [2020-07-08 23:36:14,807 INFO L280 TraceCheckUtils]: 28: Hoare triple {65#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {65#false} is VALID [2020-07-08 23:36:14,807 INFO L263 TraceCheckUtils]: 29: Hoare triple {65#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {65#false} is VALID [2020-07-08 23:36:14,808 INFO L280 TraceCheckUtils]: 30: Hoare triple {65#false} ~cond := #in~cond; {65#false} is VALID [2020-07-08 23:36:14,808 INFO L280 TraceCheckUtils]: 31: Hoare triple {65#false} assume 0 == ~cond; {65#false} is VALID [2020-07-08 23:36:14,809 INFO L280 TraceCheckUtils]: 32: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-08 23:36:14,814 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:36:14,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [301527360] [2020-07-08 23:36:14,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:14,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:36:14,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532053201] [2020-07-08 23:36:14,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:36:14,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:14,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:36:14,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:14,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:36:14,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:36:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:14,914 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-08 23:36:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:15,391 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-07-08 23:36:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:36:15,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:36:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-08 23:36:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-08 23:36:15,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-08 23:36:15,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:15,640 INFO L225 Difference]: With dead ends: 105 [2020-07-08 23:36:15,640 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 23:36:15,648 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:36:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 23:36:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-08 23:36:15,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:15,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-08 23:36:15,741 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 23:36:15,741 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 23:36:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:15,747 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-08 23:36:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 23:36:15,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:15,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:15,749 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 23:36:15,749 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 23:36:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:15,754 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-08 23:36:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 23:36:15,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:15,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:15,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:15,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 23:36:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-08 23:36:15,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 33 [2020-07-08 23:36:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:15,762 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-08 23:36:15,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:15,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-08 23:36:15,838 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-08 23:36:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 23:36:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:36:15,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:15,840 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] [2020-07-08 23:36:15,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:15,841 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1269072019, now seen corresponding path program 1 times [2020-07-08 23:36:15,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:15,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491480369] [2020-07-08 23:36:15,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:15,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#(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; {497#true} is VALID [2020-07-08 23:36:15,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-08 23:36:15,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-08 23:36:15,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-08 23:36:15,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-08 23:36:15,976 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-08 23:36:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:15,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-08 23:36:15,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-08 23:36:15,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-08 23:36:15,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {511#(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:36:15,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(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; {497#true} is VALID [2020-07-08 23:36:15,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-08 23:36:15,989 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-08 23:36:15,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-08 23:36:15,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-08 23:36:15,990 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-08 23:36:15,990 INFO L263 TraceCheckUtils]: 7: Hoare triple {497#true} call #t~ret8 := main(); {497#true} is VALID [2020-07-08 23:36:15,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {497#true} is VALID [2020-07-08 23:36:15,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#true} ~N~0 := #t~nondet0; {497#true} is VALID [2020-07-08 23:36:15,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {497#true} havoc #t~nondet0; {497#true} is VALID [2020-07-08 23:36:15,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {497#true} assume !(~N~0 <= 0); {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,993 INFO L263 TraceCheckUtils]: 12: Hoare triple {505#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {497#true} is VALID [2020-07-08 23:36:15,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-08 23:36:15,993 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-08 23:36:15,993 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-08 23:36:15,995 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,995 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#(<= 1 ~N~0)} havoc ~i~0; {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,996 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,997 INFO L280 TraceCheckUtils]: 20: Hoare triple {505#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,998 INFO L280 TraceCheckUtils]: 21: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {505#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:15,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {505#(<= 1 ~N~0)} ~i~0 := 0; {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:16,000 INFO L280 TraceCheckUtils]: 23: Hoare triple {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-08 23:36:16,001 INFO L280 TraceCheckUtils]: 24: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-08 23:36:16,001 INFO L280 TraceCheckUtils]: 25: Hoare triple {498#false} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-08 23:36:16,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-08 23:36:16,001 INFO L280 TraceCheckUtils]: 27: Hoare triple {498#false} assume !!(~i~0 < ~N~0); {498#false} is VALID [2020-07-08 23:36:16,002 INFO L280 TraceCheckUtils]: 28: Hoare triple {498#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {498#false} is VALID [2020-07-08 23:36:16,002 INFO L263 TraceCheckUtils]: 29: Hoare triple {498#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {498#false} is VALID [2020-07-08 23:36:16,002 INFO L280 TraceCheckUtils]: 30: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2020-07-08 23:36:16,002 INFO L280 TraceCheckUtils]: 31: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2020-07-08 23:36:16,003 INFO L280 TraceCheckUtils]: 32: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-08 23:36:16,005 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:36:16,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491480369] [2020-07-08 23:36:16,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:16,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:16,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060960755] [2020-07-08 23:36:16,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:36:16,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:16,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:16,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:16,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:16,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:16,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:16,049 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2020-07-08 23:36:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:16,550 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-07-08 23:36:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:16,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:36:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-08 23:36:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-08 23:36:16,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2020-07-08 23:36:16,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:16,703 INFO L225 Difference]: With dead ends: 92 [2020-07-08 23:36:16,703 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 23:36:16,705 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:36:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 23:36:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-08 23:36:16,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:16,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-08 23:36:16,807 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-08 23:36:16,808 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-08 23:36:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:16,814 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-08 23:36:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-08 23:36:16,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:16,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:16,815 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-08 23:36:16,815 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-08 23:36:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:16,820 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-08 23:36:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-08 23:36:16,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:16,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:16,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:16,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 23:36:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-07-08 23:36:16,825 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 33 [2020-07-08 23:36:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:16,825 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-07-08 23:36:16,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:16,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2020-07-08 23:36:16,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-08 23:36:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 23:36:16,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:16,906 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] [2020-07-08 23:36:16,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:16,907 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1661969402, now seen corresponding path program 1 times [2020-07-08 23:36:16,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:16,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121438709] [2020-07-08 23:36:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:17,034 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:36:17,035 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:36:17,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:17,089 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:36:17,089 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:17,090 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:36:17,091 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:36:17,092 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:17,093 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 23:36:17,094 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L40-6 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 23:36:17,095 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L30-6 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:36:17,096 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-08 23:36:17,097 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:36:17,098 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:36:17,098 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:36:17,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:36:17 BoogieIcfgContainer [2020-07-08 23:36:17,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:36:17,104 INFO L168 Benchmark]: Toolchain (without parser) took 3629.51 ms. Allocated memory was 146.3 MB in the beginning and 245.4 MB in the end (delta: 99.1 MB). Free memory was 104.6 MB in the beginning and 121.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:17,104 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 23:36:17,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.71 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:17,106 INFO L168 Benchmark]: Boogie Preprocessor took 146.88 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.7 MB in the beginning and 181.5 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:17,107 INFO L168 Benchmark]: RCFGBuilder took 522.91 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 153.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:17,108 INFO L168 Benchmark]: TraceAbstraction took 2678.51 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 153.3 MB in the beginning and 121.0 MB in the end (delta: 32.3 MB). Peak memory consumption was 73.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:17,111 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 146.3 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.71 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.88 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.7 MB in the beginning and 181.5 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 522.91 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 153.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2678.51 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 153.3 MB in the beginning and 121.0 MB in the end (delta: 32.3 MB). Peak memory consumption was 73.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)=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 sum[1]; VAL [\old(N)=0, N=1, sum={3:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={3:0}] [L29] sum[0] = 1 VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={3:0}] [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={3:0}] [L30] COND TRUE i