/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test07.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:23:57,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:23:57,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:23:57,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:23:57,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:23:57,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:23:57,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:23:57,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:23:57,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:23:57,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:23:57,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:23:57,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:23:57,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:23:57,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:23:57,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:23:57,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:23:57,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:23:57,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:23:57,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:23:57,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:23:57,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:23:57,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:23:57,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:23:57,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:23:57,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:23:57,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:23:57,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:23:57,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:23:57,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:23:57,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:23:57,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:23:57,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:23:57,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:23:57,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:23:57,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:23:57,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:23:57,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:23:57,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:23:57,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:23:57,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:23:57,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:23:57,956 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 16:23:57,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:23:57,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:23:57,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:23:57,970 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:23:57,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:23:57,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:23:57,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:23:57,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:23:57,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:23:57,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:23:57,972 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:23:57,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:23:57,973 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:23:57,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:23:57,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:23:57,974 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:23:57,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:23:57,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:23:57,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:23:57,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:23:57,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:23:57,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:23:57,975 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:23:58,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:23:58,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:23:58,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:23:58,286 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:23:58,287 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:23:58,287 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test07.c [2020-07-08 16:23:58,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd7a1684/bf742bfe8bee451fb7a159f0ee65b783/FLAG316a04088 [2020-07-08 16:23:58,801 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:23:58,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test07.c [2020-07-08 16:23:58,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd7a1684/bf742bfe8bee451fb7a159f0ee65b783/FLAG316a04088 [2020-07-08 16:23:59,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd7a1684/bf742bfe8bee451fb7a159f0ee65b783 [2020-07-08 16:23:59,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:23:59,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:23:59,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:23:59,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:23:59,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:23:59,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74099987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59, skipping insertion in model container [2020-07-08 16:23:59,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:23:59,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:23:59,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:23:59,522 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:23:59,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:23:59,564 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:23:59,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59 WrapperNode [2020-07-08 16:23:59,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:23:59,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:23:59,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:23:59,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:23:59,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (1/1) ... [2020-07-08 16:23:59,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:23:59,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:23:59,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:23:59,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:23:59,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (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 16:23:59,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:23:59,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:23:59,747 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-08 16:23:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:23:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:23:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-08 16:23:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 16:23:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:23:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 16:23:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:23:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 16:23:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-08 16:23:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:23:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 16:24:00,151 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:24:00,152 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 16:24:00,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:24:00 BoogieIcfgContainer [2020-07-08 16:24:00,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:24:00,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:24:00,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:24:00,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:24:00,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:23:59" (1/3) ... [2020-07-08 16:24:00,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde26d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:24:00, skipping insertion in model container [2020-07-08 16:24:00,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:59" (2/3) ... [2020-07-08 16:24:00,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde26d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:24:00, skipping insertion in model container [2020-07-08 16:24:00,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:24:00" (3/3) ... [2020-07-08 16:24:00,164 INFO L109 eAbstractionObserver]: Analyzing ICFG test07.c [2020-07-08 16:24:00,173 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:24:00,180 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:24:00,194 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:24:00,214 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:24:00,214 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:24:00,214 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:24:00,214 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:24:00,214 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:24:00,215 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:24:00,215 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:24:00,215 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:24:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-08 16:24:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 16:24:00,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:24:00,241 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] [2020-07-08 16:24:00,241 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:24:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:24:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash 56438835, now seen corresponding path program 1 times [2020-07-08 16:24:00,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:24:00,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495359399] [2020-07-08 16:24:00,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:00,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {54#true} is VALID [2020-07-08 16:24:00,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} #valid := #valid[0 := 0]; {54#true} is VALID [2020-07-08 16:24:00,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume 0 < #StackHeapBarrier; {54#true} is VALID [2020-07-08 16:24:00,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,934 INFO L280 TraceCheckUtils]: 9: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,935 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {67#(not (= |~#b~0.base| |~#a~0.base|))} {54#true} #55#return; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:01,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID [2020-07-08 16:24:01,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} is VALID [2020-07-08 16:24:01,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} is VALID [2020-07-08 16:24:01,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,334 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem1; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem0; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume !(1 == ~v~0); {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} #res := 0; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,341 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #59#return; {55#false} is VALID [2020-07-08 16:24:01,346 INFO L263 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 16:24:01,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {54#true} is VALID [2020-07-08 16:24:01,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} #valid := #valid[0 := 0]; {54#true} is VALID [2020-07-08 16:24:01,348 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#true} assume 0 < #StackHeapBarrier; {54#true} is VALID [2020-07-08 16:24:01,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {54#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {85#(= 1 (select |#valid| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,358 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {67#(not (= |~#b~0.base| |~#a~0.base|))} {54#true} #55#return; {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,359 INFO L263 TraceCheckUtils]: 12: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} call #t~ret7 := main(); {67#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-08 16:24:01,360 INFO L280 TraceCheckUtils]: 13: Hoare triple {67#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {68#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {68#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base))} ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; {69#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))} is VALID [2020-07-08 16:24:01,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {69#(and (= ~p1~0.offset |~#a~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))} SUMMARY for call write~int(1, ~#b~0.base, ~#b~0.offset, 4); srcloc: L22 {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,365 INFO L280 TraceCheckUtils]: 16: Hoare triple {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call write~int(5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L22-1 {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,366 INFO L280 TraceCheckUtils]: 17: Hoare triple {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L23 {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,368 INFO L280 TraceCheckUtils]: 18: Hoare triple {70#(and (= ~p1~0.offset |~#a~0.offset|) (not (= ~p2~0.base |~#a~0.base|)) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} #t~post4 := #t~mem3; {71#(and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| (+ |main_#t~post4| (- 1)))) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#(and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| (+ |main_#t~post4| (- 1)))) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base))} SUMMARY for call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); srcloc: L25-1 {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,372 INFO L280 TraceCheckUtils]: 20: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} havoc #t~mem3; {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,373 INFO L280 TraceCheckUtils]: 21: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} havoc #t~post4; {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} is VALID [2020-07-08 16:24:01,375 INFO L263 TraceCheckUtils]: 22: Hoare triple {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} call #t~ret5 := f(); {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-08 16:24:01,376 INFO L280 TraceCheckUtils]: 23: Hoare triple {86#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID [2020-07-08 16:24:01,377 INFO L280 TraceCheckUtils]: 24: Hoare triple {87#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} is VALID [2020-07-08 16:24:01,379 INFO L280 TraceCheckUtils]: 25: Hoare triple {88#(and (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)) (or (not (= 1 |f_#t~mem1|)) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} is VALID [2020-07-08 16:24:01,380 INFO L280 TraceCheckUtils]: 26: Hoare triple {89#(and (or (not (= 1 |f_#t~mem1|)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |f_#t~mem0| |f_#t~mem2|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) (or (= |f_#t~mem1| (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= 1 |f_#t~mem1|)))} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,381 INFO L280 TraceCheckUtils]: 27: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem1; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,382 INFO L280 TraceCheckUtils]: 28: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem2; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,386 INFO L280 TraceCheckUtils]: 29: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} havoc #t~mem0; {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,387 INFO L280 TraceCheckUtils]: 30: Hoare triple {90#(or (and (<= f_~v~0 1) (<= 1 f_~v~0)) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume !(1 == ~v~0); {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,388 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} #res := 0; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,388 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-08 16:24:01,390 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {91#(or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {72#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #59#return; {55#false} is VALID [2020-07-08 16:24:01,390 INFO L280 TraceCheckUtils]: 34: Hoare triple {55#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {55#false} is VALID [2020-07-08 16:24:01,390 INFO L280 TraceCheckUtils]: 35: Hoare triple {55#false} SUMMARY for call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L27-2 {55#false} is VALID [2020-07-08 16:24:01,391 INFO L280 TraceCheckUtils]: 36: Hoare triple {55#false} havoc #t~ret5; {55#false} is VALID [2020-07-08 16:24:01,391 INFO L280 TraceCheckUtils]: 37: Hoare triple {55#false} SUMMARY for call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L29 {55#false} is VALID [2020-07-08 16:24:01,391 INFO L280 TraceCheckUtils]: 38: Hoare triple {55#false} assume 0 == #t~mem6 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset; {55#false} is VALID [2020-07-08 16:24:01,392 INFO L280 TraceCheckUtils]: 39: Hoare triple {55#false} havoc #t~mem6; {55#false} is VALID [2020-07-08 16:24:01,392 INFO L280 TraceCheckUtils]: 40: Hoare triple {55#false} assume !false; {55#false} is VALID [2020-07-08 16:24:01,404 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 16:24:01,404 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:24:01,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495359399] [2020-07-08 16:24:01,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:24:01,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-08 16:24:01,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249789477] [2020-07-08 16:24:01,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2020-07-08 16:24:01,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:24:01,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 16:24:01,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:01,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 16:24:01,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:24:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 16:24:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-08 16:24:01,528 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 16 states. [2020-07-08 16:24:02,845 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-07-08 16:24:03,039 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2020-07-08 16:24:03,244 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-07-08 16:24:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:04,211 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-07-08 16:24:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 16:24:04,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2020-07-08 16:24:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:24:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:24:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2020-07-08 16:24:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 16:24:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2020-07-08 16:24:04,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2020-07-08 16:24:04,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:04,373 INFO L225 Difference]: With dead ends: 67 [2020-07-08 16:24:04,374 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 16:24:04,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2020-07-08 16:24:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 16:24:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-08 16:24:04,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:24:04,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-08 16:24:04,614 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 16:24:04,615 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 16:24:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:04,622 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2020-07-08 16:24:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-07-08 16:24:04,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:04,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:04,623 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 16:24:04,623 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 16:24:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:04,628 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2020-07-08 16:24:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-07-08 16:24:04,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:04,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:04,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:24:04,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:24:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 16:24:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2020-07-08 16:24:04,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 41 [2020-07-08 16:24:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:24:04,635 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2020-07-08 16:24:04,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 16:24:04,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 42 transitions. [2020-07-08 16:24:04,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-07-08 16:24:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 16:24:04,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:24:04,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:24:04,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:24:04,712 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:24:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:24:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1088655632, now seen corresponding path program 1 times [2020-07-08 16:24:04,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:24:04,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774026483] [2020-07-08 16:24:04,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:24:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:04,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {458#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} #valid := #valid[0 := 0]; {430#true} is VALID [2020-07-08 16:24:04,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {430#true} assume 0 < #StackHeapBarrier; {430#true} is VALID [2020-07-08 16:24:04,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {430#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {430#true} is VALID [2020-07-08 16:24:04,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {430#true} is VALID [2020-07-08 16:24:04,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {430#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {430#true} is VALID [2020-07-08 16:24:04,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {430#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {430#true} is VALID [2020-07-08 16:24:04,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#true} ~p1~0.base, ~p1~0.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,890 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#true} ~p2~0.base, ~p2~0.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,890 INFO L280 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2020-07-08 16:24:04,890 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2020-07-08 16:24:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:04,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {459#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {430#true} is VALID [2020-07-08 16:24:04,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {430#true} is VALID [2020-07-08 16:24:04,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {430#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {430#true} is VALID [2020-07-08 16:24:04,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {430#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {430#true} is VALID [2020-07-08 16:24:04,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#true} havoc #t~mem1; {430#true} is VALID [2020-07-08 16:24:04,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {430#true} havoc #t~mem2; {430#true} is VALID [2020-07-08 16:24:04,980 INFO L280 TraceCheckUtils]: 6: Hoare triple {430#true} havoc #t~mem0; {430#true} is VALID [2020-07-08 16:24:04,981 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#true} assume 1 == ~v~0; {460#(<= 1 f_~v~0)} is VALID [2020-07-08 16:24:04,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {460#(<= 1 f_~v~0)} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {461#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:04,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {461#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:04,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} assume true; {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:04,984 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} {430#true} #59#return; {455#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:04,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {458#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 16:24:04,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {430#true} #valid := #valid[0 := 0]; {430#true} is VALID [2020-07-08 16:24:04,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {430#true} assume 0 < #StackHeapBarrier; {430#true} is VALID [2020-07-08 16:24:04,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {430#true} is VALID [2020-07-08 16:24:04,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {430#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {430#true} is VALID [2020-07-08 16:24:04,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {430#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {430#true} is VALID [2020-07-08 16:24:04,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {430#true} is VALID [2020-07-08 16:24:04,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#true} ~p1~0.base, ~p1~0.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {430#true} ~p2~0.base, ~p2~0.offset := 0, 0; {430#true} is VALID [2020-07-08 16:24:04,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {430#true} assume true; {430#true} is VALID [2020-07-08 16:24:04,988 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2020-07-08 16:24:04,988 INFO L263 TraceCheckUtils]: 12: Hoare triple {430#true} call #t~ret7 := main(); {430#true} is VALID [2020-07-08 16:24:04,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {430#true} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {430#true} is VALID [2020-07-08 16:24:04,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {430#true} ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; {430#true} is VALID [2020-07-08 16:24:04,989 INFO L280 TraceCheckUtils]: 15: Hoare triple {430#true} SUMMARY for call write~int(1, ~#b~0.base, ~#b~0.offset, 4); srcloc: L22 {430#true} is VALID [2020-07-08 16:24:04,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {430#true} SUMMARY for call write~int(5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L22-1 {430#true} is VALID [2020-07-08 16:24:04,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {430#true} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L23 {430#true} is VALID [2020-07-08 16:24:04,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {430#true} #t~post4 := #t~mem3; {430#true} is VALID [2020-07-08 16:24:04,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {430#true} SUMMARY for call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); srcloc: L25-1 {430#true} is VALID [2020-07-08 16:24:04,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {430#true} havoc #t~mem3; {430#true} is VALID [2020-07-08 16:24:04,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {430#true} havoc #t~post4; {430#true} is VALID [2020-07-08 16:24:04,994 INFO L263 TraceCheckUtils]: 22: Hoare triple {430#true} call #t~ret5 := f(); {459#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-08 16:24:04,994 INFO L280 TraceCheckUtils]: 23: Hoare triple {459#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} SUMMARY for call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); srcloc: fENTRY {430#true} is VALID [2020-07-08 16:24:04,995 INFO L280 TraceCheckUtils]: 24: Hoare triple {430#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {430#true} is VALID [2020-07-08 16:24:04,995 INFO L280 TraceCheckUtils]: 25: Hoare triple {430#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {430#true} is VALID [2020-07-08 16:24:04,995 INFO L280 TraceCheckUtils]: 26: Hoare triple {430#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {430#true} is VALID [2020-07-08 16:24:04,996 INFO L280 TraceCheckUtils]: 27: Hoare triple {430#true} havoc #t~mem1; {430#true} is VALID [2020-07-08 16:24:04,996 INFO L280 TraceCheckUtils]: 28: Hoare triple {430#true} havoc #t~mem2; {430#true} is VALID [2020-07-08 16:24:04,996 INFO L280 TraceCheckUtils]: 29: Hoare triple {430#true} havoc #t~mem0; {430#true} is VALID [2020-07-08 16:24:04,999 INFO L280 TraceCheckUtils]: 30: Hoare triple {430#true} assume 1 == ~v~0; {460#(<= 1 f_~v~0)} is VALID [2020-07-08 16:24:05,000 INFO L280 TraceCheckUtils]: 31: Hoare triple {460#(<= 1 f_~v~0)} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {461#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,000 INFO L280 TraceCheckUtils]: 32: Hoare triple {461#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,001 INFO L280 TraceCheckUtils]: 33: Hoare triple {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} assume true; {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,002 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {462#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} {430#true} #59#return; {455#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,007 INFO L280 TraceCheckUtils]: 35: Hoare triple {455#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {455#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,009 INFO L280 TraceCheckUtils]: 36: Hoare triple {455#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} SUMMARY for call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L27-2 {456#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))} is VALID [2020-07-08 16:24:05,009 INFO L280 TraceCheckUtils]: 37: Hoare triple {456#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))} havoc #t~ret5; {456#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))} is VALID [2020-07-08 16:24:05,010 INFO L280 TraceCheckUtils]: 38: Hoare triple {456#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))} SUMMARY for call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L29 {457#(and (not (= 0 |main_#t~mem6|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-08 16:24:05,011 INFO L280 TraceCheckUtils]: 39: Hoare triple {457#(and (not (= 0 |main_#t~mem6|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume 0 == #t~mem6 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset; {431#false} is VALID [2020-07-08 16:24:05,011 INFO L280 TraceCheckUtils]: 40: Hoare triple {431#false} havoc #t~mem6; {431#false} is VALID [2020-07-08 16:24:05,012 INFO L280 TraceCheckUtils]: 41: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-08 16:24:05,015 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 16:24:05,016 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:24:05,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774026483] [2020-07-08 16:24:05,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:24:05,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 16:24:05,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143005185] [2020-07-08 16:24:05,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-07-08 16:24:05,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:24:05,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 16:24:05,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:05,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 16:24:05,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:24:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 16:24:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 16:24:05,066 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 10 states. [2020-07-08 16:24:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:05,798 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2020-07-08 16:24:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 16:24:05,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-07-08 16:24:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:24:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 16:24:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 16:24:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 16:24:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 16:24:05,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2020-07-08 16:24:05,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:05,852 INFO L225 Difference]: With dead ends: 43 [2020-07-08 16:24:05,852 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 16:24:05,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-08 16:24:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 16:24:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 16:24:05,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:24:05,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 16:24:05,855 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:24:05,855 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:24:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:05,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:24:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:24:05,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:05,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:05,856 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:24:05,856 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:24:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:05,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:24:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:24:05,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:05,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:05,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:24:05,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:24:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 16:24:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 16:24:05,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-08 16:24:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:24:05,858 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 16:24:05,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 16:24:05,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 16:24:05,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:24:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:24:05,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:05,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:24:05,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 16:24:07,029 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-07-08 16:24:07,741 INFO L264 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,741 INFO L264 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,741 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= ~p2~0.offset |old(~p2~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= ~p2~0.base |old(~p2~0.base)|) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2020-07-08 16:24:07,742 INFO L264 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,743 INFO L264 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,743 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,743 INFO L264 CegarLoopResult]: At program point fFINAL(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (not (= ~p2~0.offset |~#b~0.offset|)) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 |f_#res|) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,743 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (not (= ~p2~0.base |~#b~0.base|)) (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (= |~#a~0.base| ~p2~0.base) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#a~0.offset| |old(~p1~0.offset)|)) (not (= 1 (select |#valid| |~#a~0.base|))) (not (= |old(~p1~0.base)| |~#a~0.base|))) [2020-07-08 16:24:07,744 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,744 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,744 INFO L264 CegarLoopResult]: At program point L9(lines 9 14) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,744 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,745 INFO L264 CegarLoopResult]: At program point fEXIT(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (not (= ~p2~0.offset |~#b~0.offset|)) (and (= ~p2~0.offset ~p1~0.offset) (<= f_~v~0 1) (<= 1 |f_#res|) (<= 1 f_~v~0) (= ~p2~0.base ~p1~0.base)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,745 INFO L264 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|)) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|)))) [2020-07-08 16:24:07,745 INFO L264 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= |f_#t~mem0| |f_#t~mem2|) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,745 INFO L264 CegarLoopResult]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base)) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,746 INFO L264 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| |f_#t~mem2|) (= 1 |f_#t~mem1|) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,746 INFO L264 CegarLoopResult]: At program point L8-4(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,746 INFO L264 CegarLoopResult]: At program point L8-5(line 8) the Hoare annotation is: (or (not (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset))) (and (<= f_~v~0 1) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (<= 1 f_~v~0) (= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))) (not (= ~p2~0.offset |~#b~0.offset|)) (not (= |~#b~0.base| ~p2~0.base)) (not (= |old(~p1~0.base)| |~#a~0.base|)) (not (= 1 (select |#valid| |~#a~0.base|))) (= ~p2~0.base |~#a~0.base|) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-08 16:24:07,746 INFO L264 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,746 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,747 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 16:24:07,747 INFO L264 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#a~0.base|)) (= 1 (select |#valid| |~#a~0.base|))) [2020-07-08 16:24:07,747 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-08 16:24:07,747 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))) [2020-07-08 16:24:07,747 INFO L264 CegarLoopResult]: At program point L29-1(lines 29 31) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (not (= 0 |main_#t~mem6|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))))) [2020-07-08 16:24:07,747 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,748 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,748 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-08 16:24:07,748 INFO L271 CegarLoopResult]: At program point L29-3(line 29) the Hoare annotation is: true [2020-07-08 16:24:07,748 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,748 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))) [2020-07-08 16:24:07,748 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 17 37) the Hoare annotation is: true [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (not (= 0 (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)))) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,749 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 17 37) the Hoare annotation is: true [2020-07-08 16:24:07,749 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point L30(lines 17 37) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 17 37) the Hoare annotation is: (or (and (= |old(~p2~0.offset)| ~p2~0.offset) (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= ~p2~0.base |old(~p2~0.base)|)) (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|)))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= 1 (select (select (store |#memory_int| |~#a~0.base| (store (select |#memory_int| |~#a~0.base|) |~#a~0.offset| 5)) ~p2~0.base) ~p2~0.offset)) (= |~#a~0.base| ~p1~0.base) (= |~#b~0.base| ~p2~0.base) (= ~p2~0.offset |~#b~0.offset|))) [2020-07-08 16:24:07,750 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))) [2020-07-08 16:24:07,792 INFO L163 areAnnotationChecker]: CFG has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 16:24:07,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 16:24:07,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 16:24:07,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 04:24:07 BoogieIcfgContainer [2020-07-08 16:24:07,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 16:24:07,811 INFO L168 Benchmark]: Toolchain (without parser) took 8578.87 ms. Allocated memory was 137.4 MB in the beginning and 339.2 MB in the end (delta: 201.9 MB). Free memory was 102.6 MB in the beginning and 222.9 MB in the end (delta: -120.3 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,812 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.25 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,813 INFO L168 Benchmark]: Boogie Preprocessor took 118.91 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.1 MB in the beginning and 178.9 MB in the end (delta: -86.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,814 INFO L168 Benchmark]: RCFGBuilder took 471.93 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 153.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,815 INFO L168 Benchmark]: TraceAbstraction took 7651.69 ms. Allocated memory was 200.8 MB in the beginning and 339.2 MB in the end (delta: 138.4 MB). Free memory was 153.2 MB in the beginning and 222.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:07,819 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 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.25 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.91 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.1 MB in the beginning and 178.9 MB in the end (delta: -86.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.93 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 153.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7651.69 ms. Allocated memory was 200.8 MB in the beginning and 339.2 MB in the end (delta: 138.4 MB). Free memory was 153.2 MB in the beginning and 222.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: a == b || !(1 == \valid[a]) - ProcedureContractResult [Line: 7]: Procedure Contract for f [2020-07-08 16:24:07,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 16:24:07,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 16:24:07,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 16:24:07,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure f: ((((((!(1 == unknown-#memory_int-unknown[a := unknown-#memory_int-unknown[a][a := 5]][p2][p2]) || !(p2 == b)) || ((((p2 == p1 && v <= 1) && 1 <= \result) && 1 <= v) && p2 == p1)) || !(b == p2)) || !(\old(p1) == a)) || !(1 == \valid[a])) || p2 == a) || !(\old(p1) == a) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 146 SDslu, 270 SDs, 0 SdLazy, 369 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 51 LocationsWithAnnotation, 51 PreInvPairs, 64 NumberOfFragments, 1414 HoareAnnotationTreeSize, 51 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 51 FomulaSimplificationsInter, 1096 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...