/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test07.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:06:21,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:21,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:21,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:21,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:21,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:21,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:21,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:21,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:21,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:21,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:21,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:21,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:21,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:21,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:21,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:21,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:21,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:21,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:21,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:21,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:21,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:21,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:21,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:21,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:21,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:21,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:21,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:21,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:21,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:21,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:21,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:21,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:21,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:21,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:21,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:21,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:21,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:21,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:21,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:21,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:21,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:06:21,706 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:21,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:21,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:21,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:21,708 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:21,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:21,709 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:21,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:21,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:21,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:21,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:21,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:21,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:21,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:21,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:21,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:21,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:21,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:21,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:21,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:21,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:21,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:21,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:21,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:21,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:21,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:22,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:22,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:22,015 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:22,016 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:22,017 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-10 15:06:22,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4571781/f94cf0f695b047029563ef76b7594d09/FLAG3c191e7fc [2020-07-10 15:06:22,535 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:22,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test07.c [2020-07-10 15:06:22,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4571781/f94cf0f695b047029563ef76b7594d09/FLAG3c191e7fc [2020-07-10 15:06:22,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4571781/f94cf0f695b047029563ef76b7594d09 [2020-07-10 15:06:22,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:22,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:22,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:22,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:22,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:22,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:22" (1/1) ... [2020-07-10 15:06:22,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f17481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:22, skipping insertion in model container [2020-07-10 15:06:22,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:22" (1/1) ... [2020-07-10 15:06:22,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:23,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:23,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:23,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:23,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:23,286 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:23,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23 WrapperNode [2020-07-10 15:06:23,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:23,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:23,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:23,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:23,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (1/1) ... [2020-07-10 15:06:23,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:23,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:23,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:23,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:23,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (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-10 15:06:23,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:23,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:23,497 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-10 15:06:23,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:23,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:23,497 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 15:06:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:23,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:23,844 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:23,845 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:06:23,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:23 BoogieIcfgContainer [2020-07-10 15:06:23,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:23,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:23,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:23,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:23,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:22" (1/3) ... [2020-07-10 15:06:23,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9d698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:23, skipping insertion in model container [2020-07-10 15:06:23,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:23" (2/3) ... [2020-07-10 15:06:23,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9d698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:23, skipping insertion in model container [2020-07-10 15:06:23,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:23" (3/3) ... [2020-07-10 15:06:23,858 INFO L109 eAbstractionObserver]: Analyzing ICFG test07.c [2020-07-10 15:06:23,871 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:23,878 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:23,895 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:23,921 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:23,921 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:23,921 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:23,921 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:23,922 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:23,922 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:23,922 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:23,922 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:06:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:06:23,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:23,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:23,952 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1889415219, now seen corresponding path program 1 times [2020-07-10 15:06:23,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:23,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950341895] [2020-07-10 15:06:23,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:24,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {22#true} is VALID [2020-07-10 15:06:24,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:06:24,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #23#return; {22#true} is VALID [2020-07-10 15:06:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:24,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem2;havoc #t~mem0;havoc #t~mem1; {22#true} is VALID [2020-07-10 15:06:24,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume 1 == ~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;#res := ~v~0; {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} assume true; {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} {22#true} #27#return; {31#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,604 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {33#(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-10 15:06:24,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {22#true} is VALID [2020-07-10 15:06:24,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:06:24,606 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #23#return; {22#true} is VALID [2020-07-10 15:06:24,606 INFO L263 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret7 := main(); {22#true} is VALID [2020-07-10 15:06:24,607 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~post4;havoc #t~mem3; {22#true} is VALID [2020-07-10 15:06:24,608 INFO L263 TraceCheckUtils]: 6: Hoare triple {22#true} call #t~ret5 := f(); {34#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-10 15:06:24,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem2;havoc #t~mem0;havoc #t~mem1; {22#true} is VALID [2020-07-10 15:06:24,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#true} assume 1 == ~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;#res := ~v~0; {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} assume true; {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,614 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {35#(and (= ~p2~0.offset ~p1~0.offset) (<= 1 |f_#res|) (= ~p2~0.base ~p1~0.base))} {22#true} #27#return; {31#(and (not (= 0 |main_#t~ret5|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#(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;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {32#(and (not (= 0 |main_#t~mem6|)) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID [2020-07-10 15:06:24,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {32#(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;havoc #t~mem6; {23#false} is VALID [2020-07-10 15:06:24,618 INFO L280 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:06:24,621 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-10 15:06:24,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950341895] [2020-07-10 15:06:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:06:24,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645754434] [2020-07-10 15:06:24,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-10 15:06:24,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:24,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:06:24,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:24,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:06:24,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:24,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:06:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:06:24,683 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2020-07-10 15:06:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:25,111 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:06:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:06:25,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-10 15:06:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-10 15:06:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-10 15:06:25,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2020-07-10 15:06:25,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:25,191 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:06:25,192 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:06:25,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:06:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:06:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:06:25,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:25,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:06:25,263 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:06:25,263 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:06:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:25,267 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-10 15:06:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-10 15:06:25,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:25,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:25,268 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:06:25,268 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:06:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:25,271 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-10 15:06:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-10 15:06:25,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:25,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:25,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:25,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:06:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2020-07-10 15:06:25,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2020-07-10 15:06:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:25,277 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2020-07-10 15:06:25,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:06:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-10 15:06:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:06:25,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:25,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:25,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:25,279 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1918044370, now seen corresponding path program 1 times [2020-07-10 15:06:25,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:25,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045570618] [2020-07-10 15:06:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:25,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {138#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {132#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,442 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132#(not (= |~#b~0.base| |~#a~0.base|))} {127#true} #23#return; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:25,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem2;havoc #t~mem0;havoc #t~mem1; {140#(or (and (or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) f_~v~0) (< 0 f_~v~0)) (or (<= f_~v~0 1) (<= f_~v~0 (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-10 15:06:25,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(or (and (or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) f_~v~0) (< 0 f_~v~0)) (or (<= f_~v~0 1) (<= f_~v~0 (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);#res := 0; {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 15:06:25,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 15:06:25,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {133#(and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1))} #27#return; {128#false} is VALID [2020-07-10 15:06:25,598 INFO L263 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {138#(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-10 15:06:25,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {138#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {132#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {132#(not (= |~#b~0.base| |~#a~0.base|))} {127#true} #23#return; {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,603 INFO L263 TraceCheckUtils]: 4: Hoare triple {132#(not (= |~#b~0.base| |~#a~0.base|))} call #t~ret7 := main(); {132#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2020-07-10 15:06:25,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {132#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~post4;havoc #t~mem3; {133#(and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1))} is VALID [2020-07-10 15:06:25,606 INFO L263 TraceCheckUtils]: 6: Hoare triple {133#(and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1))} call #t~ret5 := f(); {139#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2020-07-10 15:06:25,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {139#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem2;havoc #t~mem0;havoc #t~mem1; {140#(or (and (or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) f_~v~0) (< 0 f_~v~0)) (or (<= f_~v~0 1) (<= f_~v~0 (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-10 15:06:25,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {140#(or (and (or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) f_~v~0) (< 0 f_~v~0)) (or (<= f_~v~0 1) (<= f_~v~0 (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);#res := 0; {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 15:06:25,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} assume true; {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} is VALID [2020-07-10 15:06:25,613 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {141#(or (<= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 0) (not (= |old(~p1~0.base)| |~#a~0.base|)) (<= 2 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (not (= |old(~p1~0.offset)| |~#a~0.offset|)))} {133#(and (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1))} #27#return; {128#false} is VALID [2020-07-10 15:06:25,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {128#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {128#false} is VALID [2020-07-10 15:06:25,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {128#false} assume 0 == #t~mem6 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset;havoc #t~mem6; {128#false} is VALID [2020-07-10 15:06:25,614 INFO L280 TraceCheckUtils]: 13: Hoare triple {128#false} assume !false; {128#false} is VALID [2020-07-10 15:06:25,615 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-10 15:06:25,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045570618] [2020-07-10 15:06:25,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:25,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:06:25,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730744897] [2020-07-10 15:06:25,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-10 15:06:25,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:25,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:06:25,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:25,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:06:25,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:06:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:06:25,650 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 8 states. [2020-07-10 15:06:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:26,105 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-10 15:06:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:06:26,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-10 15:06:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2020-07-10 15:06:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2020-07-10 15:06:26,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2020-07-10 15:06:26,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:26,132 INFO L225 Difference]: With dead ends: 15 [2020-07-10 15:06:26,133 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:06:26,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:06:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:06:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:06:26,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:26,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:26,135 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:26,135 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:26,135 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:26,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:26,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:26,136 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:26,137 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:26,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:26,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:26,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:26,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:26,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:06:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:06:26,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-10 15:06:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:26,139 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:06:26,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:06:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:26,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:26,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:26,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:06:26,363 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:26,364 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-10 15:06:26,364 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:26,364 INFO L268 CegarLoopResult]: For program point L9(lines 9 14) no Hoare annotation was computed. [2020-07-10 15:06:26,364 INFO L268 CegarLoopResult]: For program point fEXIT(lines 7 15) no Hoare annotation was computed. [2020-07-10 15:06:26,364 INFO L264 CegarLoopResult]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= |~#b~0.base| |~#a~0.base|) (not (= |old(~p1~0.base)| |~#a~0.base|)) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |~#a~0.base| ~p1~0.base)) (not (= |old(~p1~0.offset)| |~#a~0.offset|))) [2020-07-10 15:06:26,365 INFO L268 CegarLoopResult]: For program point fFINAL(lines 7 15) no Hoare annotation was computed. [2020-07-10 15:06:26,365 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:26,365 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (not (= |~#b~0.base| |~#a~0.base|)) [2020-07-10 15:06:26,365 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:06:26,365 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:26,366 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2020-07-10 15:06:26,366 INFO L264 CegarLoopResult]: At program point L30(lines 17 37) the Hoare annotation is: (= |~#a~0.base| |~#b~0.base|) [2020-07-10 15:06:26,366 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|)) [2020-07-10 15:06:26,366 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-10 15:06:26,366 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:06:26,367 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (or (= |~#b~0.base| |~#a~0.base|) (and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))) [2020-07-10 15:06:26,367 INFO L268 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2020-07-10 15:06:26,367 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:06:26,372 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:26,373 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:06:26,376 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:26,376 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:06:26,376 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:06:26,377 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:26,378 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 15:06:26,379 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:26,379 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:06:26,380 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:06:26,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:26,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:26,381 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:26,381 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:06:26,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:26 BoogieIcfgContainer [2020-07-10 15:06:26,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:26,399 INFO L168 Benchmark]: Toolchain (without parser) took 3418.61 ms. Allocated memory was 140.0 MB in the beginning and 251.1 MB in the end (delta: 111.1 MB). Free memory was 99.5 MB in the beginning and 149.5 MB in the end (delta: -50.0 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,400 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.37 ms. Allocated memory is still 140.0 MB. Free memory was 99.1 MB in the beginning and 89.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,402 INFO L168 Benchmark]: Boogie Preprocessor took 140.22 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 89.0 MB in the beginning and 177.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,403 INFO L168 Benchmark]: RCFGBuilder took 420.67 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 157.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,404 INFO L168 Benchmark]: TraceAbstraction took 2544.96 ms. Allocated memory was 200.3 MB in the beginning and 251.1 MB in the end (delta: 50.9 MB). Free memory was 156.8 MB in the beginning and 149.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 58.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:26,409 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.26 ms. Allocated memory is still 140.0 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 306.37 ms. Allocated memory is still 140.0 MB. Free memory was 99.1 MB in the beginning and 89.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.22 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 89.0 MB in the beginning and 177.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.67 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 157.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2544.96 ms. Allocated memory was 200.3 MB in the beginning and 251.1 MB in the end (delta: 50.9 MB). Free memory was 156.8 MB in the beginning and 149.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 58.2 MB. Max. memory is 7.1 GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 6 SDslu, 48 SDs, 0 SdLazy, 80 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 107 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 3224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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...