/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:24:44,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:24:44,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:24:44,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:24:44,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:24:44,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:24:44,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:24:44,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:24:44,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:24:44,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:24:44,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:24:44,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:24:44,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:24:44,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:24:44,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:24:44,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:24:44,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:24:44,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:24:44,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:24:44,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:24:44,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:24:44,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:24:44,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:24:44,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:24:44,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:24:44,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:24:44,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:24:44,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:24:44,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:24:44,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:24:44,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:24:44,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:24:44,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:24:44,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:24:44,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:24:44,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:24:44,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:24:44,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:24:44,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:24:44,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:24:44,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:24:44,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:24:44,636 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:24:44,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:24:44,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:24:44,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:24:44,638 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:24:44,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:24:44,639 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:24:44,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:24:44,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:24:44,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:24:44,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:24:44,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:24:44,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:24:44,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:24:44,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:24:44,641 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:24:44,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:24:44,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:24:44,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:24:44,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:24:44,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:24:44,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:24:44,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:24:44,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:24:44,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:24:44,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:24:44,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:24:44,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:24:44,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:24:44,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:24:44,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:24:44,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:24:44,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:24:44,962 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:24:44,962 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:24:44,963 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05.c [2020-07-08 12:24:45,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355fce990/b43482590edb4576b6e3d5bbbed9aad8/FLAG0c2eccb34 [2020-07-08 12:24:45,483 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:24:45,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05.c [2020-07-08 12:24:45,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355fce990/b43482590edb4576b6e3d5bbbed9aad8/FLAG0c2eccb34 [2020-07-08 12:24:45,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355fce990/b43482590edb4576b6e3d5bbbed9aad8 [2020-07-08 12:24:45,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:24:45,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:24:45,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:24:45,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:24:45,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:24:45,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:24:45" (1/1) ... [2020-07-08 12:24:45,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f902fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:45, skipping insertion in model container [2020-07-08 12:24:45,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:24:45" (1/1) ... [2020-07-08 12:24:45,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:24:45,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:24:46,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:24:46,122 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:24:46,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:24:46,164 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:24:46,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46 WrapperNode [2020-07-08 12:24:46,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:24:46,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:24:46,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:24:46,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:24:46,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (1/1) ... [2020-07-08 12:24:46,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:24:46,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:24:46,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:24:46,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:24:46,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (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 12:24:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:24:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:24:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-08 12:24:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-08 12:24:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:24:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:24:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:24:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:24:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:24:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:24:46,859 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:24:46,859 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:24:46,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:24:46 BoogieIcfgContainer [2020-07-08 12:24:46,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:24:46,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:24:46,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:24:46,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:24:46,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:24:45" (1/3) ... [2020-07-08 12:24:46,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764331cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:24:46, skipping insertion in model container [2020-07-08 12:24:46,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:24:46" (2/3) ... [2020-07-08 12:24:46,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764331cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:24:46, skipping insertion in model container [2020-07-08 12:24:46,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:24:46" (3/3) ... [2020-07-08 12:24:46,872 INFO L109 eAbstractionObserver]: Analyzing ICFG test05.c [2020-07-08 12:24:46,882 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:24:46,890 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:24:46,902 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:24:46,923 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:24:46,923 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:24:46,923 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:24:46,924 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:24:46,924 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:24:46,924 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:24:46,924 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:24:46,925 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:24:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-08 12:24:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:24:46,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:24:46,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:24:46,951 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:24:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:24:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash -685779266, now seen corresponding path program 1 times [2020-07-08 12:24:46,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:24:46,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065910032] [2020-07-08 12:24:46,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:24:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:47,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-08 12:24:47,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:24:47,308 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2020-07-08 12:24:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:47,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {40#(= |f_#in~a| f_~a)} is VALID [2020-07-08 12:24:47,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#(= |f_#in~a| f_~a)} assume !(4 == ~a);#res := 0; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-08 12:24:47,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(not (= 4 |f_#in~a|))} assume true; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-08 12:24:47,413 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#(not (= 4 |f_#in~a|))} {33#(= 4 |main_#t~mem4|)} #38#return; {29#false} is VALID [2020-07-08 12:24:47,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:24:47,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-08 12:24:47,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:24:47,417 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2020-07-08 12:24:47,417 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2020-07-08 12:24:47,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {33#(= 4 |main_#t~mem4|)} is VALID [2020-07-08 12:24:47,427 INFO L263 TraceCheckUtils]: 6: Hoare triple {33#(= 4 |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:47,429 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {40#(= |f_#in~a| f_~a)} is VALID [2020-07-08 12:24:47,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#(= |f_#in~a| f_~a)} assume !(4 == ~a);#res := 0; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-08 12:24:47,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(not (= 4 |f_#in~a|))} assume true; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-08 12:24:47,435 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {41#(not (= 4 |f_#in~a|))} {33#(= 4 |main_#t~mem4|)} #38#return; {29#false} is VALID [2020-07-08 12:24:47,436 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {29#false} is VALID [2020-07-08 12:24:47,436 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume 1 != #t~mem6;havoc #t~mem6; {29#false} is VALID [2020-07-08 12:24:47,437 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-08 12:24:47,442 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 12:24:47,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065910032] [2020-07-08 12:24:47,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:24:47,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:24:47,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723375328] [2020-07-08 12:24:47,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-08 12:24:47,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:24:47,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:24:47,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:47,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:24:47,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:24:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:24:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:24:47,515 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 7 states. [2020-07-08 12:24:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:48,157 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-08 12:24:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:24:48,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-08 12:24:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:24:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:24:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-08 12:24:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:24:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-08 12:24:48,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-08 12:24:48,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:48,262 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:24:48,262 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:24:48,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:24:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:24:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-08 12:24:48,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:24:48,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:48,324 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:48,324 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:48,328 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-08 12:24:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-08 12:24:48,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:48,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:48,329 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:48,330 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:48,334 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-08 12:24:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-08 12:24:48,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:48,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:48,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:24:48,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:24:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:24:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-08 12:24:48,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2020-07-08 12:24:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:24:48,340 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-08 12:24:48,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:24:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-08 12:24:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:24:48,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:24:48,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:24:48,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:24:48,342 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:24:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:24:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash 636648720, now seen corresponding path program 1 times [2020-07-08 12:24:48,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:24:48,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737709417] [2020-07-08 12:24:48,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:24:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:48,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-08 12:24:48,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-08 12:24:48,490 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #34#return; {171#true} is VALID [2020-07-08 12:24:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:48,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-08 12:24:48,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-08 12:24:48,560 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-08 12:24:48,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {171#true} is VALID [2020-07-08 12:24:48,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume 4 == ~a; {171#true} is VALID [2020-07-08 12:24:48,563 INFO L263 TraceCheckUtils]: 2: Hoare triple {171#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:48,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-08 12:24:48,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-08 12:24:48,564 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-08 12:24:48,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {171#true} #res := 1; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-08 12:24:48,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} assume true; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-08 12:24:48,569 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} {171#true} #38#return; {185#(= 1 |main_#t~ret5|)} is VALID [2020-07-08 12:24:48,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:24:48,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-08 12:24:48,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-08 12:24:48,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #34#return; {171#true} is VALID [2020-07-08 12:24:48,572 INFO L263 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret9 := main(); {171#true} is VALID [2020-07-08 12:24:48,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {171#true} is VALID [2020-07-08 12:24:48,574 INFO L263 TraceCheckUtils]: 6: Hoare triple {171#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:48,575 INFO L280 TraceCheckUtils]: 7: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {171#true} is VALID [2020-07-08 12:24:48,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#true} assume 4 == ~a; {171#true} is VALID [2020-07-08 12:24:48,577 INFO L263 TraceCheckUtils]: 9: Hoare triple {171#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:48,577 INFO L280 TraceCheckUtils]: 10: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-08 12:24:48,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-08 12:24:48,578 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-08 12:24:48,579 INFO L280 TraceCheckUtils]: 13: Hoare triple {171#true} #res := 1; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-08 12:24:48,580 INFO L280 TraceCheckUtils]: 14: Hoare triple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} assume true; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-08 12:24:48,582 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} {171#true} #38#return; {185#(= 1 |main_#t~ret5|)} is VALID [2020-07-08 12:24:48,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {185#(= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {186#(= 1 |main_#t~mem6|)} is VALID [2020-07-08 12:24:48,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {186#(= 1 |main_#t~mem6|)} assume 1 != #t~mem6;havoc #t~mem6; {172#false} is VALID [2020-07-08 12:24:48,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {172#false} assume !false; {172#false} is VALID [2020-07-08 12:24:48,586 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 12:24:48,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737709417] [2020-07-08 12:24:48,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:24:48,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:24:48,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369179479] [2020-07-08 12:24:48,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-08 12:24:48,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:24:48,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:24:48,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:48,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:24:48,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:24:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:24:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:24:48,621 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2020-07-08 12:24:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:49,130 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2020-07-08 12:24:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:24:49,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-08 12:24:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:24:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:24:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-07-08 12:24:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:24:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-07-08 12:24:49,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2020-07-08 12:24:49,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:49,182 INFO L225 Difference]: With dead ends: 23 [2020-07-08 12:24:49,182 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:24:49,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:24:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:24:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-08 12:24:49,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:24:49,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:49,211 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:49,211 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:49,213 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-08 12:24:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-08 12:24:49,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:49,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:49,217 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:49,218 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:24:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:49,223 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-08 12:24:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-08 12:24:49,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:49,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:49,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:24:49,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:24:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:24:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2020-07-08 12:24:49,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2020-07-08 12:24:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:24:49,229 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2020-07-08 12:24:49,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:24:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-08 12:24:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:24:49,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:24:49,232 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] [2020-07-08 12:24:49,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:24:49,233 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:24:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:24:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1738724303, now seen corresponding path program 1 times [2020-07-08 12:24:49,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:24:49,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986573] [2020-07-08 12:24:49,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:24:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:49,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {305#true} is VALID [2020-07-08 12:24:49,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-08 12:24:49,549 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #34#return; {305#true} is VALID [2020-07-08 12:24:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:49,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,710 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-08 12:24:49,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume 4 == ~a; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-08 12:24:49,715 INFO L263 TraceCheckUtils]: 2: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:49,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,722 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} #res := 1; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} assume true; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,727 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} #38#return; {320#(and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)) 0) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-08 12:24:49,729 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:24:49,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {305#true} is VALID [2020-07-08 12:24:49,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-08 12:24:49,730 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #34#return; {305#true} is VALID [2020-07-08 12:24:49,730 INFO L263 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret9 := main(); {305#true} is VALID [2020-07-08 12:24:49,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-08 12:24:49,737 INFO L263 TraceCheckUtils]: 6: Hoare triple {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:49,738 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-08 12:24:49,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume 4 == ~a; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-08 12:24:49,745 INFO L263 TraceCheckUtils]: 9: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:24:49,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-08 12:24:49,754 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} #res := 1; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,764 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} assume true; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-08 12:24:49,776 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} #38#return; {320#(and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)) 0) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-08 12:24:49,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {320#(and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)) 0) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {321#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} is VALID [2020-07-08 12:24:49,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {321#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} assume !(1 != #t~mem6);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {322#(= 0 |main_#t~mem8|)} is VALID [2020-07-08 12:24:49,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {322#(= 0 |main_#t~mem8|)} assume 0 != #t~mem8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {306#false} is VALID [2020-07-08 12:24:49,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-08 12:24:49,790 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 12:24:49,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986573] [2020-07-08 12:24:49,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:24:49,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 12:24:49,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798112306] [2020-07-08 12:24:49,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-08 12:24:49,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:24:49,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:24:49,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:49,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:24:49,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:24:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:24:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:24:49,836 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 11 states. [2020-07-08 12:24:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:50,844 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-08 12:24:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:24:50,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-08 12:24:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:24:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:24:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2020-07-08 12:24:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:24:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2020-07-08 12:24:50,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 20 transitions. [2020-07-08 12:24:50,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:50,897 INFO L225 Difference]: With dead ends: 21 [2020-07-08 12:24:50,898 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:24:50,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:24:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:24:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:24:50,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:24:50,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:24:50,899 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:24:50,900 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:24:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:50,901 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:24:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:24:50,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:50,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:50,902 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:24:50,902 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:24:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:50,902 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:24:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:24:50,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:50,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:50,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:24:50,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:24:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:24:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:24:50,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-08 12:24:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:24:50,904 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:24:50,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:24:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:24:50,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:50,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:24:50,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:24:51,149 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:24:51,149 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 12:24:51,149 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:24:51,150 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (= |f_#in~a| f_~a) (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:24:51,150 INFO L268 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-07-08 12:24:51,150 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-08 12:24:51,151 INFO L268 CegarLoopResult]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2020-07-08 12:24:51,151 INFO L264 CegarLoopResult]: At program point fENTRY(lines 11 18) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:24:51,151 INFO L268 CegarLoopResult]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2020-07-08 12:24:51,151 INFO L268 CegarLoopResult]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-08 12:24:51,151 INFO L268 CegarLoopResult]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-08 12:24:51,151 INFO L264 CegarLoopResult]: At program point gENTRY(lines 4 9) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:24:51,152 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:24:51,152 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:24:51,152 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:24:51,152 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:24:51,152 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (and (not (= .cse0 |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= .cse0 |main_~#p1~0.base|)) (= 4 |main_#t~mem4|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))) [2020-07-08 12:24:51,152 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2020-07-08 12:24:51,153 INFO L268 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-07-08 12:24:51,153 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:24:51,153 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2020-07-08 12:24:51,153 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2020-07-08 12:24:51,153 INFO L264 CegarLoopResult]: At program point L39(lines 20 46) the Hoare annotation is: false [2020-07-08 12:24:51,153 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-08 12:24:51,153 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-08 12:24:51,159 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:24:51,159 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:24:51,159 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2020-07-08 12:24:51,164 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:24:51,165 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:24:51,165 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:24:51,165 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2020-07-08 12:24:51,165 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:24:51,166 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:24:51,168 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:24:51,168 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:24:51,170 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:24:51,171 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:24:51,171 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:24:51,171 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:24:51,171 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:24:51,171 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:24:51,171 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:24:51,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:24:51 BoogieIcfgContainer [2020-07-08 12:24:51,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:24:51,183 INFO L168 Benchmark]: Toolchain (without parser) took 5300.25 ms. Allocated memory was 137.4 MB in the beginning and 283.6 MB in the end (delta: 146.3 MB). Free memory was 101.6 MB in the beginning and 243.2 MB in the end (delta: -141.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:24:51,184 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:24:51,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.45 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:24:51,185 INFO L168 Benchmark]: Boogie Preprocessor took 143.33 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:24:51,186 INFO L168 Benchmark]: RCFGBuilder took 553.59 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 151.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:24:51,187 INFO L168 Benchmark]: TraceAbstraction took 4314.66 ms. Allocated memory was 202.4 MB in the beginning and 283.6 MB in the end (delta: 81.3 MB). Free memory was 151.9 MB in the beginning and 243.2 MB in the end (delta: -91.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:24:51,190 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.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.45 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.33 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.59 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 151.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4314.66 ms. Allocated memory was 202.4 MB in the beginning and 283.6 MB in the end (delta: 81.3 MB). Free memory was 151.9 MB in the beginning and 243.2 MB in the end (delta: -91.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 20]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 34 SDslu, 88 SDs, 0 SdLazy, 239 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 103 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 7654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...