/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/res2of.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:35:46,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:35:46,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:35:46,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:35:46,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:35:46,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:35:46,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:35:46,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:35:46,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:35:46,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:35:46,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:35:46,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:35:46,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:35:46,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:35:46,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:35:46,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:35:46,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:35:46,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:35:46,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:35:46,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:35:46,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:35:46,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:35:46,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:35:46,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:35:46,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:35:46,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:35:46,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:35:46,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:35:46,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:35:46,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:35:46,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:35:46,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:35:46,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:35:46,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:35:46,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:35:46,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:35:46,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:35:46,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:35:46,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:35:46,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:35:46,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:35:46,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:35:46,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:35:46,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:35:46,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:35:46,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:35:46,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:35:46,831 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:35:46,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:35:46,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:35:46,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:35:46,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:35:46,833 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:35:46,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:35:46,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:35:46,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:46,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:35:46,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:35:46,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:35:46,834 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:35:47,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:35:47,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:35:47,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:35:47,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:35:47,123 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:35:47,124 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2of.c [2020-07-08 23:35:47,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7c1d37/c507715f766b4f39bd4df3032ba7bc26/FLAGd7af86ed5 [2020-07-08 23:35:47,577 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:35:47,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2of.c [2020-07-08 23:35:47,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7c1d37/c507715f766b4f39bd4df3032ba7bc26/FLAGd7af86ed5 [2020-07-08 23:35:47,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7c1d37/c507715f766b4f39bd4df3032ba7bc26 [2020-07-08 23:35:47,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:35:47,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:35:47,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:47,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:35:47,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:35:47,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:47" (1/1) ... [2020-07-08 23:35:47,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1583b615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:47, skipping insertion in model container [2020-07-08 23:35:47,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:47" (1/1) ... [2020-07-08 23:35:47,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:35:47,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:35:48,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:48,210 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:35:48,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:48,256 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:35:48,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48 WrapperNode [2020-07-08 23:35:48,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:48,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:35:48,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:35:48,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:35:48,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... [2020-07-08 23:35:48,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:35:48,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:35:48,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:35:48,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:35:48,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:35:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:35:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:35:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:35:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:35:48,998 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:35:48,998 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 23:35:49,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:49 BoogieIcfgContainer [2020-07-08 23:35:49,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:49,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:49,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:49,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:49,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:35:47" (1/3) ... [2020-07-08 23:35:49,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa89aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:49, skipping insertion in model container [2020-07-08 23:35:49,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:48" (2/3) ... [2020-07-08 23:35:49,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa89aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:49, skipping insertion in model container [2020-07-08 23:35:49,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:49" (3/3) ... [2020-07-08 23:35:49,018 INFO L109 eAbstractionObserver]: Analyzing ICFG res2of.c [2020-07-08 23:35:49,028 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:49,035 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:49,046 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:49,062 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:49,063 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:49,063 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:49,063 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:49,063 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:49,063 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:49,064 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:49,064 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-08 23:35:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 23:35:49,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:49,095 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] [2020-07-08 23:35:49,095 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -386797637, now seen corresponding path program 1 times [2020-07-08 23:35:49,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:49,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860365105] [2020-07-08 23:35:49,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:49,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#(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; {95#true} is VALID [2020-07-08 23:35:49,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-08 23:35:49,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-08 23:35:49,377 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-08 23:35:49,380 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-08 23:35:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:49,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-08 23:35:49,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-08 23:35:49,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-08 23:35:49,412 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-08 23:35:49,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {107#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:49,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#(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; {95#true} is VALID [2020-07-08 23:35:49,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-08 23:35:49,415 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-08 23:35:49,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-08 23:35:49,417 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-08 23:35:49,418 INFO L263 TraceCheckUtils]: 7: Hoare triple {95#true} call #t~ret17 := main(); {95#true} is VALID [2020-07-08 23:35:49,419 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-08 23:35:49,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} ~N~0 := #t~nondet0; {95#true} is VALID [2020-07-08 23:35:49,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-08 23:35:49,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} assume !(~N~0 <= 0); {95#true} is VALID [2020-07-08 23:35:49,421 INFO L263 TraceCheckUtils]: 12: Hoare triple {95#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {95#true} is VALID [2020-07-08 23:35:49,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-08 23:35:49,423 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-08 23:35:49,424 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-08 23:35:49,424 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-08 23:35:49,425 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc ~i~0; {95#true} is VALID [2020-07-08 23:35:49,426 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {95#true} is VALID [2020-07-08 23:35:49,426 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {95#true} is VALID [2020-07-08 23:35:49,427 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {95#true} is VALID [2020-07-08 23:35:49,427 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {95#true} is VALID [2020-07-08 23:35:49,427 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {95#true} is VALID [2020-07-08 23:35:49,428 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L29 {95#true} is VALID [2020-07-08 23:35:49,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {95#true} ~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset; {95#true} is VALID [2020-07-08 23:35:49,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {95#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L31 {95#true} is VALID [2020-07-08 23:35:49,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,430 INFO L280 TraceCheckUtils]: 27: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-08 23:35:49,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-08 23:35:49,432 INFO L280 TraceCheckUtils]: 30: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,432 INFO L280 TraceCheckUtils]: 31: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-08 23:35:49,436 INFO L280 TraceCheckUtils]: 32: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-08 23:35:49,438 INFO L280 TraceCheckUtils]: 33: Hoare triple {95#true} assume !true; {96#false} is VALID [2020-07-08 23:35:49,438 INFO L280 TraceCheckUtils]: 34: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-08 23:35:49,438 INFO L280 TraceCheckUtils]: 35: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-08 23:35:49,439 INFO L280 TraceCheckUtils]: 36: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-08 23:35:49,439 INFO L280 TraceCheckUtils]: 37: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-08 23:35:49,439 INFO L280 TraceCheckUtils]: 38: Hoare triple {96#false} SUMMARY for call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L57-6 {96#false} is VALID [2020-07-08 23:35:49,440 INFO L263 TraceCheckUtils]: 39: Hoare triple {96#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {96#false} is VALID [2020-07-08 23:35:49,440 INFO L280 TraceCheckUtils]: 40: Hoare triple {96#false} ~cond := #in~cond; {96#false} is VALID [2020-07-08 23:35:49,440 INFO L280 TraceCheckUtils]: 41: Hoare triple {96#false} assume 0 == ~cond; {96#false} is VALID [2020-07-08 23:35:49,441 INFO L280 TraceCheckUtils]: 42: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-08 23:35:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:35:49,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860365105] [2020-07-08 23:35:49,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:49,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:49,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672559649] [2020-07-08 23:35:49,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-08 23:35:49,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:49,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:49,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:49,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:49,586 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-07-08 23:35:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:50,193 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2020-07-08 23:35:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:50,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-08 23:35:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-08 23:35:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-08 23:35:50,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-08 23:35:50,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:50,458 INFO L225 Difference]: With dead ends: 167 [2020-07-08 23:35:50,458 INFO L226 Difference]: Without dead ends: 80 [2020-07-08 23:35:50,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-08 23:35:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-08 23:35:50,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:50,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-08 23:35:50,567 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-08 23:35:50,567 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-08 23:35:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:50,574 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-08 23:35:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:35:50,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:50,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:50,576 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-08 23:35:50,576 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-08 23:35:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:50,583 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-08 23:35:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:35:50,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:50,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:50,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:50,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-08 23:35:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-07-08 23:35:50,592 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2020-07-08 23:35:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:50,592 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-07-08 23:35:50,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:35:50,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2020-07-08 23:35:50,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:35:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 23:35:50,730 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:50,731 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] [2020-07-08 23:35:50,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:35:50,731 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 614001090, now seen corresponding path program 1 times [2020-07-08 23:35:50,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:50,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111115709] [2020-07-08 23:35:50,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:50,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(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; {764#true} is VALID [2020-07-08 23:35:50,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {764#true} #valid := #valid[0 := 0]; {764#true} is VALID [2020-07-08 23:35:50,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} assume 0 < #StackHeapBarrier; {764#true} is VALID [2020-07-08 23:35:50,963 INFO L280 TraceCheckUtils]: 3: Hoare triple {764#true} ~N~0 := 0; {764#true} is VALID [2020-07-08 23:35:50,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-08 23:35:50,963 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {764#true} {764#true} #172#return; {764#true} is VALID [2020-07-08 23:35:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:50,972 INFO L280 TraceCheckUtils]: 0: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2020-07-08 23:35:50,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2020-07-08 23:35:50,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-08 23:35:50,975 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {764#true} {772#(<= 1 ~N~0)} #168#return; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {778#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:50,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {778#(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; {764#true} is VALID [2020-07-08 23:35:50,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} #valid := #valid[0 := 0]; {764#true} is VALID [2020-07-08 23:35:50,978 INFO L280 TraceCheckUtils]: 3: Hoare triple {764#true} assume 0 < #StackHeapBarrier; {764#true} is VALID [2020-07-08 23:35:50,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#true} ~N~0 := 0; {764#true} is VALID [2020-07-08 23:35:50,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-08 23:35:50,978 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #172#return; {764#true} is VALID [2020-07-08 23:35:50,979 INFO L263 TraceCheckUtils]: 7: Hoare triple {764#true} call #t~ret17 := main(); {764#true} is VALID [2020-07-08 23:35:50,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {764#true} is VALID [2020-07-08 23:35:50,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#true} ~N~0 := #t~nondet0; {764#true} is VALID [2020-07-08 23:35:50,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#true} havoc #t~nondet0; {764#true} is VALID [2020-07-08 23:35:50,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#true} assume !(~N~0 <= 0); {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,983 INFO L263 TraceCheckUtils]: 12: Hoare triple {772#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {764#true} is VALID [2020-07-08 23:35:50,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2020-07-08 23:35:50,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2020-07-08 23:35:50,984 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-08 23:35:50,985 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {764#true} {772#(<= 1 ~N~0)} #168#return; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,985 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#(<= 1 ~N~0)} havoc ~i~0; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,986 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,987 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,987 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,989 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L29 {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#(<= 1 ~N~0)} ~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,991 INFO L280 TraceCheckUtils]: 25: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L31 {772#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:50,994 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= 1 ~N~0)} ~i~0 := 0; {777#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:50,995 INFO L280 TraceCheckUtils]: 27: Hoare triple {777#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,996 INFO L280 TraceCheckUtils]: 28: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-08 23:35:50,996 INFO L280 TraceCheckUtils]: 29: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,996 INFO L280 TraceCheckUtils]: 30: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-08 23:35:50,996 INFO L280 TraceCheckUtils]: 31: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,997 INFO L280 TraceCheckUtils]: 32: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-08 23:35:50,997 INFO L280 TraceCheckUtils]: 33: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,997 INFO L280 TraceCheckUtils]: 34: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-08 23:35:50,998 INFO L280 TraceCheckUtils]: 35: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,998 INFO L280 TraceCheckUtils]: 36: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-08 23:35:50,998 INFO L280 TraceCheckUtils]: 37: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-08 23:35:50,998 INFO L280 TraceCheckUtils]: 38: Hoare triple {765#false} SUMMARY for call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L57-6 {765#false} is VALID [2020-07-08 23:35:50,999 INFO L263 TraceCheckUtils]: 39: Hoare triple {765#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {765#false} is VALID [2020-07-08 23:35:50,999 INFO L280 TraceCheckUtils]: 40: Hoare triple {765#false} ~cond := #in~cond; {765#false} is VALID [2020-07-08 23:35:50,999 INFO L280 TraceCheckUtils]: 41: Hoare triple {765#false} assume 0 == ~cond; {765#false} is VALID [2020-07-08 23:35:51,000 INFO L280 TraceCheckUtils]: 42: Hoare triple {765#false} assume !false; {765#false} is VALID [2020-07-08 23:35:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:35:51,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111115709] [2020-07-08 23:35:51,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:51,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:35:51,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21927349] [2020-07-08 23:35:51,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 23:35:51,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:51,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:35:51,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:51,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:35:51,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:35:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:35:51,053 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2020-07-08 23:35:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:51,764 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2020-07-08 23:35:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:35:51,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 23:35:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2020-07-08 23:35:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2020-07-08 23:35:51,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2020-07-08 23:35:51,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:51,997 INFO L225 Difference]: With dead ends: 164 [2020-07-08 23:35:51,997 INFO L226 Difference]: Without dead ends: 116 [2020-07-08 23:35:51,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:35:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-08 23:35:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2020-07-08 23:35:52,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:52,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 86 states. [2020-07-08 23:35:52,145 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 86 states. [2020-07-08 23:35:52,145 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 86 states. [2020-07-08 23:35:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:52,150 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2020-07-08 23:35:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2020-07-08 23:35:52,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:52,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:52,152 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 116 states. [2020-07-08 23:35:52,152 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 116 states. [2020-07-08 23:35:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:52,158 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2020-07-08 23:35:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2020-07-08 23:35:52,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:52,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:52,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:52,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-08 23:35:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2020-07-08 23:35:52,164 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 43 [2020-07-08 23:35:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:52,164 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2020-07-08 23:35:52,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:35:52,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 91 transitions. [2020-07-08 23:35:52,276 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-08 23:35:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2020-07-08 23:35:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-08 23:35:52,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:52,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:52,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:35:52,283 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash -849907375, now seen corresponding path program 1 times [2020-07-08 23:35:52,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:52,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369320778] [2020-07-08 23:35:52,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:52,530 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:35:52,531 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:35:52,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:35:52,655 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:52,656 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:35:52,657 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:35:52,658 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-08 23:35:52,659 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:35:52,660 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:35:52,661 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L37-5 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 23:35:52,662 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2020-07-08 23:35:52,663 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L47-6 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-08 23:35:52,664 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L52-6 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-08 23:35:52,665 WARN L170 areAnnotationChecker]: L57-5 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L57-5 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L57-5 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L57-6 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-08 23:35:52,666 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L54-3 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L54-4 has no Hoare annotation [2020-07-08 23:35:52,667 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 23:35:52,668 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-08 23:35:52,669 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-08 23:35:52,669 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 23:35:52,669 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-08 23:35:52,669 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:35:52,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:35:52 BoogieIcfgContainer [2020-07-08 23:35:52,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:35:52,676 INFO L168 Benchmark]: Toolchain (without parser) took 4732.93 ms. Allocated memory was 145.2 MB in the beginning and 249.0 MB in the end (delta: 103.8 MB). Free memory was 102.0 MB in the beginning and 121.2 MB in the end (delta: -19.2 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,677 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.67 ms. Allocated memory is still 145.2 MB. Free memory was 101.6 MB in the beginning and 90.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,679 INFO L168 Benchmark]: Boogie Preprocessor took 125.08 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 90.1 MB in the beginning and 179.8 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,679 INFO L168 Benchmark]: RCFGBuilder took 622.88 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 140.2 MB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,680 INFO L168 Benchmark]: TraceAbstraction took 3665.75 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 140.2 MB in the beginning and 121.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:52,684 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.67 ms. Allocated memory is still 145.2 MB. Free memory was 101.6 MB in the beginning and 90.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.08 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 90.1 MB in the beginning and 179.8 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 622.88 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 140.2 MB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3665.75 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 140.2 MB in the beginning and 121.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 65.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)=10, 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={7:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L28] int *b = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, b={-2:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L29] int *c = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, b={-2:0}, c={5:0}, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L31] sum[0] = 0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, c={5:0}, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L32] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, c={5:0}, i=0, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L32] COND TRUE i