java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:37,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:37,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:37,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:37,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:37,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:37,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:37,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:37,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:37,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:37,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:37,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:37,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:37,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:37,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:37,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:37,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:37,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:37,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:37,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:37,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:37,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:37,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:37,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:37,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:37,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:37,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:37,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:37,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:37,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:37,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:37,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:37,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:37,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:37,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:37,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:37,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:37,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:37,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:37,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:37,648 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:37,649 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:37,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:37,649 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:37,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:37,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:37,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:37,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:37,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:37,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:37,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:37,651 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:37,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:37,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:37,651 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:37,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:37,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:37,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:37,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:37,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:37,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:37,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:37,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:37,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:37,653 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:37,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:37,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:37,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:37,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:37,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:37,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:37,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:37,724 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:37,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-23 13:00:37,790 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b22142/bc52cba2205b4404a3a7054bafa562b5/FLAGc11a558df [2018-11-23 13:00:38,332 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:38,333 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-23 13:00:38,346 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b22142/bc52cba2205b4404a3a7054bafa562b5/FLAGc11a558df [2018-11-23 13:00:38,620 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056b22142/bc52cba2205b4404a3a7054bafa562b5 [2018-11-23 13:00:38,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:38,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:38,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:38,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:38,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:38,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca4da25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38, skipping insertion in model container [2018-11-23 13:00:38,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:38,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:39,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:39,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:39,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:39,379 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:39,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39 WrapperNode [2018-11-23 13:00:39,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:39,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:39,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:39,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:39,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:39,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:39,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:39,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:39,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:39,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:39,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:39,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:39,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (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 [2018-11-23 13:00:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:40,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:40,264 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:00:40,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:40 BoogieIcfgContainer [2018-11-23 13:00:40,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:40,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:40,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:40,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:40,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:38" (1/3) ... [2018-11-23 13:00:40,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ead77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:40, skipping insertion in model container [2018-11-23 13:00:40,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (2/3) ... [2018-11-23 13:00:40,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ead77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:40, skipping insertion in model container [2018-11-23 13:00:40,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:40" (3/3) ... [2018-11-23 13:00:40,274 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example_true-unreach-call.i [2018-11-23 13:00:40,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:40,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:40,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:40,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:40,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:40,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:40,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:40,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:40,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:40,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:40,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:40,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:00:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:00:40,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:40,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:40,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:40,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2141770508, now seen corresponding path program 1 times [2018-11-23 13:00:40,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:40,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:40,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 13:00:40,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-23 13:00:40,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 13:00:40,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #70#return; {26#true} is VALID [2018-11-23 13:00:40,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret14 := main(); {26#true} is VALID [2018-11-23 13:00:40,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {26#true} is VALID [2018-11-23 13:00:40,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 13:00:40,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {27#false} is VALID [2018-11-23 13:00:40,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {27#false} is VALID [2018-11-23 13:00:40,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {27#false} is VALID [2018-11-23 13:00:40,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {27#false} is VALID [2018-11-23 13:00:40,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 13:00:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:40,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:00:40,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:40,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:40,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:40,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:40,781 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 13:00:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,093 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2018-11-23 13:00:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:41,094 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:00:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-23 13:00:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-23 13:00:41,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2018-11-23 13:00:41,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:41,467 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:00:41,467 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:00:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:00:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:00:41,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:41,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:00:41,594 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:00:41,595 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:00:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,598 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-23 13:00:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-11-23 13:00:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:00:41,600 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:00:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,604 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-23 13:00:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-11-23 13:00:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:41,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:00:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 13:00:41,610 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2018-11-23 13:00:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:41,610 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 13:00:41,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-11-23 13:00:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:00:41,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:41,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:41,612 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1852894742, now seen corresponding path program 1 times [2018-11-23 13:00:41,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:41,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2018-11-23 13:00:41,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {134#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {134#true} is VALID [2018-11-23 13:00:41,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2018-11-23 13:00:41,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #70#return; {134#true} is VALID [2018-11-23 13:00:41,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret14 := main(); {134#true} is VALID [2018-11-23 13:00:41,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {134#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:41,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:41,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:41,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:41,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {137#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:41,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {138#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:41,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {138#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {139#|main_#t~short9|} is VALID [2018-11-23 13:00:41,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {139#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {135#false} is VALID [2018-11-23 13:00:41,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {135#false} assume !false; {135#false} is VALID [2018-11-23 13:00:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:41,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:41,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:00:41,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:00:41,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:41,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:42,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:42,003 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 6 states. [2018-11-23 13:00:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,820 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2018-11-23 13:00:42,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:42,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:00:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 13:00:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 13:00:42,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 13:00:42,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,956 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:00:42,956 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:00:42,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:00:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 13:00:42,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 13:00:42,993 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 13:00:42,993 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 13:00:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,997 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-23 13:00:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-23 13:00:42,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,998 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 13:00:42,998 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 13:00:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:43,002 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-23 13:00:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-23 13:00:43,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:43,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:43,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:43,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:00:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 13:00:43,006 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2018-11-23 13:00:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:43,007 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 13:00:43,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 13:00:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:00:43,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:43,009 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:43,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:43,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1431469916, now seen corresponding path program 1 times [2018-11-23 13:00:43,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:43,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:43,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 13:00:43,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {299#true} is VALID [2018-11-23 13:00:43,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 13:00:43,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #70#return; {299#true} is VALID [2018-11-23 13:00:43,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret14 := main(); {299#true} is VALID [2018-11-23 13:00:43,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:43,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} goto; {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:43,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:43,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:43,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {301#(and (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:43,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:43,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:43,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:43,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {303#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:43,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {303#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {304#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:43,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {304#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {305#|main_#t~short9|} is VALID [2018-11-23 13:00:43,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {305#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {300#false} is VALID [2018-11-23 13:00:43,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 13:00:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:43,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:43,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:43,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:43,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:43,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:00:43,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:43,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:00:43,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:00:43,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:43,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:43,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:43,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-11-23 13:00:43,635 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:43,636 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, |v_#valid_11|]. (and (= main_~list~0.offset 0) (= |#valid| (store |v_#valid_11| main_~list~0.base 1)) (= (store |v_#memory_int_20| main_~list~0.base (store (select |v_#memory_int_20| main_~list~0.base) main_~list~0.offset 10)) |#memory_int|) (= main_~tail~0.base main_~list~0.base) (<= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 13:00:43,636 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= main_~tail~0.base main_~list~0.base) (<= main_~list~0.offset main_~tail~0.offset) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))) [2018-11-23 13:00:43,961 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 13:00:44,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:44,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:44,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 13:00:44,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:44,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:44,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:00:44,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:44,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 13:00:44,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-23 13:00:44,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:00:44,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:44,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:00:44,327 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,336 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,347 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,389 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:73, output treesize:11 [2018-11-23 13:00:44,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:44,396 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, |main_#t~malloc5.base|, main_~p~0.offset, main_~x~0, |v_#valid_12|, |v_#memory_int_21|, v_main_~tail~0.offset_4, |v_#memory_int_23|]. (let ((.cse3 (select |v_#memory_int_22| |main_#t~malloc5.base|)) (.cse0 (select |v_#memory_int_23| main_~list~0.base))) (and (= 1 (select |v_#valid_12| main_~list~0.base)) (= main_~list~0.offset 0) (= (store |v_#memory_int_23| main_~list~0.base (let ((.cse1 (+ v_main_~tail~0.offset_4 4))) (store .cse0 .cse1 (select (select |v_#memory_int_21| main_~list~0.base) .cse1)))) |v_#memory_int_21|) (= (store |v_#memory_int_21| |main_#t~malloc5.base| (let ((.cse2 (+ main_~p~0.offset 4))) (store (select |v_#memory_int_21| |main_#t~malloc5.base|) .cse2 (select .cse3 .cse2)))) |v_#memory_int_22|) (= (store |v_#memory_int_22| |main_#t~malloc5.base| (store .cse3 main_~p~0.offset main_~x~0)) |#memory_int|) (= (select |v_#valid_12| |main_#t~malloc5.base|) 0) (= (select .cse0 main_~list~0.offset) 10) (<= main_~list~0.offset v_main_~tail~0.offset_4))) [2018-11-23 13:00:44,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))) [2018-11-23 13:00:44,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 13:00:44,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {299#true} is VALID [2018-11-23 13:00:44,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 13:00:44,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #70#return; {299#true} is VALID [2018-11-23 13:00:44,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret14 := main(); {299#true} is VALID [2018-11-23 13:00:44,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} goto; {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {324#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} goto; {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:00:44,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {337#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {350#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2018-11-23 13:00:44,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {350#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2018-11-23 13:00:44,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {305#|main_#t~short9|} is VALID [2018-11-23 13:00:44,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {305#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {300#false} is VALID [2018-11-23 13:00:44,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 13:00:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:44,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-11-23 13:00:44,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:00:44,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:44,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:00:44,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:44,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:00:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:00:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:00:44,658 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2018-11-23 13:00:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,728 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2018-11-23 13:00:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:00:45,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:00:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:00:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 13:00:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:00:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 13:00:45,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2018-11-23 13:00:45,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:45,850 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:00:45,850 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:00:45,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:00:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:00:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-11-23 13:00:45,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:45,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 31 states. [2018-11-23 13:00:45,898 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 31 states. [2018-11-23 13:00:45,898 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 31 states. [2018-11-23 13:00:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,901 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-23 13:00:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2018-11-23 13:00:45,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:45,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:45,903 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 43 states. [2018-11-23 13:00:45,903 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 43 states. [2018-11-23 13:00:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:45,906 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-23 13:00:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2018-11-23 13:00:45,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:45,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:45,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:45,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:00:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-11-23 13:00:45,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2018-11-23 13:00:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:45,911 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-23 13:00:45,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:00:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-11-23 13:00:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:00:45,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:45,912 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:45,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:45,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2114294943, now seen corresponding path program 1 times [2018-11-23 13:00:45,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:45,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:45,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:46,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2018-11-23 13:00:46,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {567#true} is VALID [2018-11-23 13:00:46,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2018-11-23 13:00:46,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #70#return; {567#true} is VALID [2018-11-23 13:00:46,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret14 := main(); {567#true} is VALID [2018-11-23 13:00:46,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:46,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:46,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:46,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet3);havoc #t~nondet3; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:46,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:00:46,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {570#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {571#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 13:00:46,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {568#false} is VALID [2018-11-23 13:00:46,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {568#false} is VALID [2018-11-23 13:00:46,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {568#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {568#false} is VALID [2018-11-23 13:00:46,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#false} assume !false; {568#false} is VALID [2018-11-23 13:00:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:46,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:46,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:46,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:46,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:46,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-23 13:00:46,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:00:46,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:46,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:00:46,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-23 13:00:46,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:00:46,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:46,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:00:46,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2018-11-23 13:00:48,817 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:48,818 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_15|]. (let ((.cse0 (+ main_~list~0.offset 4))) (and (= main_~list~0.offset 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_15| main_~list~0.base (store (store (select |v_#memory_$Pointer$.base_15| main_~list~0.base) .cse0 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_15| main_~list~0.base (store (store (select |v_#memory_$Pointer$.offset_15| main_~list~0.base) .cse0 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))))) [2018-11-23 13:00:48,818 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (+ main_~list~0.offset 4))) (and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse0) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse0) 0))) [2018-11-23 13:00:48,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 13:00:48,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 13:00:48,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 13:00:48,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 13:00:49,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2018-11-23 13:00:49,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:00:49,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:00:49,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:00:49,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:00:49,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:49,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 13:00:49,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:49,263 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4))) (and (= .cse0 0) (= 0 .cse1) (= main_~p~0.base .cse1) (= .cse0 main_~p~0.offset))) [2018-11-23 13:00:49,263 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 13:00:49,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2018-11-23 13:00:49,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {567#true} is VALID [2018-11-23 13:00:49,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2018-11-23 13:00:49,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #70#return; {567#true} is VALID [2018-11-23 13:00:49,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret14 := main(); {567#true} is VALID [2018-11-23 13:00:49,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:49,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:49,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:49,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet3);havoc #t~nondet3; {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-23 13:00:49,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {569#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-23 13:00:49,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {602#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {571#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 13:00:49,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {568#false} is VALID [2018-11-23 13:00:49,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {568#false} is VALID [2018-11-23 13:00:49,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {568#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {568#false} is VALID [2018-11-23 13:00:49,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#false} assume !false; {568#false} is VALID [2018-11-23 13:00:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:49,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:49,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:00:49,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:00:49,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:49,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:49,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:49,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:49,388 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 6 states. [2018-11-23 13:00:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,094 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2018-11-23 13:00:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:50,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:00:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 13:00:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 13:00:50,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2018-11-23 13:00:50,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:50,214 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:00:50,214 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:00:50,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:00:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:00:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-23 13:00:50,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:50,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 43 states. [2018-11-23 13:00:50,322 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 43 states. [2018-11-23 13:00:50,323 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 43 states. [2018-11-23 13:00:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,327 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-11-23 13:00:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 13:00:50,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:50,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:50,328 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 49 states. [2018-11-23 13:00:50,328 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 49 states. [2018-11-23 13:00:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,331 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-11-23 13:00:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 13:00:50,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:50,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:50,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:50,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:00:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-11-23 13:00:50,337 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2018-11-23 13:00:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:50,337 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-23 13:00:50,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-11-23 13:00:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:00:50,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:50,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:50,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:50,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash 250218873, now seen corresponding path program 1 times [2018-11-23 13:00:50,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:50,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:50,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2018-11-23 13:00:50,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {868#true} is VALID [2018-11-23 13:00:50,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2018-11-23 13:00:50,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #70#return; {868#true} is VALID [2018-11-23 13:00:50,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret14 := main(); {868#true} is VALID [2018-11-23 13:00:50,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {868#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {868#true} is VALID [2018-11-23 13:00:50,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#true} goto; {868#true} is VALID [2018-11-23 13:00:50,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {868#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {868#true} is VALID [2018-11-23 13:00:50,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {868#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {868#true} is VALID [2018-11-23 13:00:50,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {868#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:50,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:50,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {871#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} is VALID [2018-11-23 13:00:50,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:50,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:50,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {873#(and (= main_~p~0.offset main_~list~0.offset) (<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:50,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {873#(and (= main_~p~0.offset main_~list~0.offset) (<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:50,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:50,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:50,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:50,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {876#|main_#t~short9|} is VALID [2018-11-23 13:00:50,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {869#false} is VALID [2018-11-23 13:00:50,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {869#false} assume !false; {869#false} is VALID [2018-11-23 13:00:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:50,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:50,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:50,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:50,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:50,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:50,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 13:00:50,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:50,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 13:00:50,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:50,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:50,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:50,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-23 13:00:52,882 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:52,882 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| main_~list~0.base))) (let ((.cse1 (select .cse0 main_~list~0.offset))) (and (= (store |v_#memory_int_24| main_~list~0.base (store .cse0 main_~list~0.offset (+ .cse1 1))) |#memory_int|) (<= 10 .cse1)))) [2018-11-23 13:00:52,882 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) [2018-11-23 13:00:52,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2018-11-23 13:00:52,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {868#true} is VALID [2018-11-23 13:00:52,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2018-11-23 13:00:52,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #70#return; {868#true} is VALID [2018-11-23 13:00:52,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret14 := main(); {868#true} is VALID [2018-11-23 13:00:52,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {868#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {868#true} is VALID [2018-11-23 13:00:52,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#true} goto; {868#true} is VALID [2018-11-23 13:00:52,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {868#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {868#true} is VALID [2018-11-23 13:00:52,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {868#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {868#true} is VALID [2018-11-23 13:00:52,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {868#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:53,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:53,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {870#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {871#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} is VALID [2018-11-23 13:00:53,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:53,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:00:53,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {872#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:53,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:53,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:53,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {874#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:53,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:53,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {875#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {876#|main_#t~short9|} is VALID [2018-11-23 13:00:53,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {869#false} is VALID [2018-11-23 13:00:53,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {869#false} assume !false; {869#false} is VALID [2018-11-23 13:00:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-23 13:00:53,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:00:53,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:53,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:00:53,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:53,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:00:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:00:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:00:53,102 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 9 states. [2018-11-23 13:00:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,111 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-11-23 13:00:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:54,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:00:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 13:00:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 13:00:54,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2018-11-23 13:00:54,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:54,272 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:00:54,272 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 13:00:54,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:00:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 13:00:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-23 13:00:54,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:54,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 58 states. [2018-11-23 13:00:54,372 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 58 states. [2018-11-23 13:00:54,372 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 58 states. [2018-11-23 13:00:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,377 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2018-11-23 13:00:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2018-11-23 13:00:54,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:54,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:54,378 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 84 states. [2018-11-23 13:00:54,378 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 84 states. [2018-11-23 13:00:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,383 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2018-11-23 13:00:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2018-11-23 13:00:54,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:54,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:54,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:54,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:00:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2018-11-23 13:00:54,387 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 22 [2018-11-23 13:00:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:54,387 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2018-11-23 13:00:54,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:00:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2018-11-23 13:00:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:00:54,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:54,389 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:54,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:54,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash 250220795, now seen corresponding path program 1 times [2018-11-23 13:00:54,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:54,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {1296#true} call ULTIMATE.init(); {1296#true} is VALID [2018-11-23 13:00:54,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {1296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1296#true} is VALID [2018-11-23 13:00:54,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {1296#true} assume true; {1296#true} is VALID [2018-11-23 13:00:54,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1296#true} {1296#true} #70#return; {1296#true} is VALID [2018-11-23 13:00:54,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {1296#true} call #t~ret14 := main(); {1296#true} is VALID [2018-11-23 13:00:54,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {1296#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:54,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:54,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:54,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:54,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:54,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-23 13:00:54,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-23 13:00:54,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-23 13:00:54,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-23 13:00:54,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {1300#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {1301#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11))} is VALID [2018-11-23 13:00:54,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {1301#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1302#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-23 13:00:54,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {1302#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1302#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-23 13:00:54,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {1302#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1303#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} is VALID [2018-11-23 13:00:54,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {1303#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1304#|main_#t~short9|} is VALID [2018-11-23 13:00:54,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#|main_#t~short9|} assume !#t~short9; {1297#false} is VALID [2018-11-23 13:00:54,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {1297#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1297#false} is VALID [2018-11-23 13:00:54,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {1297#false} assume !false; {1297#false} is VALID [2018-11-23 13:00:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:54,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:54,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:54,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:54,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:54,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:00:54,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:00:54,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 13:00:54,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:54,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 13:00:54,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:54,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 13:00:54,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:54,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-23 13:00:56,966 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:56,966 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|]. (let ((.cse0 (select |v_#memory_int_26| main_~list~0.base))) (let ((.cse1 (select .cse0 main_~list~0.offset))) (and (= (store |v_#memory_int_26| main_~list~0.base (store .cse0 main_~list~0.offset (+ .cse1 1))) |#memory_int|) (= .cse1 10)))) [2018-11-23 13:00:56,966 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) [2018-11-23 13:00:57,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {1296#true} call ULTIMATE.init(); {1296#true} is VALID [2018-11-23 13:00:57,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {1296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1296#true} is VALID [2018-11-23 13:00:57,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {1296#true} assume true; {1296#true} is VALID [2018-11-23 13:00:57,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1296#true} {1296#true} #70#return; {1296#true} is VALID [2018-11-23 13:00:57,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {1296#true} call #t~ret14 := main(); {1296#true} is VALID [2018-11-23 13:00:57,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {1296#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {1298#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:57,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:57,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:57,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:57,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 13:00:57,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {1299#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:57,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {1350#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1360#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:57,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {1360#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1304#|main_#t~short9|} is VALID [2018-11-23 13:00:57,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#|main_#t~short9|} assume !#t~short9; {1297#false} is VALID [2018-11-23 13:00:57,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {1297#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1297#false} is VALID [2018-11-23 13:00:57,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {1297#false} assume !false; {1297#false} is VALID [2018-11-23 13:00:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:57,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-11-23 13:00:57,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 13:00:57,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:57,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:00:57,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:57,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:00:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:00:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:00:57,159 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand 11 states. [2018-11-23 13:00:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,200 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2018-11-23 13:00:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:00:58,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 13:00:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:00:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-23 13:00:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:00:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-23 13:00:58,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-23 13:00:58,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:58,370 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:00:58,370 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:00:58,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:00:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:00:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-11-23 13:00:58,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:58,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 75 states. [2018-11-23 13:00:58,490 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 75 states. [2018-11-23 13:00:58,490 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 75 states. [2018-11-23 13:00:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,494 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-11-23 13:00:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2018-11-23 13:00:58,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:58,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:58,495 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 82 states. [2018-11-23 13:00:58,495 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 82 states. [2018-11-23 13:00:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,499 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-11-23 13:00:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2018-11-23 13:00:58,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:58,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:58,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:58,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:00:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2018-11-23 13:00:58,503 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 22 [2018-11-23 13:00:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:58,503 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-11-23 13:00:58,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:00:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2018-11-23 13:00:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:00:58,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:58,504 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:58,505 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:58,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash -559127753, now seen corresponding path program 1 times [2018-11-23 13:00:58,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:58,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:58,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {1769#true} call ULTIMATE.init(); {1769#true} is VALID [2018-11-23 13:00:58,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {1769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1769#true} is VALID [2018-11-23 13:00:58,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {1769#true} assume true; {1769#true} is VALID [2018-11-23 13:00:58,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1769#true} {1769#true} #70#return; {1769#true} is VALID [2018-11-23 13:00:58,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {1769#true} call #t~ret14 := main(); {1769#true} is VALID [2018-11-23 13:00:58,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {1769#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:58,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:58,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:58,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:58,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {1771#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1772#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:58,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {1772#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} is VALID [2018-11-23 13:00:58,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} is VALID [2018-11-23 13:00:58,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} is VALID [2018-11-23 13:00:58,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {1773#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10)} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {1774#(<= |main_#t~mem10| 10)} is VALID [2018-11-23 13:00:58,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {1774#(<= |main_#t~mem10| 10)} assume !(#t~mem10 < 20);havoc #t~mem10;call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4);call write~int((if #t~mem13 < 0 && 0 != #t~mem13 % 2 then 1 + #t~mem13 / 2 else #t~mem13 / 2), ~p~0.base, ~p~0.offset, 4);havoc #t~mem13; {1770#false} is VALID [2018-11-23 13:00:58,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {1770#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {1770#false} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {1770#false} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {1770#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {1770#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {1770#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {1770#false} is VALID [2018-11-23 13:00:58,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {1770#false} assume !false; {1770#false} is VALID [2018-11-23 13:00:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:58,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:58,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:00:58,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 13:00:58,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:58,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:58,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:58,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:58,690 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand 6 states. [2018-11-23 13:00:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:59,073 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2018-11-23 13:00:59,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:00:59,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 13:00:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:00:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:00:59,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2018-11-23 13:00:59,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:59,145 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:00:59,145 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:00:59,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:00:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:00:59,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:59,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 13:00:59,272 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 13:00:59,272 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 13:00:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:59,276 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2018-11-23 13:00:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2018-11-23 13:00:59,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:59,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:59,276 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 13:00:59,276 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 13:00:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:59,279 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2018-11-23 13:00:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2018-11-23 13:00:59,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:59,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:59,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:59,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:00:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2018-11-23 13:00:59,282 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 22 [2018-11-23 13:00:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:59,282 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-23 13:00:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2018-11-23 13:00:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:00:59,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:59,283 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:59,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:59,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:59,284 INFO L82 PathProgramCache]: Analyzing trace with hash -488768094, now seen corresponding path program 2 times [2018-11-23 13:00:59,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:59,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:59,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:59,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {2162#true} call ULTIMATE.init(); {2162#true} is VALID [2018-11-23 13:00:59,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {2162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2162#true} is VALID [2018-11-23 13:00:59,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2018-11-23 13:00:59,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #70#return; {2162#true} is VALID [2018-11-23 13:00:59,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret14 := main(); {2162#true} is VALID [2018-11-23 13:00:59,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {2162#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:59,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} goto; {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:59,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:59,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} is VALID [2018-11-23 13:00:59,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {2164#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~tail~0.base) main_~list~0.offset)) (= (select |#valid| main_~tail~0.base) 1) (= main_~tail~0.base main_~list~0.base) (not (= main_~list~0.offset (+ main_~tail~0.offset 4))))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:00:59,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} goto; {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:00:59,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:00:59,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:00:59,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {2165#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:59,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} goto; {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:59,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:59,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:00:59,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {2166#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {2167#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:59,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {2167#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2167#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:00:59,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {2167#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2168#|main_#t~short9|} is VALID [2018-11-23 13:00:59,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {2168#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2163#false} is VALID [2018-11-23 13:00:59,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2018-11-23 13:00:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:59,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:59,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:00:59,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:00:59,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:00:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:59,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:00,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:01:00,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:01:00,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:01:00,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-11-23 13:01:00,183 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:00,184 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, |v_#valid_13|]. (and (= |#valid| (store |v_#valid_13| main_~list~0.base 1)) (= main_~list~0.offset 0) (= (store |v_#memory_int_27| main_~list~0.base (store (select |v_#memory_int_27| main_~list~0.base) main_~list~0.offset 10)) |#memory_int|) (= main_~tail~0.base main_~list~0.base) (<= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 13:01:00,184 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= main_~tail~0.base main_~list~0.base) (<= main_~list~0.offset main_~tail~0.offset) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))) [2018-11-23 13:01:00,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 13:01:00,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:00,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:00,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:00,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:00,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-11-23 13:01:00,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:00,527 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-23 13:01:00,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:01:00,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:00,584 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,592 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,606 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,647 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:79, output treesize:25 [2018-11-23 13:01:00,688 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:00,688 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, main_~p~0.offset, main_~x~0, |v_#memory_int_28|, v_main_~tail~0.offset_5, |v_#memory_int_32|, |v_#valid_14|]. (let ((.cse2 (select |v_#memory_int_29| main_~tail~0.base)) (.cse0 (select |v_#memory_int_32| main_~list~0.base))) (and (= main_~list~0.offset 0) (= |v_#memory_int_28| (store |v_#memory_int_32| main_~list~0.base (let ((.cse1 (+ v_main_~tail~0.offset_5 4))) (store .cse0 .cse1 (select (select |v_#memory_int_28| main_~list~0.base) .cse1))))) (= |#valid| (store |v_#valid_14| main_~tail~0.base 1)) (<= main_~list~0.offset v_main_~tail~0.offset_5) (= (store |v_#memory_int_29| main_~tail~0.base (store .cse2 main_~p~0.offset main_~x~0)) |#memory_int|) (= 1 (select |v_#valid_14| main_~list~0.base)) (= (store |v_#memory_int_28| main_~tail~0.base (let ((.cse3 (+ main_~p~0.offset 4))) (store (select |v_#memory_int_28| main_~tail~0.base) .cse3 (select .cse2 .cse3)))) |v_#memory_int_29|) (= (select .cse0 main_~list~0.offset) 10) (= 0 (select |v_#valid_14| main_~tail~0.base)))) [2018-11-23 13:01:00,688 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base))) [2018-11-23 13:01:00,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 13:01:00,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:00,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 13:01:00,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 13:01:01,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 13:01:01,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 13:01:01,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 13:01:01,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:01:01,125 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:01,152 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:79, output treesize:11 [2018-11-23 13:01:01,161 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:01,161 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, |main_#t~malloc5.base|, main_~p~0.offset, main_~x~0, v_main_~tail~0.base_6, |v_#valid_15|, |v_#memory_int_30|, v_main_~tail~0.offset_6, |v_#memory_int_33|]. (let ((.cse1 (select |v_#memory_int_31| |main_#t~malloc5.base|))) (and (= main_~list~0.offset 0) (not (= main_~list~0.base v_main_~tail~0.base_6)) (= 1 (select |v_#valid_15| v_main_~tail~0.base_6)) (= (store |v_#memory_int_30| |main_#t~malloc5.base| (let ((.cse0 (+ main_~p~0.offset 4))) (store (select |v_#memory_int_30| |main_#t~malloc5.base|) .cse0 (select .cse1 .cse0)))) |v_#memory_int_31|) (= (select |v_#valid_15| main_~list~0.base) 1) (= (select |v_#valid_15| |main_#t~malloc5.base|) 0) (= (store |v_#memory_int_33| v_main_~tail~0.base_6 (let ((.cse2 (+ v_main_~tail~0.offset_6 4))) (store (select |v_#memory_int_33| v_main_~tail~0.base_6) .cse2 (select (select |v_#memory_int_30| v_main_~tail~0.base_6) .cse2)))) |v_#memory_int_30|) (= 10 (select (select |v_#memory_int_33| main_~list~0.base) main_~list~0.offset)) (= |#memory_int| (store |v_#memory_int_31| |main_#t~malloc5.base| (store .cse1 main_~p~0.offset main_~x~0))))) [2018-11-23 13:01:01,161 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))) [2018-11-23 13:01:01,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {2162#true} call ULTIMATE.init(); {2162#true} is VALID [2018-11-23 13:01:01,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {2162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2162#true} is VALID [2018-11-23 13:01:01,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2018-11-23 13:01:01,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #70#return; {2162#true} is VALID [2018-11-23 13:01:01,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret14 := main(); {2162#true} is VALID [2018-11-23 13:01:01,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {2162#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} goto; {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {2187#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (<= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:01:01,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} goto; {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:01:01,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:01:01,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} is VALID [2018-11-23 13:01:01,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= 1 (select |#valid| main_~tail~0.base)) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~tail~0.base main_~list~0.base)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} goto; {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-23 13:01:01,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {2213#(and (= main_~list~0.offset 0) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {2226#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2018-11-23 13:01:01,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {2226#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2226#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2018-11-23 13:01:01,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {2226#(and (= main_~p~0.offset 0) (= 10 (select (select |#memory_int| main_~p~0.base) 0)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2168#|main_#t~short9|} is VALID [2018-11-23 13:01:01,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {2168#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2163#false} is VALID [2018-11-23 13:01:01,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2018-11-23 13:01:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:01,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 13:01:01,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 13:01:01,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:01,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:01:01,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:01,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:01:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:01:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:01:01,327 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand 11 states. [2018-11-23 13:01:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:02,527 INFO L93 Difference]: Finished difference Result 137 states and 190 transitions. [2018-11-23 13:01:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:01:02,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 13:01:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-23 13:01:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-23 13:01:02,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2018-11-23 13:01:02,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:02,660 INFO L225 Difference]: With dead ends: 137 [2018-11-23 13:01:02,660 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 13:01:02,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:01:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 13:01:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 71. [2018-11-23 13:01:03,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:03,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 71 states. [2018-11-23 13:01:03,010 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 71 states. [2018-11-23 13:01:03,010 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 71 states. [2018-11-23 13:01:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:03,014 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2018-11-23 13:01:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2018-11-23 13:01:03,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:03,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:03,015 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 117 states. [2018-11-23 13:01:03,016 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 117 states. [2018-11-23 13:01:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:03,020 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2018-11-23 13:01:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2018-11-23 13:01:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:03,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:03,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:03,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:01:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2018-11-23 13:01:03,024 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 22 [2018-11-23 13:01:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:03,025 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2018-11-23 13:01:03,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:01:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2018-11-23 13:01:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:01:03,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:03,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:03,026 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:03,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -693462683, now seen corresponding path program 1 times [2018-11-23 13:01:03,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:03,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:03,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:03,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {2749#true} call ULTIMATE.init(); {2749#true} is VALID [2018-11-23 13:01:03,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {2749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2749#true} is VALID [2018-11-23 13:01:03,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {2749#true} assume true; {2749#true} is VALID [2018-11-23 13:01:03,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2749#true} {2749#true} #70#return; {2749#true} is VALID [2018-11-23 13:01:03,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {2749#true} call #t~ret14 := main(); {2749#true} is VALID [2018-11-23 13:01:03,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {2749#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:03,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} goto; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:03,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:03,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:03,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} is VALID [2018-11-23 13:01:03,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} goto; {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} is VALID [2018-11-23 13:01:03,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} is VALID [2018-11-23 13:01:03,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} is VALID [2018-11-23 13:01:03,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {2752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:03,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:03,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:03,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:03,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:03,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {2753#(and (= main_~p~0.offset 0) (<= 10 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {2754#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 13:01:03,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {2754#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2755#(and (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset 0))} is VALID [2018-11-23 13:01:03,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {2755#(and (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:01:03,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2757#|main_#t~short9|} is VALID [2018-11-23 13:01:03,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {2757#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2750#false} is VALID [2018-11-23 13:01:03,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {2750#false} assume !false; {2750#false} is VALID [2018-11-23 13:01:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:03,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:03,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:03,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:03,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:03,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:01:03,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 13:01:03,658 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:03,659 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_16|]. (and (= main_~list~0.offset 0) (= (store |v_#valid_16| main_~list~0.base 1) |#valid|) (= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base)) [2018-11-23 13:01:03,659 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base)) [2018-11-23 13:01:03,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:03,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:03,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 13:01:03,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 13:01:03,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:01:03,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 13:01:03,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:01:03,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:03,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:01:03,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,976 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:03,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 13:01:04,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:01:04,042 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-11-23 13:01:04,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-23 13:01:04,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:04,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-11-23 13:01:04,091 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,099 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,109 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,116 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 13:01:04,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-11-23 13:01:04,151 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,156 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,179 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:109, output treesize:75 [2018-11-23 13:01:04,205 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:04,205 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_17|, main_~p~0.offset, |main_#t~malloc5.base|, |v_#valid_17|, |v_#memory_int_34|, main_~x~0, |v_#memory_$Pointer$.base_17|]. (let ((.cse1 (+ main_~p~0.offset 4)) (.cse2 (+ main_~list~0.offset 4))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.offset_17| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_17| main_~list~0.base) .cse2 main_~p~0.offset)))) (store .cse0 |main_#t~malloc5.base| (store (store (select .cse0 |main_#t~malloc5.base|) .cse1 0) main_~p~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~malloc5.base|) main_~p~0.offset)))) |#memory_$Pointer$.offset|) (= 1 (select |v_#valid_17| main_~list~0.base)) (= 0 (select |v_#valid_17| |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= (store |v_#memory_int_34| |main_#t~malloc5.base| (store (select |v_#memory_int_34| |main_#t~malloc5.base|) main_~p~0.offset main_~x~0)) |#memory_int|) (not (< main_~x~0 10)) (= |#memory_$Pointer$.base| (let ((.cse3 (store |v_#memory_$Pointer$.base_17| main_~list~0.base (store (select |v_#memory_$Pointer$.base_17| main_~list~0.base) .cse2 |main_#t~malloc5.base|)))) (store .cse3 |main_#t~malloc5.base| (store (store (select .cse3 |main_#t~malloc5.base|) .cse1 0) main_~p~0.offset (select (select |#memory_$Pointer$.base| |main_#t~malloc5.base|) main_~p~0.offset))))))) [2018-11-23 13:01:04,205 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (+ main_~list~0.offset 4))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse3))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse3))) (and (not (= .cse0 main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (<= 10 (select (select |#memory_int| .cse0) .cse2)))))) [2018-11-23 13:01:04,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-23 13:01:04,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:04,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-23 13:01:04,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-23 13:01:04,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:04,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-11-23 13:01:04,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:04,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-11-23 13:01:04,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:04,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 13:01:04,530 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,537 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,549 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2018-11-23 13:01:04,558 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:04,558 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, |v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_18|]. (let ((.cse3 (select |v_#memory_$Pointer$.offset_18| main_~p~0.base))) (let ((.cse5 (select |v_#memory_$Pointer$.base_18| main_~p~0.base)) (.cse2 (select .cse3 4))) (let ((.cse4 (+ .cse2 4)) (.cse1 (select .cse5 4))) (and (= (store |v_#memory_int_35| main_~p~0.base (let ((.cse0 (select |v_#memory_int_35| main_~p~0.base))) (store .cse0 main_~p~0.offset (+ (select .cse0 main_~p~0.offset) 1)))) |#memory_int|) (<= 10 (select (select |v_#memory_int_35| .cse1) .cse2)) (= (store |v_#memory_$Pointer$.offset_18| main_~p~0.base (store .cse3 main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= (select (select |v_#memory_$Pointer$.base_18| .cse1) .cse4) 0) (= main_~p~0.offset 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_18| main_~p~0.base (store .cse5 main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset)))) (= (select (select |v_#memory_$Pointer$.offset_18| .cse1) .cse4) 0) (not (= main_~p~0.base .cse1)))))) [2018-11-23 13:01:04,559 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (.cse1 (+ .cse2 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= main_~p~0.offset 0) (not (= .cse0 main_~p~0.base)) (<= 10 (select (select |#memory_int| .cse0) .cse2)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) 0)))) [2018-11-23 13:01:04,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-11-23 13:01:04,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-23 13:01:04,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 13:01:04,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-23 13:01:04,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 13:01:04,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 13:01:04,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:04,661 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2018-11-23 13:01:04,665 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:04,665 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_13, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_13) 4))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_13) 4))) (and (= 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= .cse0 main_~p~0.base) (not (= v_main_~p~0.base_13 .cse0)) (= main_~p~0.offset .cse2) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) 0) (<= 10 (select (select |#memory_int| .cse0) .cse2))))) [2018-11-23 13:01:04,665 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2018-11-23 13:01:04,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {2749#true} call ULTIMATE.init(); {2749#true} is VALID [2018-11-23 13:01:04,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {2749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2749#true} is VALID [2018-11-23 13:01:04,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {2749#true} assume true; {2749#true} is VALID [2018-11-23 13:01:04,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2749#true} {2749#true} #70#return; {2749#true} is VALID [2018-11-23 13:01:04,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {2749#true} call #t~ret14 := main(); {2749#true} is VALID [2018-11-23 13:01:04,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {2749#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:04,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} goto; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:04,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:04,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:04,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {2751#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2018-11-23 13:01:04,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} goto; {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2018-11-23 13:01:04,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2018-11-23 13:01:04,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2018-11-23 13:01:04,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2788#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:04,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {2801#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (<= 10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:01:04,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:01:04,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {2756#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {2757#|main_#t~short9|} is VALID [2018-11-23 13:01:04,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {2757#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {2750#false} is VALID [2018-11-23 13:01:04,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {2750#false} assume !false; {2750#false} is VALID [2018-11-23 13:01:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-11-23 13:01:04,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:01:04,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:04,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:01:04,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:04,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:01:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:01:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:01:04,807 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand 11 states. [2018-11-23 13:01:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:06,891 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-11-23 13:01:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:01:06,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:01:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 13:01:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 13:01:06,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2018-11-23 13:01:07,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:07,109 INFO L225 Difference]: With dead ends: 123 [2018-11-23 13:01:07,110 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 13:01:07,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:01:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 13:01:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-11-23 13:01:07,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:07,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 98 states. [2018-11-23 13:01:07,455 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 98 states. [2018-11-23 13:01:07,456 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 98 states. [2018-11-23 13:01:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:07,459 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2018-11-23 13:01:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2018-11-23 13:01:07,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:07,460 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 121 states. [2018-11-23 13:01:07,460 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 121 states. [2018-11-23 13:01:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:07,463 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2018-11-23 13:01:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2018-11-23 13:01:07,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:07,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:07,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:07,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 13:01:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2018-11-23 13:01:07,466 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 24 [2018-11-23 13:01:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:07,466 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2018-11-23 13:01:07,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:01:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2018-11-23 13:01:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:01:07,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:07,467 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:07,468 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:07,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:07,468 INFO L82 PathProgramCache]: Analyzing trace with hash -693460761, now seen corresponding path program 1 times [2018-11-23 13:01:07,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:07,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:07,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:07,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:07,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {3364#true} call ULTIMATE.init(); {3364#true} is VALID [2018-11-23 13:01:07,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3364#true} is VALID [2018-11-23 13:01:07,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-23 13:01:07,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3364#true} {3364#true} #70#return; {3364#true} is VALID [2018-11-23 13:01:07,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {3364#true} call #t~ret14 := main(); {3364#true} is VALID [2018-11-23 13:01:07,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {3364#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:07,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} goto; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:07,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:07,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:07,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} is VALID [2018-11-23 13:01:07,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} goto; {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} is VALID [2018-11-23 13:01:07,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} is VALID [2018-11-23 13:01:07,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} is VALID [2018-11-23 13:01:07,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {3367#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 main_~list~0.offset) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0) 20))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:07,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:07,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:07,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:07,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 13:01:07,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {3368#(and (<= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (+ (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1))) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {3369#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20))} is VALID [2018-11-23 13:01:07,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {3369#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 20))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3370#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20) (= main_~p~0.offset 0))} is VALID [2018-11-23 13:01:07,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {3370#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {3371#|main_#t~short9|} is VALID [2018-11-23 13:01:07,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {3371#|main_#t~short9|} assume !#t~short9; {3365#false} is VALID [2018-11-23 13:01:07,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {3365#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {3365#false} is VALID [2018-11-23 13:01:07,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {3365#false} assume !false; {3365#false} is VALID [2018-11-23 13:01:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:07,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:07,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:07,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:07,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:01:07,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:07,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:07,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 13:01:07,926 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:07,926 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_18|]. (and (= main_~list~0.offset 0) (= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base) (= |#valid| (store |v_#valid_18| main_~list~0.base 1))) [2018-11-23 13:01:07,927 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.offset main_~tail~0.offset) (= main_~tail~0.base main_~list~0.base)) [2018-11-23 13:01:07,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:07,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:07,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 13:01:07,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 13:01:08,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:01:08,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 13:01:08,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:01:08,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 33 [2018-11-23 13:01:08,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 13:01:08,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:01:08,195 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 13:01:08,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:01:08,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 33 [2018-11-23 13:01:08,242 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,254 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,263 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,272 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 13:01:08,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-11-23 13:01:08,314 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,318 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,348 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:109, output treesize:75 [2018-11-23 13:01:08,373 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:08,373 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_19|, |main_#t~malloc5.base|, main_~p~0.offset, main_~x~0, |v_#memory_int_36|, |v_#valid_19|, |v_#memory_$Pointer$.offset_19|]. (let ((.cse1 (+ main_~p~0.offset 4)) (.cse2 (+ main_~list~0.offset 4))) (and (not (< 20 main_~x~0)) (= |#memory_int| (store |v_#memory_int_36| |main_#t~malloc5.base| (store (select |v_#memory_int_36| |main_#t~malloc5.base|) main_~p~0.offset main_~x~0))) (= 1 (select |v_#valid_19| main_~list~0.base)) (= 0 (select |v_#valid_19| |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= (let ((.cse0 (store |v_#memory_$Pointer$.base_19| main_~list~0.base (store (select |v_#memory_$Pointer$.base_19| main_~list~0.base) .cse2 |main_#t~malloc5.base|)))) (store .cse0 |main_#t~malloc5.base| (store (store (select .cse0 |main_#t~malloc5.base|) .cse1 0) main_~p~0.offset (select (select |#memory_$Pointer$.base| |main_#t~malloc5.base|) main_~p~0.offset)))) |#memory_$Pointer$.base|) (= (let ((.cse3 (store |v_#memory_$Pointer$.offset_19| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_19| main_~list~0.base) .cse2 main_~p~0.offset)))) (store .cse3 |main_#t~malloc5.base| (store (store (select .cse3 |main_#t~malloc5.base|) .cse1 0) main_~p~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~malloc5.base|) main_~p~0.offset)))) |#memory_$Pointer$.offset|))) [2018-11-23 13:01:08,373 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (+ main_~list~0.offset 4))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse3))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse3))) (and (not (= .cse0 main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (<= (select (select |#memory_int| .cse0) .cse2) 20))))) [2018-11-23 13:01:08,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-11-23 13:01:08,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 13:01:08,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-23 13:01:08,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-11-23 13:01:08,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-23 13:01:08,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:08,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-23 13:01:08,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,756 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2018-11-23 13:01:08,771 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:08,771 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|, |v_#memory_int_37|]. (let ((.cse4 (select |v_#memory_$Pointer$.offset_20| main_~p~0.base))) (let ((.cse3 (select .cse4 4)) (.cse2 (select |v_#memory_$Pointer$.base_20| main_~p~0.base))) (let ((.cse0 (select .cse2 4)) (.cse1 (+ .cse3 4))) (and (= (select (select |v_#memory_$Pointer$.base_20| .cse0) .cse1) 0) (= (store |v_#memory_$Pointer$.base_20| main_~p~0.base (store .cse2 main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.base|) (= main_~p~0.offset 0) (<= (select (select |v_#memory_int_37| .cse0) .cse3) 20) (= (store |v_#memory_$Pointer$.offset_20| main_~p~0.base (store .cse4 main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_37| main_~p~0.base (let ((.cse5 (select |v_#memory_int_37| main_~p~0.base))) (store .cse5 main_~p~0.offset (+ (select .cse5 main_~p~0.offset) 1))))) (not (= main_~p~0.base .cse0)) (= 0 (select (select |v_#memory_$Pointer$.offset_20| .cse0) .cse1)))))) [2018-11-23 13:01:08,771 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (.cse1 (+ .cse2 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (<= (select (select |#memory_int| .cse0) .cse2) 20) (= main_~p~0.offset 0) (not (= .cse0 main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) 0)))) [2018-11-23 13:01:08,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-11-23 13:01:08,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-23 13:01:08,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 13:01:08,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-23 13:01:08,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 13:01:08,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 13:01:08,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:08,914 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2018-11-23 13:01:08,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:08,918 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_14, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_14) 4))) (let ((.cse2 (+ .cse1 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_14) 4))) (and (<= (select (select |#memory_int| .cse0) .cse1) 20) (= .cse0 main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) 0) (not (= v_main_~p~0.base_14 .cse0)) (= .cse1 main_~p~0.offset)))) [2018-11-23 13:01:08,918 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20) [2018-11-23 13:01:08,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {3364#true} call ULTIMATE.init(); {3364#true} is VALID [2018-11-23 13:01:08,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3364#true} is VALID [2018-11-23 13:01:08,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} assume true; {3364#true} is VALID [2018-11-23 13:01:08,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3364#true} {3364#true} #70#return; {3364#true} is VALID [2018-11-23 13:01:08,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {3364#true} call #t~ret14 := main(); {3364#true} is VALID [2018-11-23 13:01:08,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {3364#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:08,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} goto; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:08,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:08,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:08,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {3366#(and (= (select |#valid| main_~tail~0.base) 1) (= main_~list~0.offset main_~tail~0.offset) (= 0 main_~list~0.offset) (= main_~tail~0.base main_~list~0.base))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} is VALID [2018-11-23 13:01:08,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} goto; {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} is VALID [2018-11-23 13:01:08,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} is VALID [2018-11-23 13:01:08,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} is VALID [2018-11-23 13:01:08,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 20))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} is VALID [2018-11-23 13:01:08,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {3415#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) 20) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) 0))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3434#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} is VALID [2018-11-23 13:01:08,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {3434#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {3371#|main_#t~short9|} is VALID [2018-11-23 13:01:08,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {3371#|main_#t~short9|} assume !#t~short9; {3365#false} is VALID [2018-11-23 13:01:08,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {3365#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {3365#false} is VALID [2018-11-23 13:01:08,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {3365#false} assume !false; {3365#false} is VALID [2018-11-23 13:01:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:09,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-23 13:01:09,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:01:09,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:09,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:01:09,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:09,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:01:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:01:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:01:09,063 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand 11 states. [2018-11-23 13:01:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:11,560 INFO L93 Difference]: Finished difference Result 192 states and 270 transitions. [2018-11-23 13:01:11,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:01:11,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:01:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2018-11-23 13:01:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2018-11-23 13:01:11,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 108 transitions. [2018-11-23 13:01:11,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:11,744 INFO L225 Difference]: With dead ends: 192 [2018-11-23 13:01:11,744 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 13:01:11,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:01:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 13:01:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 125. [2018-11-23 13:01:12,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:12,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 125 states. [2018-11-23 13:01:12,239 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 125 states. [2018-11-23 13:01:12,239 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 125 states. [2018-11-23 13:01:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:12,243 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2018-11-23 13:01:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 205 transitions. [2018-11-23 13:01:12,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:12,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:12,244 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 152 states. [2018-11-23 13:01:12,244 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 152 states. [2018-11-23 13:01:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:12,248 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2018-11-23 13:01:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 205 transitions. [2018-11-23 13:01:12,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:12,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:12,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:12,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 13:01:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2018-11-23 13:01:12,252 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 24 [2018-11-23 13:01:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:12,252 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2018-11-23 13:01:12,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:01:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2018-11-23 13:01:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:01:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:12,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:12,254 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:12,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -765395903, now seen corresponding path program 1 times [2018-11-23 13:01:12,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:12,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:12,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {4157#true} call ULTIMATE.init(); {4157#true} is VALID [2018-11-23 13:01:12,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {4157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4157#true} is VALID [2018-11-23 13:01:12,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {4157#true} assume true; {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4157#true} {4157#true} #70#return; {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {4157#true} call #t~ret14 := main(); {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {4157#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {4157#true} goto; {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {4157#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4157#true} is VALID [2018-11-23 13:01:12,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {4157#true} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4157#true} is VALID [2018-11-23 13:01:12,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {4157#true} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {4157#true} is VALID [2018-11-23 13:01:12,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {4157#true} goto; {4157#true} is VALID [2018-11-23 13:01:12,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {4157#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4157#true} is VALID [2018-11-23 13:01:12,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {4157#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {4157#true} is VALID [2018-11-23 13:01:12,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {4157#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {4160#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem10|) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {4160#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem10|) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {4161#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:12,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {4161#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} is VALID [2018-11-23 13:01:12,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} assume !(~p~0.base != 0 || ~p~0.offset != 0); {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} is VALID [2018-11-23 13:01:12,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {4163#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} is VALID [2018-11-23 13:01:12,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {4163#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {4164#|main_#t~short9|} is VALID [2018-11-23 13:01:12,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {4164#|main_#t~short9|} assume !#t~short9; {4158#false} is VALID [2018-11-23 13:01:12,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {4158#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {4158#false} is VALID [2018-11-23 13:01:12,442 INFO L273 TraceCheckUtils]: 25: Hoare triple {4158#false} assume !false; {4158#false} is VALID [2018-11-23 13:01:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:01:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:12,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:12,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:12,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:12,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 13:01:12,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:12,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 13:01:12,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:12,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:12,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:12,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-23 13:01:14,040 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:14,040 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|]. (let ((.cse0 (select |v_#memory_int_38| main_~list~0.base))) (let ((.cse1 (select .cse0 main_~list~0.offset))) (and (= |#memory_int| (store |v_#memory_int_38| main_~list~0.base (store .cse0 main_~list~0.offset (+ .cse1 1)))) (<= .cse1 19)))) [2018-11-23 13:01:14,040 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20) [2018-11-23 13:01:14,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {4157#true} call ULTIMATE.init(); {4157#true} is VALID [2018-11-23 13:01:14,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {4157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4157#true} is VALID [2018-11-23 13:01:14,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {4157#true} assume true; {4157#true} is VALID [2018-11-23 13:01:14,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4157#true} {4157#true} #70#return; {4157#true} is VALID [2018-11-23 13:01:14,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {4157#true} call #t~ret14 := main(); {4157#true} is VALID [2018-11-23 13:01:14,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {4157#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {4157#true} is VALID [2018-11-23 13:01:14,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {4157#true} goto; {4157#true} is VALID [2018-11-23 13:01:14,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {4157#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4157#true} is VALID [2018-11-23 13:01:14,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {4157#true} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4157#true} is VALID [2018-11-23 13:01:14,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {4157#true} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {4157#true} is VALID [2018-11-23 13:01:14,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {4157#true} goto; {4157#true} is VALID [2018-11-23 13:01:14,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {4157#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4157#true} is VALID [2018-11-23 13:01:14,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {4157#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {4157#true} is VALID [2018-11-23 13:01:14,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {4157#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:14,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:14,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:14,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:14,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {4159#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {4160#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem10|) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:14,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {4160#(and (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem10|) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);#t~post12 := #t~mem11;call write~int(1 + #t~post12, ~p~0.base, ~p~0.offset, 4);havoc #t~mem11;havoc #t~post12; {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} is VALID [2018-11-23 13:01:14,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} is VALID [2018-11-23 13:01:14,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} assume !(~p~0.base != 0 || ~p~0.offset != 0); {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} is VALID [2018-11-23 13:01:14,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {4162#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 20)} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {4163#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} is VALID [2018-11-23 13:01:14,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {4163#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 20)} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {4164#|main_#t~short9|} is VALID [2018-11-23 13:01:14,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {4164#|main_#t~short9|} assume !#t~short9; {4158#false} is VALID [2018-11-23 13:01:14,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {4158#false} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {4158#false} is VALID [2018-11-23 13:01:14,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {4158#false} assume !false; {4158#false} is VALID [2018-11-23 13:01:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:01:14,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:14,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-23 13:01:14,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 13:01:14,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:14,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:01:14,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:14,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:01:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:01:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:14,119 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand 8 states. [2018-11-23 13:01:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,003 INFO L93 Difference]: Finished difference Result 237 states and 335 transitions. [2018-11-23 13:01:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:01:15,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 13:01:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:01:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-23 13:01:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:01:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-23 13:01:15,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2018-11-23 13:01:15,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:15,695 INFO L225 Difference]: With dead ends: 237 [2018-11-23 13:01:15,696 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 13:01:15,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:01:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 13:01:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2018-11-23 13:01:15,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:15,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 147 states. [2018-11-23 13:01:15,985 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 147 states. [2018-11-23 13:01:15,985 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 147 states. [2018-11-23 13:01:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,990 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2018-11-23 13:01:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2018-11-23 13:01:15,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:15,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:15,991 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 183 states. [2018-11-23 13:01:15,991 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 183 states. [2018-11-23 13:01:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,995 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2018-11-23 13:01:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2018-11-23 13:01:15,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:15,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:15,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:15,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 13:01:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2018-11-23 13:01:16,000 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 26 [2018-11-23 13:01:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:16,001 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2018-11-23 13:01:16,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:01:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2018-11-23 13:01:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:01:16,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:16,002 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:16,002 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:16,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:16,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1574744451, now seen corresponding path program 1 times [2018-11-23 13:01:16,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:16,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:16,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:16,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:16,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:16,718 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:01:17,063 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:01:17,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5086#true} is VALID [2018-11-23 13:01:17,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {5086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5086#true} is VALID [2018-11-23 13:01:17,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2018-11-23 13:01:17,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #70#return; {5086#true} is VALID [2018-11-23 13:01:17,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret14 := main(); {5086#true} is VALID [2018-11-23 13:01:17,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {5086#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {5086#true} is VALID [2018-11-23 13:01:17,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {5086#true} goto; {5086#true} is VALID [2018-11-23 13:01:17,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {5086#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5086#true} is VALID [2018-11-23 13:01:17,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {5086#true} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5086#true} is VALID [2018-11-23 13:01:17,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {5086#true} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {5086#true} is VALID [2018-11-23 13:01:17,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {5086#true} goto; {5086#true} is VALID [2018-11-23 13:01:17,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {5086#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5086#true} is VALID [2018-11-23 13:01:17,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {5086#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {5086#true} is VALID [2018-11-23 13:01:17,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {5086#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {5089#(and (<= |main_#t~mem10| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {5089#(and (<= |main_#t~mem10| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !(#t~mem10 < 20);havoc #t~mem10;call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4);call write~int((if #t~mem13 < 0 && 0 != #t~mem13 % 2 then 1 + #t~mem13 / 2 else #t~mem13 / 2), ~p~0.base, ~p~0.offset, 4);havoc #t~mem13; {5090#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:17,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {5090#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {5091#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:01:17,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {5091#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {5091#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-23 13:01:17,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {5091#(<= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {5092#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:01:17,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {5092#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {5092#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 13:01:17,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {5092#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {5093#|main_#t~short9|} is VALID [2018-11-23 13:01:17,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {5093#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {5087#false} is VALID [2018-11-23 13:01:17,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2018-11-23 13:01:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:01:17,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:17,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:17,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:17,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:17,303 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:17,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:17,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:17,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-23 13:01:17,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 13:01:17,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:17,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:17,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:17,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 13:01:17,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 13:01:17,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:17,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:17,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 13:01:17,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:112, output treesize:32 [2018-11-23 13:01:19,804 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:19,804 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_2, |v_#memory_int_39|, v_prenex_1]. (or (let ((.cse0 (select v_prenex_2 main_~list~0.base))) (let ((.cse1 (select .cse0 main_~list~0.offset))) (and (= (store v_prenex_2 main_~list~0.base (store .cse0 main_~list~0.offset (div .cse1 2))) |#memory_int|) (not (< .cse1 0)) (<= 20 .cse1)))) (let ((.cse3 (select |v_#memory_int_39| main_~list~0.base))) (let ((.cse2 (select .cse3 main_~list~0.offset))) (and (not (= (mod .cse2 2) 0)) (= (store |v_#memory_int_39| main_~list~0.base (store .cse3 main_~list~0.offset (+ (div .cse2 2) 1))) |#memory_int|) (<= 20 .cse2) (< .cse2 0)))) (let ((.cse4 (select v_prenex_1 main_~list~0.base))) (let ((.cse5 (select .cse4 main_~list~0.offset))) (and (= (store v_prenex_1 main_~list~0.base (store .cse4 main_~list~0.offset (div .cse5 2))) |#memory_int|) (= (mod .cse5 2) 0) (<= 20 .cse5))))) [2018-11-23 13:01:19,804 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_51, v_arrayElimCell_49]. (let ((.cse0 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))) (or (and (= (div v_arrayElimCell_51 2) .cse0) (<= 20 v_arrayElimCell_51)) (and (<= 20 v_arrayElimCell_49) (= (mod v_arrayElimCell_49 2) 0) (= .cse0 (div v_arrayElimCell_49 2))))) [2018-11-23 13:01:25,889 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2018-11-23 13:01:32,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5086#true} is VALID [2018-11-23 13:01:32,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {5086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5086#true} is VALID [2018-11-23 13:01:32,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2018-11-23 13:01:32,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #70#return; {5086#true} is VALID [2018-11-23 13:01:32,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret14 := main(); {5086#true} is VALID [2018-11-23 13:01:32,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {5086#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(10, ~list~0.base, ~list~0.offset, 4); {5086#true} is VALID [2018-11-23 13:01:32,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {5086#true} goto; {5086#true} is VALID [2018-11-23 13:01:32,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {5086#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5086#true} is VALID [2018-11-23 13:01:32,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {5086#true} assume !!(0 != #t~nondet3);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5086#true} is VALID [2018-11-23 13:01:32,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {5086#true} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, 4 + ~tail~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {5086#true} is VALID [2018-11-23 13:01:32,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {5086#true} goto; {5086#true} is VALID [2018-11-23 13:01:32,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {5086#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5086#true} is VALID [2018-11-23 13:01:32,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {5086#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {5086#true} is VALID [2018-11-23 13:01:32,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {5086#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:32,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:32,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:32,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !!#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:32,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {5088#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {5089#(and (<= |main_#t~mem10| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-23 13:01:32,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {5089#(and (<= |main_#t~mem10| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base))} assume !(#t~mem10 < 20);havoc #t~mem10;call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4);call write~int((if #t~mem13 < 0 && 0 != #t~mem13 % 2 then 1 + #t~mem13 / 2 else #t~mem13 / 2), ~p~0.base, ~p~0.offset, 4);havoc #t~mem13; {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} is VALID [2018-11-23 13:01:32,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} is VALID [2018-11-23 13:01:32,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} is VALID [2018-11-23 13:01:32,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {5151#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= 20 v_arrayElimCell_51)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {5161#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (<= 20 v_arrayElimCell_51)))} is VALID [2018-11-23 13:01:32,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {5161#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (<= 20 v_arrayElimCell_51)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem7 <= 20; {5161#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (<= 20 v_arrayElimCell_51)))} is VALID [2018-11-23 13:01:32,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {5161#(exists ((v_arrayElimCell_51 Int)) (and (= (div v_arrayElimCell_51 2) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (<= 20 v_arrayElimCell_51)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4);#t~short9 := #t~mem8 >= 10; {5093#|main_#t~short9|} is VALID [2018-11-23 13:01:32,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {5093#|main_#t~short9|} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~mem8; {5087#false} is VALID [2018-11-23 13:01:32,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2018-11-23 13:01:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:01:32,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:32,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-11-23 13:01:32,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-23 13:01:32,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:32,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:01:32,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:32,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:01:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:01:32,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=62, Unknown=5, NotChecked=0, Total=90 [2018-11-23 13:01:32,142 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand 10 states. [2018-11-23 13:01:34,279 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-23 13:01:44,555 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-23 13:01:58,662 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 20