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/shared_mem1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:38,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:38,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:38,544 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:38,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:38,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:38,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:38,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:38,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:38,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:38,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:38,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:38,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:38,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:38,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:38,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:38,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:38,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:38,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:38,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:38,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:38,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:38,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:38,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:38,584 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:38,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:38,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:38,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:38,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:38,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:38,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:38,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:38,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:38,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:38,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:38,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:38,598 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:38,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:38,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:38,629 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:38,629 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:38,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:38,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:38,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:38,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:38,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:38,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:38,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:38,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:38,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:38,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:38,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:38,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:38,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:38,633 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:38,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:38,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:38,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:38,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:38,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:38,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:38,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:38,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:38,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:38,635 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:38,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:38,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:38,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:38,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:38,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:38,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:38,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:38,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:38,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1_true-unreach-call.i [2018-11-23 13:00:38,760 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a963ab35d/4cf0d7f191004e789d56e69d7a0491cb/FLAGcba63c9e6 [2018-11-23 13:00:39,322 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:39,322 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1_true-unreach-call.i [2018-11-23 13:00:39,337 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a963ab35d/4cf0d7f191004e789d56e69d7a0491cb/FLAGcba63c9e6 [2018-11-23 13:00:39,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a963ab35d/4cf0d7f191004e789d56e69d7a0491cb [2018-11-23 13:00:39,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:39,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:39,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:39,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:39,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:39,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e141ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39, skipping insertion in model container [2018-11-23 13:00:39,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:39,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:40,156 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:40,169 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:40,238 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:40,310 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:40,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:40 WrapperNode [2018-11-23 13:00:40,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:40,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:40,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:40,312 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:40,323 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:40" (1/1) ... [2018-11-23 13:00:40,418 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:40" (1/1) ... [2018-11-23 13:00:40,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:40,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:40,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:40,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:40,439 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:40" (1/1) ... [2018-11-23 13:00:40,439 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:40" (1/1) ... [2018-11-23 13:00:40,443 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:40" (1/1) ... [2018-11-23 13:00:40,443 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:40" (1/1) ... [2018-11-23 13:00:40,458 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:40" (1/1) ... [2018-11-23 13:00:40,464 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:40" (1/1) ... [2018-11-23 13:00:40,468 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:40" (1/1) ... [2018-11-23 13:00:40,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:40,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:40,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:40,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:40,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:40" (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:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:40,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:41,315 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:41,316 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:00:41,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:41 BoogieIcfgContainer [2018-11-23 13:00:41,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:41,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:41,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:41,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:41,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:39" (1/3) ... [2018-11-23 13:00:41,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601c381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:41, skipping insertion in model container [2018-11-23 13:00:41,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:40" (2/3) ... [2018-11-23 13:00:41,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601c381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:41, skipping insertion in model container [2018-11-23 13:00:41,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:41" (3/3) ... [2018-11-23 13:00:41,330 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1_true-unreach-call.i [2018-11-23 13:00:41,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:41,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:41,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:41,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:41,422 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:41,422 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:41,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:41,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:41,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:41,423 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:41,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:41,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:00:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:00:41,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:41,462 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,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:41,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1761688527, now seen corresponding path program 1 times [2018-11-23 13:00:41,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:41,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:00:41,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 13:00:41,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:00:41,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #61#return; {24#true} is VALID [2018-11-23 13:00:41,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret19 := main(); {24#true} is VALID [2018-11-23 13:00:41,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(100, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {24#true} is VALID [2018-11-23 13:00:41,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:00:41,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {25#false} is VALID [2018-11-23 13:00:41,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume !!(~list~0.base != 0 || ~list~0.offset != 0);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {25#false} is VALID [2018-11-23 13:00:41,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume #t~mem8 <= 100;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem10 := read~int(#t~mem9.base, #t~mem9.offset, 4);call #t~mem11 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem10 + #t~mem11, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10;havoc #t~mem11; {25#false} is VALID [2018-11-23 13:00:41,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;call #t~mem16 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem16 > 90; {25#false} is VALID [2018-11-23 13:00:41,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume #t~short18;call #t~mem17 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem17 < 110; {25#false} is VALID [2018-11-23 13:00:41,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {25#false} assume !#t~short18;havoc #t~short18;havoc #t~mem17;havoc #t~mem16; {25#false} is VALID [2018-11-23 13:00:41,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:00:41,712 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,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:41,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:41,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:00:41,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:41,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:41,826 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:41,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:41,840 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:00:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,964 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2018-11-23 13:00:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:41,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:00:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:00:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:00:41,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2018-11-23 13:00:42,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,266 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:00:42,266 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:00:42,270 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:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:00:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:00:42,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:00:42,307 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:00:42,308 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:00:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,311 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 13:00:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:00:42,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,313 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:00:42,313 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:00:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,316 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 13:00:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:00:42,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:42,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:00:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 13:00:42,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2018-11-23 13:00:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 13:00:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:00:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:00:42,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:42,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:42,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:42,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash 23172021, now seen corresponding path program 1 times [2018-11-23 13:00:42,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:42,736 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-23 13:00:43,103 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-23 13:00:43,529 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-23 13:00:43,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-23 13:00:43,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {125#true} is VALID [2018-11-23 13:00:43,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-23 13:00:43,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #61#return; {125#true} is VALID [2018-11-23 13:00:43,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret19 := main(); {125#true} is VALID [2018-11-23 13:00:43,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(100, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:43,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:43,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:43,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {127#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {128#(and (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1)) (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))))} is VALID [2018-11-23 13:00:43,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {128#(and (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1)) (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))))} assume !!(~list~0.base != 0 || ~list~0.offset != 0);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {129#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= (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))) |main_#t~mem8|))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-23 13:00:43,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= (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))) |main_#t~mem8|))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} assume #t~mem8 <= 100;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem10 := read~int(#t~mem9.base, #t~mem9.offset, 4);call #t~mem11 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem10 + #t~mem11, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10;havoc #t~mem11; {130#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 101)} is VALID [2018-11-23 13:00:43,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {130#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 101)} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;call #t~mem16 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem16 > 90; {131#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 109)} is VALID [2018-11-23 13:00:43,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {131#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 109)} assume #t~short18;call #t~mem17 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem17 < 110; {132#|main_#t~short18|} is VALID [2018-11-23 13:00:43,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {132#|main_#t~short18|} assume !#t~short18;havoc #t~short18;havoc #t~mem17;havoc #t~mem16; {126#false} is VALID [2018-11-23 13:00:43,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-23 13:00:43,670 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:43,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:43,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:00:43,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:00:43,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:43,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:00:43,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:43,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:00:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:00:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:43,710 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2018-11-23 13:00:44,296 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-23 13:00:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,544 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 13:00:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:44,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:00:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 13:00:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 13:00:44,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 13:00:44,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:44,663 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:00:44,664 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:00:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:00:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:00:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-23 13:00:44,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:44,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2018-11-23 13:00:44,702 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2018-11-23 13:00:44,702 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2018-11-23 13:00:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,705 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-23 13:00:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2018-11-23 13:00:44,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:44,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:44,706 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2018-11-23 13:00:44,706 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2018-11-23 13:00:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,710 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-23 13:00:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2018-11-23 13:00:44,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:44,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:44,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:44,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:00:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-23 13:00:44,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2018-11-23 13:00:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:44,714 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-23 13:00:44,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:00:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2018-11-23 13:00:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:00:44,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:44,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:44,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:44,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 23173943, now seen corresponding path program 1 times [2018-11-23 13:00:44,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:45,269 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2018-11-23 13:00:45,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 13:00:45,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 13:00:45,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 13:00:45,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #61#return; {279#true} is VALID [2018-11-23 13:00:45,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret19 := main(); {279#true} is VALID [2018-11-23 13:00:45,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(100, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {282#(and (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))))} is VALID [2018-11-23 13:00:45,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(and (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))))} assume !!(~list~0.base != 0 || ~list~0.offset != 0);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {283#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= |main_#t~mem8| 100)) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 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))) |main_#t~mem8|))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-23 13:00:45,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= |main_#t~mem8| 100)) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 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))) |main_#t~mem8|))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} assume #t~mem8 <= 100;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem10 := read~int(#t~mem9.base, #t~mem9.offset, 4);call #t~mem11 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem10 + #t~mem11, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10;havoc #t~mem11; {284#(or (<= 101 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {284#(or (<= 101 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;call #t~mem16 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem16 > 90; {285#|main_#t~short18|} is VALID [2018-11-23 13:00:45,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#|main_#t~short18|} assume !#t~short18; {280#false} is VALID [2018-11-23 13:00:45,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !#t~short18;havoc #t~short18;havoc #t~mem17;havoc #t~mem16; {280#false} is VALID [2018-11-23 13:00:45,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 13:00:45,349 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:45,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:45,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:00:45,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 13:00:45,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:45,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:00:45,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:45,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:00:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:00:45,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:00:45,395 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2018-11-23 13:00:45,834 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2018-11-23 13:00:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:46,139 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2018-11-23 13:00:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:46,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 13:00:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:00:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 13:00:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:00:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 13:00:46,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-23 13:00:46,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:46,248 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:00:46,248 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:00:46,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:00:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:00:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 13:00:46,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:46,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 13:00:46,281 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 13:00:46,281 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 13:00:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:46,284 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2018-11-23 13:00:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-11-23 13:00:46,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:46,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:46,285 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 13:00:46,285 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 13:00:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:46,287 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2018-11-23 13:00:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-11-23 13:00:46,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:46,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:46,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:46,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:00:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-23 13:00:46,292 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2018-11-23 13:00:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:46,292 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 13:00:46,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:00:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-11-23 13:00:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:00:46,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:46,293 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:46,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:46,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 842352824, now seen corresponding path program 1 times [2018-11-23 13:00:46,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:46,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:46,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-23 13:00:46,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {429#true} is VALID [2018-11-23 13:00:46,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 13:00:46,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #61#return; {429#true} is VALID [2018-11-23 13:00:46,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret19 := main(); {429#true} is VALID [2018-11-23 13:00:46,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(100, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~m~0.base main_~list~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:46,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {432#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {433#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1)) (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-23 13:00:46,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {433#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1)) (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} assume !!(~list~0.base != 0 || ~list~0.offset != 0);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {434#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= (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))) |main_#t~mem8|))) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-23 13:00:46,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {434#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1) (= (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))) |main_#t~mem8|))) (or (= 100 (select (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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))))) main_~m~0.offset)) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= 100 (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) (store (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)) (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (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)))))) main_~m~0.base) main_~m~0.offset))))} assume #t~mem8 <= 100;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem10 := read~int(#t~mem9.base, #t~mem9.offset, 4);call #t~mem11 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem10 + #t~mem11, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10;havoc #t~mem11; {435#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 101)} is VALID [2018-11-23 13:00:46,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {435#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 101)} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;call #t~mem16 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem16 > 90; {436#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 109)} is VALID [2018-11-23 13:00:46,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {436#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 109)} assume #t~short18;call #t~mem17 := read~int(~m~0.base, ~m~0.offset, 4);#t~short18 := #t~mem17 < 110; {437#|main_#t~short18|} is VALID [2018-11-23 13:00:46,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {437#|main_#t~short18|} assume !#t~short18;havoc #t~short18;havoc #t~mem17;havoc #t~mem16; {430#false} is VALID [2018-11-23 13:00:46,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-23 13:00:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:47,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:47,000 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:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:47,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:47,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 9 treesize of output 12 [2018-11-23 13:00:47,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-23 13:00:47,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,468 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 13:00:47,476 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:47,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,631 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-11-23 13:00:47,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2018-11-23 13:00:47,667 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 31 treesize of output 33 [2018-11-23 13:00:47,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,681 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:47,684 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,783 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 2 case distinctions, treesize of input 28 treesize of output 34 [2018-11-23 13:00:47,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,799 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 20 [2018-11-23 13:00:47,817 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:47,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:47,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-11-23 13:00:47,908 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 13:00:47,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:48,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:48,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:48,108 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 18 treesize of output 15 [2018-11-23 13:00:48,114 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 15 treesize of output 18 [2018-11-23 13:00:48,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,125 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 27 [2018-11-23 13:00:48,127 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,138 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,147 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,222 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 35 treesize of output 30 [2018-11-23 13:00:48,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,244 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 29 [2018-11-23 13:00:48,247 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,261 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-11-23 13:00:48,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,335 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 33 treesize of output 25 [2018-11-23 13:00:48,338 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 54 [2018-11-23 13:00:48,454 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 13:00:48,509 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:48,518 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 33 treesize of output 28 [2018-11-23 13:00:48,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,531 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 29 [2018-11-23 13:00:48,534 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,551 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,659 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 18 treesize of output 15 [2018-11-23 13:00:48,666 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 15 treesize of output 18 [2018-11-23 13:00:48,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,678 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 27 [2018-11-23 13:00:48,684 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,750 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,758 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-23 13:00:48,833 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 6 variables, input treesize:112, output treesize:288 [2018-11-23 13:00:51,513 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:51,514 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, |v_#memory_int_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|, |v_#valid_12|, |main_#t~malloc2.base|]. (let ((.cse1 (+ main_~head~0.offset 8)) (.cse0 (select |v_#memory_int_23| main_~head~0.base)) (.cse2 (+ main_~head~0.offset 4))) (and (= 0 main_~head~0.offset) (= (store |v_#memory_int_23| main_~head~0.base (store .cse0 .cse1 (select (select |#memory_int| main_~head~0.base) .cse1))) |#memory_int|) (= main_~list~0.offset main_~head~0.offset) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_22| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_22| main_~head~0.base) .cse2 main_~m~0.offset) .cse1 main_~head~0.offset))) (= main_~head~0.base main_~list~0.base) (= (store |v_#memory_$Pointer$.base_22| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_22| main_~head~0.base) .cse2 main_~m~0.base) .cse1 main_~head~0.base)) |#memory_$Pointer$.base|) (= (let ((.cse3 (store |v_#memory_int_26| main_~m~0.base (store (select |v_#memory_int_26| main_~m~0.base) main_~m~0.offset 100)))) (store .cse3 main_~head~0.base (store (store (select .cse3 main_~head~0.base) main_~head~0.offset 1) .cse2 (select .cse0 .cse2)))) |v_#memory_int_23|) (= (store (store |v_#valid_12| |main_#t~malloc2.base| 1) main_~head~0.base 1) |#valid|))) [2018-11-23 13:00:51,515 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_3, v_prenex_4, v_prenex_5, |main_#t~malloc2.base|]. (let ((.cse15 (select |#memory_$Pointer$.offset| main_~head~0.base)) (.cse10 (+ main_~head~0.offset 4))) (let ((.cse16 (select |#memory_$Pointer$.base| main_~head~0.base)) (.cse13 (+ main_~head~0.offset 8)) (.cse14 (select .cse15 .cse10)) (.cse12 (select |#memory_int| main_~m~0.base))) (let ((.cse4 (= (select .cse12 main_~list~0.offset) 1)) (.cse0 (= 0 main_~head~0.offset)) (.cse1 (= main_~m~0.offset .cse14)) (.cse2 (= (select .cse16 .cse13) main_~head~0.base)) (.cse3 (= main_~m~0.base (select .cse16 .cse10))) (.cse5 (= (select .cse15 .cse13) main_~head~0.offset)) (.cse6 (= main_~list~0.offset main_~head~0.offset)) (.cse7 (= 1 (select |#valid| main_~head~0.base))) (.cse9 (= main_~m~0.base main_~head~0.base)) (.cse8 (= main_~head~0.base main_~list~0.base)) (.cse11 (= 1 (select (select |#memory_int| main_~head~0.base) main_~list~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~list~0.offset main_~m~0.offset) .cse7 .cse8 .cse9 (= (select |#valid| v_prenex_3) 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select |#valid| v_prenex_4) 1) (= .cse10 main_~m~0.offset)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 (= (select |#valid| v_prenex_5) 1) (= 100 (select .cse12 main_~m~0.offset))) (and .cse0 .cse1 .cse2 .cse3 (= .cse13 .cse14) .cse5 .cse6 .cse7 .cse9 .cse8 .cse11 (= (select |#valid| |main_#t~malloc2.base|) 1)))))) [2018-11-23 13:00:52,194 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49