/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test09.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-46f3038-m
[2020-07-08 22:22:43,937 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-08 22:22:43,939 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-08 22:22:43,957 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-08 22:22:43,957 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-08 22:22:43,959 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-08 22:22:43,961 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-08 22:22:43,971 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-08 22:22:43,974 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-08 22:22:43,977 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-08 22:22:43,979 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-08 22:22:43,981 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-08 22:22:43,982 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-08 22:22:43,983 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-08 22:22:43,985 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-08 22:22:43,987 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-08 22:22:43,988 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-08 22:22:43,989 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-08 22:22:43,990 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-08 22:22:43,995 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-08 22:22:43,999 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-08 22:22:44,003 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-08 22:22:44,003 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-08 22:22:44,004 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-08 22:22:44,006 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-08 22:22:44,006 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-08 22:22:44,007 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-08 22:22:44,009 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-08 22:22:44,009 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-08 22:22:44,011 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-08 22:22:44,011 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-08 22:22:44,012 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-08 22:22:44,013 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-08 22:22:44,013 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-08 22:22:44,014 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-08 22:22:44,015 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-08 22:22:44,015 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-08 22:22:44,015 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-08 22:22:44,016 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-08 22:22:44,016 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-08 22:22:44,017 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-08 22:22:44,018 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 22:22:44,044 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-08 22:22:44,045 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-08 22:22:44,049 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-08 22:22:44,049 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-08 22:22:44,050 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-08 22:22:44,050 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-08 22:22:44,050 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-08 22:22:44,050 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-08 22:22:44,050 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-08 22:22:44,051 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-08 22:22:44,051 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-08 22:22:44,051 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-08 22:22:44,051 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-08 22:22:44,051 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-08 22:22:44,052 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-08 22:22:44,052 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-07-08 22:22:44,052 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-08 22:22:44,052 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-08 22:22:44,053 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-08 22:22:44,053 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-08 22:22:44,054 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-08 22:22:44,054 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-08 22:22:44,054 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true
[2020-07-08 22:22:44,314 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-08 22:22:44,328 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-08 22:22:44,331 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-08 22:22:44,333 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-08 22:22:44,333 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-08 22:22:44,334 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test09.c
[2020-07-08 22:22:44,402 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692078cfb/0cf7339ff0d64ec4bf3fb98e2fab285b/FLAGdca5d4980
[2020-07-08 22:22:44,859 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-08 22:22:44,860 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test09.c
[2020-07-08 22:22:44,867 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692078cfb/0cf7339ff0d64ec4bf3fb98e2fab285b/FLAGdca5d4980
[2020-07-08 22:22:45,265 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692078cfb/0cf7339ff0d64ec4bf3fb98e2fab285b
[2020-07-08 22:22:45,275 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-08 22:22:45,277 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-08 22:22:45,283 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-08 22:22:45,283 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-08 22:22:45,286 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-08 22:22:45,288 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,291 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de36573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45, skipping insertion in model container
[2020-07-08 22:22:45,291 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,300 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-08 22:22:45,318 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-08 22:22:45,540 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 22:22:45,552 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-08 22:22:45,573 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 22:22:45,596 INFO  L208         MainTranslator]: Completed translation
[2020-07-08 22:22:45,597 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45 WrapperNode
[2020-07-08 22:22:45,597 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-08 22:22:45,597 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-08 22:22:45,598 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-08 22:22:45,598 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-08 22:22:45,689 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,689 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,698 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,699 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,716 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,718 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,725 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (1/1) ...
[2020-07-08 22:22:45,727 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-08 22:22:45,731 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-08 22:22:45,731 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-08 22:22:45,731 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-08 22:22:45,734 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (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 22:22:45,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-08 22:22:45,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-08 22:22:45,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure f
[2020-07-08 22:22:45,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-08 22:22:45,787 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure f
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-08 22:22:45,788 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-08 22:22:46,123 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-08 22:22:46,123 INFO  L295             CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-08 22:22:46,127 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:22:46 BoogieIcfgContainer
[2020-07-08 22:22:46,127 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-08 22:22:46,129 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-08 22:22:46,129 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-08 22:22:46,132 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-08 22:22:46,133 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:22:45" (1/3) ...
[2020-07-08 22:22:46,133 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc662d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:22:46, skipping insertion in model container
[2020-07-08 22:22:46,134 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:22:45" (2/3) ...
[2020-07-08 22:22:46,134 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc662d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:22:46, skipping insertion in model container
[2020-07-08 22:22:46,134 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:22:46" (3/3) ...
[2020-07-08 22:22:46,136 INFO  L109   eAbstractionObserver]: Analyzing ICFG test09.c
[2020-07-08 22:22:46,146 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-08 22:22:46,153 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-08 22:22:46,175 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-08 22:22:46,212 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-08 22:22:46,218 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-08 22:22:46,218 INFO  L377      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-07-08 22:22:46,219 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-08 22:22:46,219 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-08 22:22:46,219 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-08 22:22:46,219 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-08 22:22:46,219 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-08 22:22:46,235 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states.
[2020-07-08 22:22:46,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2020-07-08 22:22:46,245 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 22:22:46,246 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 22:22:46,247 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 22:22:46,251 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 22:22:46,252 INFO  L82        PathProgramCache]: Analyzing trace with hash 19454853, now seen corresponding path program 1 times
[2020-07-08 22:22:46,258 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-08 22:22:46,258 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387765297]
[2020-07-08 22:22:46,258 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 22:22:46,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:46,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:46,943 INFO  L280        TraceCheckUtils]: 0: Hoare triple {85#(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; {55#true} is VALID
[2020-07-08 22:22:46,944 INFO  L280        TraceCheckUtils]: 1: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID
[2020-07-08 22:22:46,944 INFO  L280        TraceCheckUtils]: 2: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID
[2020-07-08 22:22:46,946 INFO  L280        TraceCheckUtils]: 3: Hoare triple {55#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {86#(= 1 (select |#valid| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,947 INFO  L280        TraceCheckUtils]: 4: Hoare triple {86#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {86#(= 1 (select |#valid| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,949 INFO  L280        TraceCheckUtils]: 5: Hoare triple {86#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,950 INFO  L280        TraceCheckUtils]: 6: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,950 INFO  L280        TraceCheckUtils]: 7: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,952 INFO  L280        TraceCheckUtils]: 8: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,953 INFO  L280        TraceCheckUtils]: 9: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,954 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {68#(not (= |~#b~0.base| |~#a~0.base|))} {55#true} #56#return; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:46,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:47,338 INFO  L280        TraceCheckUtils]: 0: Hoare triple {87#(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 {88#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID
[2020-07-08 22:22:47,340 INFO  L280        TraceCheckUtils]: 1: Hoare triple {88#(= |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 {89#(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 22:22:47,341 INFO  L280        TraceCheckUtils]: 2: Hoare triple {89#(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 {90#(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 22:22:47,342 INFO  L280        TraceCheckUtils]: 3: Hoare triple {90#(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; {91#(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 22:22:47,343 INFO  L280        TraceCheckUtils]: 4: Hoare triple {91#(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; {91#(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 22:22:47,344 INFO  L280        TraceCheckUtils]: 5: Hoare triple {91#(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; {91#(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 22:22:47,345 INFO  L280        TraceCheckUtils]: 6: Hoare triple {91#(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; {91#(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 22:22:47,346 INFO  L280        TraceCheckUtils]: 7: Hoare triple {91#(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); {92#(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 22:22:47,347 INFO  L280        TraceCheckUtils]: 8: Hoare triple {92#(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; {92#(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 22:22:47,348 INFO  L280        TraceCheckUtils]: 9: Hoare triple {92#(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; {92#(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 22:22:47,350 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {92#(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|)))} {73#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #60#return; {56#false} is VALID
[2020-07-08 22:22:47,354 INFO  L263        TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {85#(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 22:22:47,354 INFO  L280        TraceCheckUtils]: 1: Hoare triple {85#(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; {55#true} is VALID
[2020-07-08 22:22:47,355 INFO  L280        TraceCheckUtils]: 2: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID
[2020-07-08 22:22:47,355 INFO  L280        TraceCheckUtils]: 3: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID
[2020-07-08 22:22:47,356 INFO  L280        TraceCheckUtils]: 4: Hoare triple {55#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {86#(= 1 (select |#valid| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,357 INFO  L280        TraceCheckUtils]: 5: Hoare triple {86#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {86#(= 1 (select |#valid| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,358 INFO  L280        TraceCheckUtils]: 6: Hoare triple {86#(= 1 (select |#valid| |~#a~0.base|))} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,359 INFO  L280        TraceCheckUtils]: 7: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,360 INFO  L280        TraceCheckUtils]: 8: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,361 INFO  L280        TraceCheckUtils]: 9: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p2~0.base, ~p2~0.offset := 0, 0; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,361 INFO  L280        TraceCheckUtils]: 10: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,362 INFO  L275        TraceCheckUtils]: 11: Hoare quadruple {68#(not (= |~#b~0.base| |~#a~0.base|))} {55#true} #56#return; {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,363 INFO  L263        TraceCheckUtils]: 12: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} call #t~ret7 := main(); {68#(not (= |~#b~0.base| |~#a~0.base|))} is VALID
[2020-07-08 22:22:47,364 INFO  L280        TraceCheckUtils]: 13: Hoare triple {68#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {69#(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 22:22:47,365 INFO  L280        TraceCheckUtils]: 14: Hoare triple {69#(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; {70#(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 22:22:47,367 INFO  L280        TraceCheckUtils]: 15: Hoare triple {70#(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 {71#(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 22:22:47,368 INFO  L280        TraceCheckUtils]: 16: Hoare triple {71#(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 {71#(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 22:22:47,369 INFO  L280        TraceCheckUtils]: 17: Hoare triple {71#(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 {71#(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 22:22:47,371 INFO  L280        TraceCheckUtils]: 18: Hoare triple {71#(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; {72#(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 22:22:47,372 INFO  L280        TraceCheckUtils]: 19: Hoare triple {72#(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 {73#(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 22:22:47,373 INFO  L280        TraceCheckUtils]: 20: Hoare triple {73#(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; {73#(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 22:22:47,374 INFO  L280        TraceCheckUtils]: 21: Hoare triple {73#(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; {73#(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 22:22:47,375 INFO  L263        TraceCheckUtils]: 22: Hoare triple {73#(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(); {87#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID
[2020-07-08 22:22:47,376 INFO  L280        TraceCheckUtils]: 23: Hoare triple {87#(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 {88#(= |f_#t~mem0| (select (select |#memory_int| |old(~p1~0.base)|) |old(~p1~0.offset)|))} is VALID
[2020-07-08 22:22:47,377 INFO  L280        TraceCheckUtils]: 24: Hoare triple {88#(= |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 {89#(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 22:22:47,378 INFO  L280        TraceCheckUtils]: 25: Hoare triple {89#(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 {90#(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 22:22:47,379 INFO  L280        TraceCheckUtils]: 26: Hoare triple {90#(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; {91#(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 22:22:47,380 INFO  L280        TraceCheckUtils]: 27: Hoare triple {91#(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; {91#(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 22:22:47,381 INFO  L280        TraceCheckUtils]: 28: Hoare triple {91#(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; {91#(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 22:22:47,381 INFO  L280        TraceCheckUtils]: 29: Hoare triple {91#(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; {91#(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 22:22:47,382 INFO  L280        TraceCheckUtils]: 30: Hoare triple {91#(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); {92#(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 22:22:47,383 INFO  L280        TraceCheckUtils]: 31: Hoare triple {92#(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; {92#(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 22:22:47,384 INFO  L280        TraceCheckUtils]: 32: Hoare triple {92#(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; {92#(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 22:22:47,386 INFO  L275        TraceCheckUtils]: 33: Hoare quadruple {92#(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|)))} {73#(and (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) (= ~p1~0.offset |~#a~0.offset|) (= |~#a~0.base| ~p1~0.base))} #60#return; {56#false} is VALID
[2020-07-08 22:22:47,386 INFO  L280        TraceCheckUtils]: 34: Hoare triple {56#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {56#false} is VALID
[2020-07-08 22:22:47,387 INFO  L280        TraceCheckUtils]: 35: Hoare triple {56#false} SUMMARY for call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L27-2 {56#false} is VALID
[2020-07-08 22:22:47,387 INFO  L280        TraceCheckUtils]: 36: Hoare triple {56#false} havoc #t~ret5; {56#false} is VALID
[2020-07-08 22:22:47,387 INFO  L280        TraceCheckUtils]: 37: Hoare triple {56#false} SUMMARY for call write~int(1000, ~p1~0.base, ~p1~0.offset, 4); srcloc: L29 {56#false} is VALID
[2020-07-08 22:22:47,388 INFO  L280        TraceCheckUtils]: 38: Hoare triple {56#false} SUMMARY for call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L29-1 {56#false} is VALID
[2020-07-08 22:22:47,388 INFO  L280        TraceCheckUtils]: 39: Hoare triple {56#false} assume 1000 != #t~mem6; {56#false} is VALID
[2020-07-08 22:22:47,388 INFO  L280        TraceCheckUtils]: 40: Hoare triple {56#false} havoc #t~mem6; {56#false} is VALID
[2020-07-08 22:22:47,389 INFO  L280        TraceCheckUtils]: 41: Hoare triple {56#false} assume !false; {56#false} is VALID
[2020-07-08 22:22:47,399 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 22:22:47,400 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387765297]
[2020-07-08 22:22:47,403 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 22:22:47,403 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2020-07-08 22:22:47,404 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178341533]
[2020-07-08 22:22:47,412 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 42
[2020-07-08 22:22:47,415 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 22:22:47,419 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states.
[2020-07-08 22:22:47,494 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 22:22:47,495 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 16 states
[2020-07-08 22:22:47,495 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-08 22:22:47,507 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2020-07-08 22:22:47,508 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240
[2020-07-08 22:22:47,511 INFO  L87              Difference]: Start difference. First operand 52 states. Second operand 16 states.
[2020-07-08 22:22:48,873 WARN  L193               SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60
[2020-07-08 22:22:49,070 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62
[2020-07-08 22:22:49,274 WARN  L193               SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66
[2020-07-08 22:22:49,454 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62
[2020-07-08 22:22:49,630 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58
[2020-07-08 22:22:50,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:50,217 INFO  L93              Difference]: Finished difference Result 69 states and 70 transitions.
[2020-07-08 22:22:50,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2020-07-08 22:22:50,218 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 42
[2020-07-08 22:22:50,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 22:22:50,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2020-07-08 22:22:50,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions.
[2020-07-08 22:22:50,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2020-07-08 22:22:50,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions.
[2020-07-08 22:22:50,239 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 70 transitions.
[2020-07-08 22:22:50,372 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 22:22:50,389 INFO  L225             Difference]: With dead ends: 69
[2020-07-08 22:22:50,389 INFO  L226             Difference]: Without dead ends: 44
[2020-07-08 22:22:50,393 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 22:22:50,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2020-07-08 22:22:50,614 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2020-07-08 22:22:50,615 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 22:22:50,616 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states.
[2020-07-08 22:22:50,616 INFO  L74              IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states.
[2020-07-08 22:22:50,616 INFO  L87              Difference]: Start difference. First operand 44 states. Second operand 44 states.
[2020-07-08 22:22:50,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:50,621 INFO  L93              Difference]: Finished difference Result 44 states and 43 transitions.
[2020-07-08 22:22:50,621 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions.
[2020-07-08 22:22:50,622 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 22:22:50,622 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 22:22:50,622 INFO  L74              IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states.
[2020-07-08 22:22:50,623 INFO  L87              Difference]: Start difference. First operand 44 states. Second operand 44 states.
[2020-07-08 22:22:50,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:50,627 INFO  L93              Difference]: Finished difference Result 44 states and 43 transitions.
[2020-07-08 22:22:50,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions.
[2020-07-08 22:22:50,628 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 22:22:50,629 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 22:22:50,629 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 22:22:50,629 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 22:22:50,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2020-07-08 22:22:50,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions.
[2020-07-08 22:22:50,634 INFO  L78                 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 42
[2020-07-08 22:22:50,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 22:22:50,634 INFO  L479      AbstractCegarLoop]: Abstraction has 44 states and 43 transitions.
[2020-07-08 22:22:50,635 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 16 states.
[2020-07-08 22:22:50,635 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 43 transitions.
[2020-07-08 22:22:50,711 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 22:22:50,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions.
[2020-07-08 22:22:50,713 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2020-07-08 22:22:50,714 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 22:22:50,714 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-08 22:22:50,714 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-08 22:22:50,714 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 22:22:50,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 22:22:50,715 INFO  L82        PathProgramCache]: Analyzing trace with hash 1202217324, now seen corresponding path program 1 times
[2020-07-08 22:22:50,716 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-08 22:22:50,716 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759451565]
[2020-07-08 22:22:50,717 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 22:22:50,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:50,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:50,922 INFO  L280        TraceCheckUtils]: 0: Hoare triple {467#(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; {439#true} is VALID
[2020-07-08 22:22:50,923 INFO  L280        TraceCheckUtils]: 1: Hoare triple {439#true} #valid := #valid[0 := 0]; {439#true} is VALID
[2020-07-08 22:22:50,923 INFO  L280        TraceCheckUtils]: 2: Hoare triple {439#true} assume 0 < #StackHeapBarrier; {439#true} is VALID
[2020-07-08 22:22:50,923 INFO  L280        TraceCheckUtils]: 3: Hoare triple {439#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {439#true} is VALID
[2020-07-08 22:22:50,923 INFO  L280        TraceCheckUtils]: 4: Hoare triple {439#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {439#true} is VALID
[2020-07-08 22:22:50,923 INFO  L280        TraceCheckUtils]: 5: Hoare triple {439#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {439#true} is VALID
[2020-07-08 22:22:50,924 INFO  L280        TraceCheckUtils]: 6: Hoare triple {439#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {439#true} is VALID
[2020-07-08 22:22:50,924 INFO  L280        TraceCheckUtils]: 7: Hoare triple {439#true} ~p1~0.base, ~p1~0.offset := 0, 0; {439#true} is VALID
[2020-07-08 22:22:50,924 INFO  L280        TraceCheckUtils]: 8: Hoare triple {439#true} ~p2~0.base, ~p2~0.offset := 0, 0; {439#true} is VALID
[2020-07-08 22:22:50,924 INFO  L280        TraceCheckUtils]: 9: Hoare triple {439#true} assume true; {439#true} is VALID
[2020-07-08 22:22:50,925 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {439#true} {439#true} #56#return; {439#true} is VALID
[2020-07-08 22:22:50,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 22:22:50,951 INFO  L280        TraceCheckUtils]: 0: Hoare triple {468#(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 {439#true} is VALID
[2020-07-08 22:22:50,952 INFO  L280        TraceCheckUtils]: 1: Hoare triple {439#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {439#true} is VALID
[2020-07-08 22:22:50,952 INFO  L280        TraceCheckUtils]: 2: Hoare triple {439#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {439#true} is VALID
[2020-07-08 22:22:50,952 INFO  L280        TraceCheckUtils]: 3: Hoare triple {439#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {439#true} is VALID
[2020-07-08 22:22:50,953 INFO  L280        TraceCheckUtils]: 4: Hoare triple {439#true} havoc #t~mem1; {439#true} is VALID
[2020-07-08 22:22:50,953 INFO  L280        TraceCheckUtils]: 5: Hoare triple {439#true} havoc #t~mem0; {439#true} is VALID
[2020-07-08 22:22:50,953 INFO  L280        TraceCheckUtils]: 6: Hoare triple {439#true} havoc #t~mem2; {439#true} is VALID
[2020-07-08 22:22:50,954 INFO  L280        TraceCheckUtils]: 7: Hoare triple {439#true} assume 1 == ~v~0; {439#true} is VALID
[2020-07-08 22:22:50,955 INFO  L280        TraceCheckUtils]: 8: Hoare triple {439#true} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,957 INFO  L280        TraceCheckUtils]: 9: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,959 INFO  L280        TraceCheckUtils]: 10: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume true; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,961 INFO  L275        TraceCheckUtils]: 11: Hoare quadruple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} {439#true} #60#return; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,963 INFO  L263        TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {467#(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 22:22:50,963 INFO  L280        TraceCheckUtils]: 1: Hoare triple {467#(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; {439#true} is VALID
[2020-07-08 22:22:50,963 INFO  L280        TraceCheckUtils]: 2: Hoare triple {439#true} #valid := #valid[0 := 0]; {439#true} is VALID
[2020-07-08 22:22:50,964 INFO  L280        TraceCheckUtils]: 3: Hoare triple {439#true} assume 0 < #StackHeapBarrier; {439#true} is VALID
[2020-07-08 22:22:50,964 INFO  L280        TraceCheckUtils]: 4: Hoare triple {439#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L4 {439#true} is VALID
[2020-07-08 22:22:50,964 INFO  L280        TraceCheckUtils]: 5: Hoare triple {439#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L4-1 {439#true} is VALID
[2020-07-08 22:22:50,964 INFO  L280        TraceCheckUtils]: 6: Hoare triple {439#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L4-2 {439#true} is VALID
[2020-07-08 22:22:50,965 INFO  L280        TraceCheckUtils]: 7: Hoare triple {439#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L4-3 {439#true} is VALID
[2020-07-08 22:22:50,965 INFO  L280        TraceCheckUtils]: 8: Hoare triple {439#true} ~p1~0.base, ~p1~0.offset := 0, 0; {439#true} is VALID
[2020-07-08 22:22:50,965 INFO  L280        TraceCheckUtils]: 9: Hoare triple {439#true} ~p2~0.base, ~p2~0.offset := 0, 0; {439#true} is VALID
[2020-07-08 22:22:50,966 INFO  L280        TraceCheckUtils]: 10: Hoare triple {439#true} assume true; {439#true} is VALID
[2020-07-08 22:22:50,966 INFO  L275        TraceCheckUtils]: 11: Hoare quadruple {439#true} {439#true} #56#return; {439#true} is VALID
[2020-07-08 22:22:50,966 INFO  L263        TraceCheckUtils]: 12: Hoare triple {439#true} call #t~ret7 := main(); {439#true} is VALID
[2020-07-08 22:22:50,967 INFO  L280        TraceCheckUtils]: 13: Hoare triple {439#true} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; {439#true} is VALID
[2020-07-08 22:22:50,967 INFO  L280        TraceCheckUtils]: 14: Hoare triple {439#true} ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; {439#true} is VALID
[2020-07-08 22:22:50,967 INFO  L280        TraceCheckUtils]: 15: Hoare triple {439#true} SUMMARY for call write~int(1, ~#b~0.base, ~#b~0.offset, 4); srcloc: L22 {439#true} is VALID
[2020-07-08 22:22:50,967 INFO  L280        TraceCheckUtils]: 16: Hoare triple {439#true} SUMMARY for call write~int(5, ~#a~0.base, ~#a~0.offset, 4); srcloc: L22-1 {439#true} is VALID
[2020-07-08 22:22:50,968 INFO  L280        TraceCheckUtils]: 17: Hoare triple {439#true} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L23 {439#true} is VALID
[2020-07-08 22:22:50,968 INFO  L280        TraceCheckUtils]: 18: Hoare triple {439#true} #t~post4 := #t~mem3; {439#true} is VALID
[2020-07-08 22:22:50,968 INFO  L280        TraceCheckUtils]: 19: Hoare triple {439#true} SUMMARY for call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); srcloc: L25-1 {439#true} is VALID
[2020-07-08 22:22:50,969 INFO  L280        TraceCheckUtils]: 20: Hoare triple {439#true} havoc #t~post4; {439#true} is VALID
[2020-07-08 22:22:50,969 INFO  L280        TraceCheckUtils]: 21: Hoare triple {439#true} havoc #t~mem3; {439#true} is VALID
[2020-07-08 22:22:50,970 INFO  L263        TraceCheckUtils]: 22: Hoare triple {439#true} call #t~ret5 := f(); {468#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID
[2020-07-08 22:22:50,971 INFO  L280        TraceCheckUtils]: 23: Hoare triple {468#(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 {439#true} is VALID
[2020-07-08 22:22:50,971 INFO  L280        TraceCheckUtils]: 24: Hoare triple {439#true} SUMMARY for call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L8 {439#true} is VALID
[2020-07-08 22:22:50,971 INFO  L280        TraceCheckUtils]: 25: Hoare triple {439#true} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); srcloc: L8-1 {439#true} is VALID
[2020-07-08 22:22:50,971 INFO  L280        TraceCheckUtils]: 26: Hoare triple {439#true} ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; {439#true} is VALID
[2020-07-08 22:22:50,972 INFO  L280        TraceCheckUtils]: 27: Hoare triple {439#true} havoc #t~mem1; {439#true} is VALID
[2020-07-08 22:22:50,972 INFO  L280        TraceCheckUtils]: 28: Hoare triple {439#true} havoc #t~mem0; {439#true} is VALID
[2020-07-08 22:22:50,972 INFO  L280        TraceCheckUtils]: 29: Hoare triple {439#true} havoc #t~mem2; {439#true} is VALID
[2020-07-08 22:22:50,973 INFO  L280        TraceCheckUtils]: 30: Hoare triple {439#true} assume 1 == ~v~0; {439#true} is VALID
[2020-07-08 22:22:50,974 INFO  L280        TraceCheckUtils]: 31: Hoare triple {439#true} ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,975 INFO  L280        TraceCheckUtils]: 32: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} #res := ~v~0; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,976 INFO  L280        TraceCheckUtils]: 33: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume true; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,977 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} {439#true} #60#return; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,978 INFO  L280        TraceCheckUtils]: 35: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,978 INFO  L280        TraceCheckUtils]: 36: Hoare triple {464#(and (= ~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 {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,979 INFO  L280        TraceCheckUtils]: 37: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} havoc #t~ret5; {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} is VALID
[2020-07-08 22:22:50,980 INFO  L280        TraceCheckUtils]: 38: Hoare triple {464#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base))} SUMMARY for call write~int(1000, ~p1~0.base, ~p1~0.offset, 4); srcloc: L29 {465#(= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))} is VALID
[2020-07-08 22:22:50,981 INFO  L280        TraceCheckUtils]: 39: Hoare triple {465#(= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))} SUMMARY for call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); srcloc: L29-1 {466#(= 1000 |main_#t~mem6|)} is VALID
[2020-07-08 22:22:50,981 INFO  L280        TraceCheckUtils]: 40: Hoare triple {466#(= 1000 |main_#t~mem6|)} assume 1000 != #t~mem6; {440#false} is VALID
[2020-07-08 22:22:50,982 INFO  L280        TraceCheckUtils]: 41: Hoare triple {440#false} havoc #t~mem6; {440#false} is VALID
[2020-07-08 22:22:50,982 INFO  L280        TraceCheckUtils]: 42: Hoare triple {440#false} assume !false; {440#false} is VALID
[2020-07-08 22:22:50,985 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 22:22:50,985 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759451565]
[2020-07-08 22:22:50,985 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 22:22:50,986 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-08 22:22:50,986 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416214179]
[2020-07-08 22:22:50,988 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 43
[2020-07-08 22:22:50,988 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 22:22:50,988 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-08 22:22:51,034 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 22:22:51,034 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-08 22:22:51,034 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-08 22:22:51,035 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-08 22:22:51,035 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-08 22:22:51,035 INFO  L87              Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 7 states.
[2020-07-08 22:22:51,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:51,593 INFO  L93              Difference]: Finished difference Result 44 states and 43 transitions.
[2020-07-08 22:22:51,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-07-08 22:22:51,594 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 43
[2020-07-08 22:22:51,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 22:22:51,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-08 22:22:51,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions.
[2020-07-08 22:22:51,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-08 22:22:51,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions.
[2020-07-08 22:22:51,601 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions.
[2020-07-08 22:22:51,653 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 22:22:51,654 INFO  L225             Difference]: With dead ends: 44
[2020-07-08 22:22:51,654 INFO  L226             Difference]: Without dead ends: 0
[2020-07-08 22:22:51,655 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-07-08 22:22:51,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-08 22:22:51,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-08 22:22:51,656 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 22:22:51,656 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-08 22:22:51,656 INFO  L74              IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-08 22:22:51,656 INFO  L87              Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-08 22:22:51,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:51,657 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-08 22:22:51,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-08 22:22:51,657 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 22:22:51,657 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 22:22:51,657 INFO  L74              IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-08 22:22:51,658 INFO  L87              Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-08 22:22:51,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 22:22:51,658 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-08 22:22:51,658 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-08 22:22:51,658 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 22:22:51,658 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 22:22:51,659 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 22:22:51,659 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 22:22:51,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-08 22:22:51,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-08 22:22:51,659 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43
[2020-07-08 22:22:51,660 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 22:22:51,660 INFO  L479      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-08 22:22:51,660 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-08 22:22:51,660 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2020-07-08 22:22:51,660 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 22:22:51,660 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-08 22:22:51,660 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 22:22:51,661 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-08 22:22:51,662 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-08 22:22:52,795 WARN  L193               SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48
[2020-07-08 22:22:52,903 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44
[2020-07-08 22:22:53,514 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 22:22:53,515 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 22:22:53,515 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 22:22:53,515 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 22:22:53,515 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 22:22:53,515 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 22:22:53,516 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 22:22:53,516 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 22:22:53,516 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 22:22:53,516 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 22:22:53,516 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 22:22:53,517 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))) (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 22:22:53,517 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 22:22:53,517 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 22:22:53,517 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 22:22:53,518 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 22:22:53,518 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 22:22:53,518 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))) (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 22:22:53,518 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 22:22:53,519 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 22:22:53,519 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 22:22:53,519 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 22:22:53,519 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 22:22:53,520 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)) (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 22:22:53,520 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 22:22:53,520 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 22:22:53,520 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.startENTRY(line -1)  the Hoare annotation is:  true
[2020-07-08 22:22:53,520 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 22:22:53,521 INFO  L264        CegarLoopResult]: At program point  L31(lines 31 33)  the Hoare annotation is:  (or (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))) (and (= 1000 |main_#t~mem6|) (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))))
[2020-07-08 22:22:53,521 INFO  L264        CegarLoopResult]: At program point  L31-1(line 31)  the Hoare annotation is:  (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))))
[2020-07-08 22:22:53,521 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)))
[2020-07-08 22:22:53,521 INFO  L271        CegarLoopResult]: At program point  L31-2(line 31)  the Hoare annotation is:  true
[2020-07-08 22:22:53,521 INFO  L264        CegarLoopResult]: At program point  L29-1(line 29)  the Hoare annotation is:  (or (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (= 1000 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= |~#b~0.base| |~#a~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))))
[2020-07-08 22:22:53,522 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 22:22:53,522 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 (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base)))
[2020-07-08 22:22:53,522 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 22:22:53,522 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 (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base)))
[2020-07-08 22:22:53,522 INFO  L271        CegarLoopResult]: At program point  mainEXIT(lines 17 39)  the Hoare annotation is:  true
[2020-07-08 22:22:53,523 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 22:22:53,523 INFO  L264        CegarLoopResult]: At program point  L27-3(line 27)  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)))
[2020-07-08 22:22:53,523 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 22:22:53,523 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 22:22:53,523 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 22:22:53,524 INFO  L271        CegarLoopResult]: At program point  mainFINAL(lines 17 39)  the Hoare annotation is:  true
[2020-07-08 22:22:53,524 INFO  L264        CegarLoopResult]: At program point  L38(line 38)  the Hoare annotation is:  (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))))
[2020-07-08 22:22:53,524 INFO  L264        CegarLoopResult]: At program point  L32(lines 17 39)  the Hoare annotation is:  (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))))
[2020-07-08 22:22:53,524 INFO  L264        CegarLoopResult]: At program point  mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37)  the Hoare annotation is:  (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select |#valid| |~#a~0.base|))))
[2020-07-08 22:22:53,525 INFO  L264        CegarLoopResult]: At program point  mainENTRY(lines 17 39)  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 22:22:53,525 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 22:22:53,525 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 22:22:53,525 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 22:22:53,525 INFO  L271        CegarLoopResult]: At program point  L35(line 35)  the Hoare annotation is:  true
[2020-07-08 22:22:53,563 INFO  L163   areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-08 22:22:53,576 WARN  L1295  BoogieBacktranslator]: unknown boogie variable #memory_int
[2020-07-08 22:22:53,577 WARN  L1295  BoogieBacktranslator]: unknown boogie variable #memory_int
[2020-07-08 22:22:53,580 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:22:53 BoogieIcfgContainer
[2020-07-08 22:22:53,580 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-08 22:22:53,582 INFO  L168              Benchmark]: Toolchain (without parser) took 8304.87 ms. Allocated memory was 138.4 MB in the beginning and 332.9 MB in the end (delta: 194.5 MB). Free memory was 103.2 MB in the beginning and 229.8 MB in the end (delta: -126.6 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,583 INFO  L168              Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,584 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 314.30 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,585 INFO  L168              Benchmark]: Boogie Preprocessor took 129.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.7 MB in the beginning and 179.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,586 INFO  L168              Benchmark]: RCFGBuilder took 396.65 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 155.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,587 INFO  L168              Benchmark]: TraceAbstraction took 7451.17 ms. Allocated memory was 201.9 MB in the beginning and 332.9 MB in the end (delta: 131.1 MB). Free memory was 154.5 MB in the beginning and 229.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB.
[2020-07-08 22:22:53,591 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.85 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 314.30 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 129.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.7 MB in the beginning and 179.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 396.65 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 155.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7451.17 ms. Allocated memory was 201.9 MB in the beginning and 332.9 MB in the end (delta: 131.1 MB). Free memory was 154.5 MB in the beginning and 229.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 55.8 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: 37]: 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 22:22:53,601 WARN  L1295  BoogieBacktranslator]: unknown boogie variable #memory_int
[2020-07-08 22:22:53,601 WARN  L1295  BoogieBacktranslator]: unknown boogie variable #memory_int
[2020-07-08 22:22:53,602 WARN  L1295  BoogieBacktranslator]: unknown boogie variable #memory_int
[2020-07-08 22:22:53,603 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 == p1 && v <= 1) && 1 <= v) && p2 == p1)) || !(p2 == b)) || !(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, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 64 SDtfs, 144 SDslu, 258 SDs, 0 SdLazy, 316 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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, 52 LocationsWithAnnotation, 52 PreInvPairs, 66 NumberOfFragments, 1395 HoareAnnotationTreeSize, 52 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 1108 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 24939 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...