/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test28-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:07:09,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:07:09,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:07:09,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:07:09,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:07:09,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:07:09,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:07:09,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:07:09,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:07:09,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:07:09,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:07:09,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:07:09,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:07:09,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:07:09,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:07:09,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:07:09,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:07:09,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:07:09,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:07:09,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:07:09,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:07:09,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:07:09,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:07:09,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:07:09,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:07:09,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:07:09,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:07:09,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:07:09,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:07:09,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:07:09,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:07:09,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:07:09,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:07:09,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:07:09,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:07:09,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:07:09,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:07:09,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:07:09,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:07:09,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:07:09,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:07:09,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:07:09,727 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:07:09,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:07:09,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:07:09,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:07:09,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:07:09,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:07:09,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:07:09,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:07:09,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:07:09,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:07:09,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:07:09,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:07:09,731 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:07:09,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:07:09,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:07:09,731 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:07:09,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:07:09,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:07:09,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:07:09,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:07:09,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:07:09,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:07:09,733 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:07:10,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:07:10,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:07:10,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:07:10,047 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:07:10,048 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:07:10,049 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-11 01:07:10,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b80ceb1/0740aed152554befa87ece893ef0ac5a/FLAG9e1e34081 [2020-07-11 01:07:10,637 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:07:10,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-11 01:07:10,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b80ceb1/0740aed152554befa87ece893ef0ac5a/FLAG9e1e34081 [2020-07-11 01:07:10,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b80ceb1/0740aed152554befa87ece893ef0ac5a [2020-07-11 01:07:10,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:07:10,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:07:10,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:10,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:07:11,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:07:11,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:10" (1/1) ... [2020-07-11 01:07:11,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ef254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11, skipping insertion in model container [2020-07-11 01:07:11,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:10" (1/1) ... [2020-07-11 01:07:11,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:07:11,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:07:11,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:11,313 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:07:11,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:11,354 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:07:11,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11 WrapperNode [2020-07-11 01:07:11,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:11,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:07:11,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:07:11,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:07:11,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (1/1) ... [2020-07-11 01:07:11,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:07:11,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:07:11,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:07:11,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:07:11,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (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-11 01:07:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:07:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:07:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:07:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:07:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:07:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:07:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 01:07:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:07:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:07:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:07:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:07:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:07:11,961 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:07:11,961 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 01:07:11,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:11 BoogieIcfgContainer [2020-07-11 01:07:11,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:07:11,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:07:11,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:07:11,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:07:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:07:10" (1/3) ... [2020-07-11 01:07:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f9445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:11, skipping insertion in model container [2020-07-11 01:07:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:11" (2/3) ... [2020-07-11 01:07:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f9445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:11, skipping insertion in model container [2020-07-11 01:07:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:11" (3/3) ... [2020-07-11 01:07:11,975 INFO L109 eAbstractionObserver]: Analyzing ICFG test28-2.c [2020-07-11 01:07:11,989 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:07:11,998 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:07:12,012 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:07:12,036 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:07:12,037 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:07:12,037 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:07:12,037 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:07:12,037 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:07:12,037 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:07:12,038 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:07:12,038 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:07:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-11 01:07:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 01:07:12,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:12,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:12,072 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -374520961, now seen corresponding path program 1 times [2020-07-11 01:07:12,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:12,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786786955] [2020-07-11 01:07:12,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:12,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-11 01:07:12,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-11 01:07:12,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-11 01:07:12,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 01:07:12,325 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-11 01:07:12,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:12,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-11 01:07:12,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-11 01:07:12,332 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-11 01:07:12,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 01:07:12,333 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-11 01:07:12,333 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2020-07-11 01:07:12,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {48#true} is VALID [2020-07-11 01:07:12,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {48#true} is VALID [2020-07-11 01:07:12,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {48#true} is VALID [2020-07-11 01:07:12,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} ~n~0 := #t~nondet0; {48#true} is VALID [2020-07-11 01:07:12,336 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc #t~nondet0; {48#true} is VALID [2020-07-11 01:07:12,336 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} assume !(0 != ~n~0); {48#true} is VALID [2020-07-11 01:07:12,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {48#true} is VALID [2020-07-11 01:07:12,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-11 01:07:12,337 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#true} havoc #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-11 01:07:12,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#true} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {48#true} is VALID [2020-07-11 01:07:12,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#true} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {48#true} is VALID [2020-07-11 01:07:12,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#true} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {48#true} is VALID [2020-07-11 01:07:12,341 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#true} assume !#t~short3; {55#(not |main_#t~short3|)} is VALID [2020-07-11 01:07:12,342 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(not |main_#t~short3|)} assume #t~short3; {49#false} is VALID [2020-07-11 01:07:12,343 INFO L280 TraceCheckUtils]: 21: Hoare triple {49#false} havoc #t~short3; {49#false} is VALID [2020-07-11 01:07:12,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} havoc #t~mem2; {49#false} is VALID [2020-07-11 01:07:12,344 INFO L280 TraceCheckUtils]: 23: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-11 01:07:12,347 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-11 01:07:12,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786786955] [2020-07-11 01:07:12,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:12,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:07:12,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998232207] [2020-07-11 01:07:12,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:07:12,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:12,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:07:12,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:07:12,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:12,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:07:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:07:12,429 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-11 01:07:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:12,694 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-11 01:07:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:07:12,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:07:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-11 01:07:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-11 01:07:12,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-11 01:07:12,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:12,815 INFO L225 Difference]: With dead ends: 54 [2020-07-11 01:07:12,815 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 01:07:12,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:07:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 01:07:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-11 01:07:12,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:12,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:12,898 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:12,898 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:12,902 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 01:07:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:12,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:12,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:12,903 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:12,904 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:12,907 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 01:07:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:12,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:12,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:12,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:12,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-11 01:07:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-11 01:07:12,913 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-07-11 01:07:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:12,914 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-11 01:07:12,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:07:12,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2020-07-11 01:07:12,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:12,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:12,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:12,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:07:12,962 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1400624444, now seen corresponding path program 1 times [2020-07-11 01:07:12,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:12,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485652539] [2020-07-11 01:07:12,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:13,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-11 01:07:13,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-11 01:07:13,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-11 01:07:13,108 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-11 01:07:13,109 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-11 01:07:13,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:13,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-11 01:07:13,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-11 01:07:13,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-11 01:07:13,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-11 01:07:13,112 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-11 01:07:13,112 INFO L263 TraceCheckUtils]: 6: Hoare triple {283#true} call #t~ret4 := main(); {283#true} is VALID [2020-07-11 01:07:13,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {290#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-11 01:07:13,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {290#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:13,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:13,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:13,117 INFO L280 TraceCheckUtils]: 11: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:13,118 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume !(0 != ~n~0); {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:13,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {292#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} is VALID [2020-07-11 01:07:13,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:13,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:13,122 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {284#false} is VALID [2020-07-11 01:07:13,122 INFO L280 TraceCheckUtils]: 17: Hoare triple {284#false} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {284#false} is VALID [2020-07-11 01:07:13,122 INFO L280 TraceCheckUtils]: 18: Hoare triple {284#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {284#false} is VALID [2020-07-11 01:07:13,123 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-11 01:07:13,123 INFO L280 TraceCheckUtils]: 20: Hoare triple {284#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {284#false} is VALID [2020-07-11 01:07:13,123 INFO L280 TraceCheckUtils]: 21: Hoare triple {284#false} #t~short3 := 0 != #t~mem2; {284#false} is VALID [2020-07-11 01:07:13,124 INFO L280 TraceCheckUtils]: 22: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-11 01:07:13,124 INFO L280 TraceCheckUtils]: 23: Hoare triple {284#false} havoc #t~short3; {284#false} is VALID [2020-07-11 01:07:13,124 INFO L280 TraceCheckUtils]: 24: Hoare triple {284#false} havoc #t~mem2; {284#false} is VALID [2020-07-11 01:07:13,124 INFO L280 TraceCheckUtils]: 25: Hoare triple {284#false} assume !false; {284#false} is VALID [2020-07-11 01:07:13,126 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-11 01:07:13,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485652539] [2020-07-11 01:07:13,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:13,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:07:13,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487588435] [2020-07-11 01:07:13,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-11 01:07:13,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:13,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:07:13,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:13,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:07:13,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:07:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:07:13,168 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-11 01:07:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:13,569 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2020-07-11 01:07:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:07:13,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-11 01:07:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-11 01:07:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-11 01:07:13,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-11 01:07:13,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:13,649 INFO L225 Difference]: With dead ends: 52 [2020-07-11 01:07:13,649 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 01:07:13,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:07:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 01:07:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-07-11 01:07:13,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:13,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:13,716 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:13,716 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:13,720 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 01:07:13,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:13,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:13,722 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2020-07-11 01:07:13,722 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2020-07-11 01:07:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:13,725 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 01:07:13,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:13,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:13,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:13,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 01:07:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 01:07:13,729 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2020-07-11 01:07:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:13,730 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 01:07:13,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:07:13,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 01:07:13,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 01:07:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:13,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:13,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:13,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:07:13,785 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -316312164, now seen corresponding path program 1 times [2020-07-11 01:07:13,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:13,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1318272524] [2020-07-11 01:07:13,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-11 01:07:14,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-11 01:07:14,067 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-11 01:07:14,067 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-11 01:07:14,067 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-11 01:07:14,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:14,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-11 01:07:14,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-11 01:07:14,070 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-11 01:07:14,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-11 01:07:14,071 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-11 01:07:14,071 INFO L263 TraceCheckUtils]: 6: Hoare triple {557#true} call #t~ret4 := main(); {557#true} is VALID [2020-07-11 01:07:14,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {557#true} is VALID [2020-07-11 01:07:14,072 INFO L280 TraceCheckUtils]: 8: Hoare triple {557#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-11 01:07:14,073 INFO L280 TraceCheckUtils]: 9: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-11 01:07:14,074 INFO L280 TraceCheckUtils]: 10: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} ~n~0 := #t~nondet0; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-11 01:07:14,075 INFO L280 TraceCheckUtils]: 11: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} havoc #t~nondet0; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-11 01:07:14,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} assume !(0 != ~n~0); {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-11 01:07:14,076 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {565#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} is VALID [2020-07-11 01:07:14,077 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,079 INFO L280 TraceCheckUtils]: 16: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,080 INFO L280 TraceCheckUtils]: 17: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); srcloc: L18 {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-11 01:07:14,081 INFO L280 TraceCheckUtils]: 18: Hoare triple {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-11 01:07:14,082 INFO L280 TraceCheckUtils]: 19: Hoare triple {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} assume #t~short3; {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-11 01:07:14,083 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {568#(= 0 |main_#t~mem2|)} is VALID [2020-07-11 01:07:14,083 INFO L280 TraceCheckUtils]: 21: Hoare triple {568#(= 0 |main_#t~mem2|)} #t~short3 := 0 != #t~mem2; {569#(not |main_#t~short3|)} is VALID [2020-07-11 01:07:14,084 INFO L280 TraceCheckUtils]: 22: Hoare triple {569#(not |main_#t~short3|)} assume #t~short3; {558#false} is VALID [2020-07-11 01:07:14,085 INFO L280 TraceCheckUtils]: 23: Hoare triple {558#false} havoc #t~short3; {558#false} is VALID [2020-07-11 01:07:14,085 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} havoc #t~mem2; {558#false} is VALID [2020-07-11 01:07:14,085 INFO L280 TraceCheckUtils]: 25: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-11 01:07:14,087 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-11 01:07:14,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1318272524] [2020-07-11 01:07:14,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:14,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 01:07:14,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885522044] [2020-07-11 01:07:14,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-11 01:07:14,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:14,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 01:07:14,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:14,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 01:07:14,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:14,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 01:07:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:07:14,121 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2020-07-11 01:07:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:14,619 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:07:14,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-11 01:07:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:07:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-11 01:07:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:07:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-11 01:07:14,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-11 01:07:14,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:14,670 INFO L225 Difference]: With dead ends: 42 [2020-07-11 01:07:14,670 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 01:07:14,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-07-11 01:07:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 01:07:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 01:07:14,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:14,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:14,719 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:14,719 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:14,721 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:14,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:14,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:14,722 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:14,723 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:14,724 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:14,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:14,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:14,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:14,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 01:07:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-11 01:07:14,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2020-07-11 01:07:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:14,728 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-11 01:07:14,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 01:07:14,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-11 01:07:14,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:14,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:14,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:14,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:07:14,763 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash -497457956, now seen corresponding path program 1 times [2020-07-11 01:07:14,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:14,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615157497] [2020-07-11 01:07:14,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {779#true} is VALID [2020-07-11 01:07:14,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {779#true} #valid := #valid[0 := 0]; {779#true} is VALID [2020-07-11 01:07:14,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {779#true} assume 0 < #StackHeapBarrier; {779#true} is VALID [2020-07-11 01:07:14,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {779#true} assume true; {779#true} is VALID [2020-07-11 01:07:14,929 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {779#true} {779#true} #62#return; {779#true} is VALID [2020-07-11 01:07:14,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {779#true} call ULTIMATE.init(); {791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:14,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {779#true} is VALID [2020-07-11 01:07:14,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {779#true} #valid := #valid[0 := 0]; {779#true} is VALID [2020-07-11 01:07:14,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {779#true} assume 0 < #StackHeapBarrier; {779#true} is VALID [2020-07-11 01:07:14,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#true} assume true; {779#true} is VALID [2020-07-11 01:07:14,935 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {779#true} {779#true} #62#return; {779#true} is VALID [2020-07-11 01:07:14,935 INFO L263 TraceCheckUtils]: 6: Hoare triple {779#true} call #t~ret4 := main(); {779#true} is VALID [2020-07-11 01:07:14,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {779#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {786#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-11 01:07:14,937 INFO L280 TraceCheckUtils]: 8: Hoare triple {786#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0; {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {787#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {788#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {788#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,949 INFO L280 TraceCheckUtils]: 16: Hoare triple {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:14,951 INFO L280 TraceCheckUtils]: 18: Hoare triple {789#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {790#(not |main_#t~short3|)} is VALID [2020-07-11 01:07:14,952 INFO L280 TraceCheckUtils]: 19: Hoare triple {790#(not |main_#t~short3|)} assume #t~short3; {780#false} is VALID [2020-07-11 01:07:14,952 INFO L280 TraceCheckUtils]: 20: Hoare triple {780#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {780#false} is VALID [2020-07-11 01:07:14,952 INFO L280 TraceCheckUtils]: 21: Hoare triple {780#false} #t~short3 := 0 != #t~mem2; {780#false} is VALID [2020-07-11 01:07:14,952 INFO L280 TraceCheckUtils]: 22: Hoare triple {780#false} assume #t~short3; {780#false} is VALID [2020-07-11 01:07:14,952 INFO L280 TraceCheckUtils]: 23: Hoare triple {780#false} havoc #t~short3; {780#false} is VALID [2020-07-11 01:07:14,953 INFO L280 TraceCheckUtils]: 24: Hoare triple {780#false} havoc #t~mem2; {780#false} is VALID [2020-07-11 01:07:14,953 INFO L280 TraceCheckUtils]: 25: Hoare triple {780#false} assume !false; {780#false} is VALID [2020-07-11 01:07:14,954 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-11 01:07:14,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615157497] [2020-07-11 01:07:14,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:14,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:07:14,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421679851] [2020-07-11 01:07:14,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:14,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:14,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:07:15,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:07:15,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:07:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:07:15,006 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2020-07-11 01:07:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,295 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 01:07:15,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-11 01:07:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-11 01:07:15,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-11 01:07:15,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,340 INFO L225 Difference]: With dead ends: 28 [2020-07-11 01:07:15,340 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:07:15,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-11 01:07:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:07:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:07:15,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:15,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:15,343 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:15,343 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,343 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:07:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:15,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:15,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:15,344 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:15,344 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,345 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:07:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:15,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:15,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:15,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:15,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:07:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:07:15,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-11 01:07:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:15,346 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:07:15,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:07:15,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:07:15,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:15,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:15,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:07:15,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:07:15,943 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,943 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-11 01:07:15,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:07:15,946 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-07-11 01:07:15,947 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 10 28) the Hoare annotation is: true [2020-07-11 01:07:15,947 INFO L264 CegarLoopResult]: At program point L15(lines 15 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~pd~0.base |main_~#d2~0.base|))))) [2020-07-11 01:07:15,947 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 01:07:15,947 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse3 (= main_~pd~0.base |main_~#d2~0.base|)) (.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 .cse2 (not |main_#t~short3|) (not .cse3)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) .cse3 .cse0 .cse1 .cse2))) [2020-07-11 01:07:15,948 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= 0 |main_#t~mem2|) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|)) (not (= main_~pd~0.base |main_~#d2~0.base|))) [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L20-4(lines 20 22) the Hoare annotation is: (not |main_#t~short3|) [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: false [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: false [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L20-7(line 20) the Hoare annotation is: (not |main_#t~short3|) [2020-07-11 01:07:15,949 INFO L264 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (= 1 (select |#valid| |main_~#d1~0.base|)) [2020-07-11 01:07:15,949 INFO L271 CegarLoopResult]: At program point L20-8(line 20) the Hoare annotation is: true [2020-07-11 01:07:15,950 INFO L264 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,953 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 01:07:15,953 INFO L271 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-07-11 01:07:15,953 INFO L271 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: true [2020-07-11 01:07:15,953 INFO L271 CegarLoopResult]: At program point L12-5(line 12) the Hoare annotation is: true [2020-07-11 01:07:15,953 INFO L264 CegarLoopResult]: At program point L12-6(line 12) the Hoare annotation is: false [2020-07-11 01:07:15,953 INFO L264 CegarLoopResult]: At program point L12-7(line 12) the Hoare annotation is: false [2020-07-11 01:07:15,953 INFO L264 CegarLoopResult]: At program point L12-8(line 12) the Hoare annotation is: false [2020-07-11 01:07:15,953 INFO L264 CegarLoopResult]: At program point L12-9(line 12) the Hoare annotation is: false [2020-07-11 01:07:15,953 INFO L264 CegarLoopResult]: At program point L21(lines 11 28) the Hoare annotation is: false [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,954 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 10 28) the Hoare annotation is: true [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 28) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~pd~0.base |main_~#d2~0.base|))))) [2020-07-11 01:07:15,954 INFO L264 CegarLoopResult]: At program point L18-1(lines 15 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 .cse2 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) .cse0 .cse1 .cse2))) [2020-07-11 01:07:15,955 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,955 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,955 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-11 01:07:15,955 INFO L264 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 (= |main_#t~ite1.offset| 0) .cse2) (and .cse0 .cse1 .cse2 (not (= |main_#t~ite1.base| |main_~#d2~0.base|))))) [2020-07-11 01:07:15,955 INFO L264 CegarLoopResult]: At program point L14-5(line 14) the Hoare annotation is: (let ((.cse3 (= main_~pd~0.base |main_~#d2~0.base|)) (.cse2 (= |main_#t~ite1.base| |main_~#d2~0.base|)) (.cse0 (= 0 |main_~#d2~0.offset|)) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) .cse0 .cse1 (not .cse2) (not .cse3)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse3 .cse2 .cse0 (= |main_#t~ite1.offset| 0) .cse1 (not (= |main_~#d1~0.base| |main_#t~ite1.base|))))) [2020-07-11 01:07:15,975 INFO L163 areAnnotationChecker]: CFG has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:07:15,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:07:15 BoogieIcfgContainer [2020-07-11 01:07:15,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:07:15,989 INFO L168 Benchmark]: Toolchain (without parser) took 4997.31 ms. Allocated memory was 142.1 MB in the beginning and 292.6 MB in the end (delta: 150.5 MB). Free memory was 100.4 MB in the beginning and 245.1 MB in the end (delta: -144.8 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,990 INFO L168 Benchmark]: CDTParser took 1.71 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.38 ms. Allocated memory is still 142.1 MB. Free memory was 100.2 MB in the beginning and 90.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,992 INFO L168 Benchmark]: Boogie Preprocessor took 137.61 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 90.0 MB in the beginning and 177.7 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,993 INFO L168 Benchmark]: RCFGBuilder took 472.81 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 155.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,994 INFO L168 Benchmark]: TraceAbstraction took 4018.48 ms. Allocated memory was 199.8 MB in the beginning and 292.6 MB in the end (delta: 92.8 MB). Free memory was 154.4 MB in the beginning and 245.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:15,997 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 1.71 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.38 ms. Allocated memory is still 142.1 MB. Free memory was 100.2 MB in the beginning and 90.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.61 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 90.0 MB in the beginning and 177.7 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 472.81 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 155.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4018.48 ms. Allocated memory was 199.8 MB in the beginning and 292.6 MB in the end (delta: 92.8 MB). Free memory was 154.4 MB in the beginning and 245.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: 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: 11]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 10]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 94 SDtfs, 132 SDslu, 245 SDs, 0 SdLazy, 230 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 62 NumberOfFragments, 441 HoareAnnotationTreeSize, 45 FomulaSimplifications, 211 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 6484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...