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/array-examples/sanfoundry_10_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:18,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:18,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:18,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:18,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:18,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:18,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:18,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:18,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:18,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:18,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:18,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:18,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:18,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:18,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:18,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:18,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:18,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:18,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:18,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:18,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:18,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:18,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:18,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:18,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:18,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:18,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:18,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:18,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:18,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:18,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:18,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:18,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:18,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:18,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:18,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:18,606 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 11:58:18,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:18,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:18,623 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:18,623 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:18,624 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:18,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:18,624 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:18,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:18,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:18,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:18,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:18,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:18,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:18,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:18,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:18,626 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:18,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:18,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:18,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:18,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:18,627 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:18,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:18,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:18,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:18,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:18,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:18,628 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:18,628 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:18,628 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:18,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:18,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:18,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:18,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:18,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:18,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:18,701 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:18,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_10_true-unreach-call_ground.i [2018-11-23 11:58:18,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894f50637/32e41e58c8d54a4e8930c8b6d4a1a282/FLAG7eb87c0c6 [2018-11-23 11:58:19,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:19,221 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_true-unreach-call_ground.i [2018-11-23 11:58:19,228 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894f50637/32e41e58c8d54a4e8930c8b6d4a1a282/FLAG7eb87c0c6 [2018-11-23 11:58:19,585 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894f50637/32e41e58c8d54a4e8930c8b6d4a1a282 [2018-11-23 11:58:19,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:19,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:19,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:19,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:19,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:19,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19, skipping insertion in model container [2018-11-23 11:58:19,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:19,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:19,851 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:19,856 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:19,882 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:19,907 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:19,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19 WrapperNode [2018-11-23 11:58:19,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:19,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:19,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:19,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:19,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:19,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:19,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:19,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:19,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (1/1) ... [2018-11-23 11:58:19,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:19,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:19,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:19,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:19,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (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 11:58:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:20,736 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:20,736 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:58:20,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:20 BoogieIcfgContainer [2018-11-23 11:58:20,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:20,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:20,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:20,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:20,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:19" (1/3) ... [2018-11-23 11:58:20,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c094b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:20, skipping insertion in model container [2018-11-23 11:58:20,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:19" (2/3) ... [2018-11-23 11:58:20,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c094b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:20, skipping insertion in model container [2018-11-23 11:58:20,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:20" (3/3) ... [2018-11-23 11:58:20,746 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_true-unreach-call_ground.i [2018-11-23 11:58:20,757 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:20,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:20,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:20,816 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:20,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:20,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:20,817 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:20,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:20,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:20,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:20,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:20,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:58:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:20,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:20,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:20,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:20,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1392157819, now seen corresponding path program 1 times [2018-11-23 11:58:20,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:20,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:20,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:21,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:58:21,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-23 11:58:21,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:58:21,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #78#return; {31#true} is VALID [2018-11-23 11:58:21,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret7 := main(); {31#true} is VALID [2018-11-23 11:58:21,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {31#true} is VALID [2018-11-23 11:58:21,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:58:21,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} assume !(0 != ~found~0); {32#false} is VALID [2018-11-23 11:58:21,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {32#false} is VALID [2018-11-23 11:58:21,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {32#false} is VALID [2018-11-23 11:58:21,017 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {32#false} is VALID [2018-11-23 11:58:21,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 11:58:21,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 11:58:21,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:58:21,021 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 11:58:21,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:21,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:21,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:21,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:21,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:21,176 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 11:58:21,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:21,190 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:58:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,493 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2018-11-23 11:58:21,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:21,494 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-23 11:58:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-23 11:58:21,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2018-11-23 11:58:21,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:21,789 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:58:21,789 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:58:21,793 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 11:58:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:58:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:58:21,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:21,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:58:21,844 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:58:21,844 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:58:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,848 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:58:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:58:21,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:21,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:21,849 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:58:21,850 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:58:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,854 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:58:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:58:21,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:21,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:21,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:21,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:58:21,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-11-23 11:58:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:21,860 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:58:21,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:58:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:21,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:21,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:21,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:21,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash 911764976, now seen corresponding path program 1 times [2018-11-23 11:58:21,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:21,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2018-11-23 11:58:21,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {173#true} is VALID [2018-11-23 11:58:21,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2018-11-23 11:58:21,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #78#return; {173#true} is VALID [2018-11-23 11:58:21,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret7 := main(); {173#true} is VALID [2018-11-23 11:58:21,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {173#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {175#(= main_~found~0 0)} is VALID [2018-11-23 11:58:21,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {175#(= main_~found~0 0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {175#(= main_~found~0 0)} is VALID [2018-11-23 11:58:21,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {175#(= main_~found~0 0)} assume !(0 != ~found~0); {175#(= main_~found~0 0)} is VALID [2018-11-23 11:58:21,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {175#(= main_~found~0 0)} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {174#false} is VALID [2018-11-23 11:58:21,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {174#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {174#false} is VALID [2018-11-23 11:58:21,943 INFO L256 TraceCheckUtils]: 10: Hoare triple {174#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {174#false} is VALID [2018-11-23 11:58:21,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {174#false} ~cond := #in~cond; {174#false} is VALID [2018-11-23 11:58:21,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {174#false} assume 0 == ~cond; {174#false} is VALID [2018-11-23 11:58:21,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {174#false} assume !false; {174#false} is VALID [2018-11-23 11:58:21,946 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 11:58:21,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:21,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:21,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:21,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:21,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:21,986 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 11:58:21,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:21,987 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 11:58:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:22,133 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 11:58:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:22,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 11:58:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 11:58:22,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 11:58:22,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:22,539 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:58:22,539 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:58:22,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:58:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:58:22,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:22,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:22,558 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:22,558 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:22,562 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:58:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:22,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:22,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:22,563 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:22,563 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:22,566 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:58:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:22,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:22,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:22,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:22,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:58:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:58:22,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2018-11-23 11:58:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:22,570 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:58:22,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:58:22,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:22,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:22,572 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:22,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash 745989010, now seen corresponding path program 1 times [2018-11-23 11:58:22,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:22,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:22,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:22,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 11:58:22,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {317#true} is VALID [2018-11-23 11:58:22,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 11:58:22,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #78#return; {317#true} is VALID [2018-11-23 11:58:22,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret7 := main(); {317#true} is VALID [2018-11-23 11:58:22,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {320#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:22,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {318#false} is VALID [2018-11-23 11:58:22,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {318#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {318#false} is VALID [2018-11-23 11:58:22,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {318#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {318#false} is VALID [2018-11-23 11:58:22,883 INFO L256 TraceCheckUtils]: 14: Hoare triple {318#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {318#false} is VALID [2018-11-23 11:58:22,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2018-11-23 11:58:22,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2018-11-23 11:58:22,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 11:58:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:22,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:22,887 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 11:58:22,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:22,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:23,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 11:58:23,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {317#true} is VALID [2018-11-23 11:58:23,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 11:58:23,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #78#return; {317#true} is VALID [2018-11-23 11:58:23,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret7 := main(); {317#true} is VALID [2018-11-23 11:58:23,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:23,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:23,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:23,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:23,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:23,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {346#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:23,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {339#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0 - 1); {318#false} is VALID [2018-11-23 11:58:23,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {318#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {318#false} is VALID [2018-11-23 11:58:23,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {318#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {318#false} is VALID [2018-11-23 11:58:23,491 INFO L256 TraceCheckUtils]: 14: Hoare triple {318#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {318#false} is VALID [2018-11-23 11:58:23,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2018-11-23 11:58:23,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2018-11-23 11:58:23,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 11:58:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:58:23,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:58:23,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:23,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:23,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:23,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:23,648 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 11:58:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,233 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 11:58:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:24,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:58:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 11:58:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 11:58:24,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-23 11:58:24,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:24,355 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:58:24,356 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:58:24,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:58:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-11-23 11:58:24,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:24,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 31 states. [2018-11-23 11:58:24,390 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 31 states. [2018-11-23 11:58:24,391 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 31 states. [2018-11-23 11:58:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,395 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 11:58:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:58:24,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:24,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:24,397 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 43 states. [2018-11-23 11:58:24,397 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 43 states. [2018-11-23 11:58:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,401 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 11:58:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:58:24,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:24,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:24,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:24,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:58:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:58:24,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-23 11:58:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:24,405 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:58:24,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:58:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:58:24,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:24,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:24,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:24,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -689473712, now seen corresponding path program 1 times [2018-11-23 11:58:24,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:24,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:24,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:24,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:24,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2018-11-23 11:58:24,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {582#true} is VALID [2018-11-23 11:58:24,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2018-11-23 11:58:24,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #78#return; {582#true} is VALID [2018-11-23 11:58:24,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret7 := main(); {582#true} is VALID [2018-11-23 11:58:24,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {585#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {584#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {586#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:24,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#(<= (+ main_~i~0 99999) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {583#false} is VALID [2018-11-23 11:58:24,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {583#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {583#false} is VALID [2018-11-23 11:58:24,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {583#false} is VALID [2018-11-23 11:58:24,581 INFO L256 TraceCheckUtils]: 16: Hoare triple {583#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {583#false} is VALID [2018-11-23 11:58:24,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {583#false} ~cond := #in~cond; {583#false} is VALID [2018-11-23 11:58:24,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {583#false} assume 0 == ~cond; {583#false} is VALID [2018-11-23 11:58:24,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {583#false} assume !false; {583#false} is VALID [2018-11-23 11:58:24,585 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 11:58:24,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:24,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:24,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:24,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2018-11-23 11:58:24,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {582#true} is VALID [2018-11-23 11:58:24,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2018-11-23 11:58:24,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #78#return; {582#true} is VALID [2018-11-23 11:58:24,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret7 := main(); {582#true} is VALID [2018-11-23 11:58:24,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:24,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:24,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {612#(and (<= main_~pos~0 0) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:24,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:24,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {628#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:24,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {583#false} is VALID [2018-11-23 11:58:24,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {583#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {583#false} is VALID [2018-11-23 11:58:24,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {583#false} is VALID [2018-11-23 11:58:24,868 INFO L256 TraceCheckUtils]: 16: Hoare triple {583#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {583#false} is VALID [2018-11-23 11:58:24,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {583#false} ~cond := #in~cond; {583#false} is VALID [2018-11-23 11:58:24,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {583#false} assume 0 == ~cond; {583#false} is VALID [2018-11-23 11:58:24,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {583#false} assume !false; {583#false} is VALID [2018-11-23 11:58:24,871 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 11:58:24,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:24,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:58:24,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:58:24,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:24,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:24,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:24,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:24,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:24,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:24,957 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 8 states. [2018-11-23 11:58:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,493 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-23 11:58:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:25,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:58:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 11:58:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 11:58:25,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2018-11-23 11:58:25,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:25,677 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:58:25,677 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:58:25,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:58:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-11-23 11:58:25,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:25,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 33 states. [2018-11-23 11:58:25,723 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 33 states. [2018-11-23 11:58:25,724 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 33 states. [2018-11-23 11:58:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,728 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 11:58:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 11:58:25,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:25,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:25,730 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 51 states. [2018-11-23 11:58:25,730 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 51 states. [2018-11-23 11:58:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,734 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 11:58:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 11:58:25,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:25,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:25,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:25,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:58:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 11:58:25,738 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-11-23 11:58:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:25,738 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 11:58:25,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:58:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:58:25,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:25,739 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:25,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:25,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1067850453, now seen corresponding path program 2 times [2018-11-23 11:58:25,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:25,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:25,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:25,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:25,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 11:58:25,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 11:58:25,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 11:58:25,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #78#return; {886#true} is VALID [2018-11-23 11:58:25,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret7 := main(); {886#true} is VALID [2018-11-23 11:58:25,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {886#true} is VALID [2018-11-23 11:58:25,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {886#true} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {886#true} is VALID [2018-11-23 11:58:25,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {886#true} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {888#(= main_~found~0 1)} is VALID [2018-11-23 11:58:25,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(= main_~found~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {888#(= main_~found~0 1)} is VALID [2018-11-23 11:58:25,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {888#(= main_~found~0 1)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {887#false} is VALID [2018-11-23 11:58:25,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {887#false} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {887#false} is VALID [2018-11-23 11:58:25,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {887#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {887#false} is VALID [2018-11-23 11:58:25,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {887#false} assume !(~i~0 < ~n~0 && 0 == ~found~0); {887#false} is VALID [2018-11-23 11:58:25,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {887#false} assume 0 != ~found~0;~i~0 := ~pos~0; {887#false} is VALID [2018-11-23 11:58:25,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {887#false} assume !(~i~0 < ~n~0 - 1); {887#false} is VALID [2018-11-23 11:58:25,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {887#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {887#false} is VALID [2018-11-23 11:58:25,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {887#false} is VALID [2018-11-23 11:58:25,795 INFO L256 TraceCheckUtils]: 17: Hoare triple {887#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {887#false} is VALID [2018-11-23 11:58:25,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 11:58:25,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 11:58:25,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 11:58:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:25,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:25,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:58:25,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:25,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:25,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:25,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:25,840 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-23 11:58:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,928 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 11:58:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:25,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:58:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:58:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:58:25,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 11:58:26,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:26,023 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:58:26,023 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:58:26,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:58:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:58:26,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:26,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:58:26,061 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:58:26,061 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:58:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:26,063 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 11:58:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:58:26,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:26,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:26,064 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:58:26,064 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:58:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:26,066 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 11:58:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:58:26,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:26,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:26,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:26,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:58:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 11:58:26,069 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-23 11:58:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:26,070 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 11:58:26,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:58:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:58:26,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:26,071 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:26,071 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:26,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash 56733203, now seen corresponding path program 1 times [2018-11-23 11:58:26,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:26,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:26,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1076#true} is VALID [2018-11-23 11:58:26,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {1076#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1076#true} is VALID [2018-11-23 11:58:26,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2018-11-23 11:58:26,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #78#return; {1076#true} is VALID [2018-11-23 11:58:26,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret7 := main(); {1076#true} is VALID [2018-11-23 11:58:26,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:26,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:26,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:26,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1078#(and (<= 100000 main_~n~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1079#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {1079#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1079#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1079#(<= (+ main_~i~0 99999) main_~n~0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1080#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {1080#(<= (+ main_~pos~0 99999) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1080#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {1080#(<= (+ main_~pos~0 99999) main_~n~0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1080#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#(<= (+ main_~pos~0 99999) main_~n~0)} assume 0 != ~found~0;~i~0 := ~pos~0; {1079#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:26,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {1079#(<= (+ main_~i~0 99999) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {1077#false} is VALID [2018-11-23 11:58:26,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {1077#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1077#false} is VALID [2018-11-23 11:58:26,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {1077#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1077#false} is VALID [2018-11-23 11:58:26,206 INFO L256 TraceCheckUtils]: 17: Hoare triple {1077#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1077#false} is VALID [2018-11-23 11:58:26,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {1077#false} ~cond := #in~cond; {1077#false} is VALID [2018-11-23 11:58:26,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {1077#false} assume 0 == ~cond; {1077#false} is VALID [2018-11-23 11:58:26,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2018-11-23 11:58:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:26,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:26,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:26,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:26,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:26,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1076#true} is VALID [2018-11-23 11:58:26,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {1076#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1076#true} is VALID [2018-11-23 11:58:26,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2018-11-23 11:58:26,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #78#return; {1076#true} is VALID [2018-11-23 11:58:26,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret7 := main(); {1076#true} is VALID [2018-11-23 11:58:26,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:26,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:26,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:26,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {1099#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:26,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {1109#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {1077#false} is VALID [2018-11-23 11:58:26,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {1077#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1077#false} is VALID [2018-11-23 11:58:26,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {1077#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1077#false} is VALID [2018-11-23 11:58:26,416 INFO L256 TraceCheckUtils]: 17: Hoare triple {1077#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1077#false} is VALID [2018-11-23 11:58:26,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {1077#false} ~cond := #in~cond; {1077#false} is VALID [2018-11-23 11:58:26,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {1077#false} assume 0 == ~cond; {1077#false} is VALID [2018-11-23 11:58:26,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2018-11-23 11:58:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:26,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:58:26,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 11:58:26,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:26,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:26,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:26,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:26,490 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-23 11:58:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:27,005 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 11:58:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:27,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 11:58:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 11:58:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 11:58:27,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 11:58:27,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:27,112 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:58:27,112 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:58:27,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:58:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-23 11:58:27,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:27,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 39 states. [2018-11-23 11:58:27,183 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 39 states. [2018-11-23 11:58:27,183 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 39 states. [2018-11-23 11:58:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:27,186 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:58:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:58:27,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:27,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:27,187 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 49 states. [2018-11-23 11:58:27,188 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 49 states. [2018-11-23 11:58:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:27,191 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:58:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:58:27,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:27,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:27,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:27,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:58:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 11:58:27,194 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2018-11-23 11:58:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 11:58:27,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:58:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:58:27,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:27,196 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:27,196 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:27,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1484647538, now seen corresponding path program 2 times [2018-11-23 11:58:27,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:27,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:27,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:27,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 11:58:27,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 11:58:27,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 11:58:27,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #78#return; {1386#true} is VALID [2018-11-23 11:58:27,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret7 := main(); {1386#true} is VALID [2018-11-23 11:58:27,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {1389#(and (= 0 main_~pos~0) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:27,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {1388#(and (= 0 main_~i~0) (<= 100000 main_~n~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1390#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:27,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {1390#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1390#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:27,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {1390#(<= (+ main_~i~0 99999) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1391#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:27,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {1391#(<= (+ main_~i~0 99998) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {1387#false} is VALID [2018-11-23 11:58:27,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {1387#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1387#false} is VALID [2018-11-23 11:58:27,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {1387#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1387#false} is VALID [2018-11-23 11:58:27,410 INFO L256 TraceCheckUtils]: 18: Hoare triple {1387#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1387#false} is VALID [2018-11-23 11:58:27,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2018-11-23 11:58:27,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2018-11-23 11:58:27,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 11:58:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:27,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:27,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:27,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:27,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:27,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 11:58:27,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 11:58:27,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 11:58:27,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #78#return; {1386#true} is VALID [2018-11-23 11:58:27,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret7 := main(); {1386#true} is VALID [2018-11-23 11:58:27,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1410#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:27,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {1410#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1410#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:27,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {1410#(<= main_~i~0 0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#(<= main_~pos~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#(<= main_~pos~0 0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#(<= main_~pos~0 0)} assume 0 != ~found~0;~i~0 := ~pos~0; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#(<= main_~pos~0 0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#(<= main_~pos~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#(<= main_~pos~0 0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#(<= main_~pos~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {1417#(<= main_~pos~0 0)} assume !(~i~0 < ~n~0 - 1); {1417#(<= main_~pos~0 0)} is VALID [2018-11-23 11:58:27,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {1417#(<= main_~pos~0 0)} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1445#(and (<= main_~pos~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 11:58:27,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {1445#(and (<= main_~pos~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1387#false} is VALID [2018-11-23 11:58:27,611 INFO L256 TraceCheckUtils]: 18: Hoare triple {1387#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1387#false} is VALID [2018-11-23 11:58:27,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2018-11-23 11:58:27,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2018-11-23 11:58:27,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 11:58:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:27,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:27,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:58:27,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:58:27,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:27,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:27,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:27,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:27,694 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-11-23 11:58:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,476 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:58:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:28,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:58:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:58:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:58:28,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 11:58:28,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:28,648 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:58:28,648 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:58:28,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:58:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 11:58:28,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:28,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 34 states. [2018-11-23 11:58:28,690 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 34 states. [2018-11-23 11:58:28,690 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 34 states. [2018-11-23 11:58:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,694 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:58:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:58:28,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,695 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 39 states. [2018-11-23 11:58:28,695 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 39 states. [2018-11-23 11:58:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,698 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:58:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:58:28,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:28,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:58:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 11:58:28,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2018-11-23 11:58:28,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:28,701 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 11:58:28,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:58:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:58:28,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:28,703 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:28,703 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1639340655, now seen corresponding path program 1 times [2018-11-23 11:58:28,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:28,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2018-11-23 11:58:28,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {1681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1681#true} is VALID [2018-11-23 11:58:28,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {1681#true} assume true; {1681#true} is VALID [2018-11-23 11:58:28,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1681#true} {1681#true} #78#return; {1681#true} is VALID [2018-11-23 11:58:28,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {1681#true} call #t~ret7 := main(); {1681#true} is VALID [2018-11-23 11:58:28,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:28,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:28,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:28,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {1683#(and (<= 100000 main_~n~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1684#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {1684#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1684#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {1684#(<= (+ main_~i~0 99999) main_~n~0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1685#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {1685#(<= (+ main_~pos~0 99999) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1685#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {1685#(<= (+ main_~pos~0 99999) main_~n~0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1685#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#(<= (+ main_~pos~0 99999) main_~n~0)} assume 0 != ~found~0;~i~0 := ~pos~0; {1684#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {1684#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1684#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:28,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {1684#(<= (+ main_~i~0 99999) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1686#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:28,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {1686#(<= (+ main_~i~0 99998) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {1682#false} is VALID [2018-11-23 11:58:28,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {1682#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1682#false} is VALID [2018-11-23 11:58:28,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {1682#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1682#false} is VALID [2018-11-23 11:58:28,880 INFO L256 TraceCheckUtils]: 19: Hoare triple {1682#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1682#false} is VALID [2018-11-23 11:58:28,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2018-11-23 11:58:28,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2018-11-23 11:58:28,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2018-11-23 11:58:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:28,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:28,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:28,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:28,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:29,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2018-11-23 11:58:29,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {1681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1681#true} is VALID [2018-11-23 11:58:29,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {1681#true} assume true; {1681#true} is VALID [2018-11-23 11:58:29,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1681#true} {1681#true} #78#return; {1681#true} is VALID [2018-11-23 11:58:29,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {1681#true} call #t~ret7 := main(); {1681#true} is VALID [2018-11-23 11:58:29,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:29,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:29,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:29,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {1705#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1722#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {1715#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1738#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:29,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {1738#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {1682#false} is VALID [2018-11-23 11:58:29,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {1682#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1682#false} is VALID [2018-11-23 11:58:29,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {1682#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1682#false} is VALID [2018-11-23 11:58:29,132 INFO L256 TraceCheckUtils]: 19: Hoare triple {1682#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1682#false} is VALID [2018-11-23 11:58:29,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2018-11-23 11:58:29,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2018-11-23 11:58:29,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2018-11-23 11:58:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:29,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:29,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:58:29,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:58:29,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:29,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:58:29,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:29,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:58:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:58:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:29,248 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 10 states. [2018-11-23 11:58:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,879 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 11:58:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:29,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:58:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 11:58:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 11:58:29,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 11:58:29,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:29,966 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:58:29,967 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:58:29,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:58:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2018-11-23 11:58:30,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:30,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 36 states. [2018-11-23 11:58:30,017 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 36 states. [2018-11-23 11:58:30,017 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 36 states. [2018-11-23 11:58:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,020 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:58:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:58:30,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,021 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 49 states. [2018-11-23 11:58:30,021 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 49 states. [2018-11-23 11:58:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,023 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:58:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:58:30,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:30,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:58:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 11:58:30,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2018-11-23 11:58:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:30,026 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 11:58:30,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:58:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 11:58:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:58:30,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:30,027 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:30,028 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:30,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 675629042, now seen corresponding path program 2 times [2018-11-23 11:58:30,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {1994#true} call ULTIMATE.init(); {1994#true} is VALID [2018-11-23 11:58:30,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {1994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1994#true} is VALID [2018-11-23 11:58:30,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {1994#true} assume true; {1994#true} is VALID [2018-11-23 11:58:30,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1994#true} {1994#true} #78#return; {1994#true} is VALID [2018-11-23 11:58:30,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {1994#true} call #t~ret7 := main(); {1994#true} is VALID [2018-11-23 11:58:30,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {1994#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:30,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:30,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:30,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {1996#(and (<= 100000 main_~n~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1997#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:30,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {1997#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1997#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:30,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {1997#(<= (+ main_~i~0 99999) main_~n~0)} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {1997#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:30,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {1997#(<= (+ main_~i~0 99999) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1998#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {1998#(<= (+ main_~i~0 99998) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {1998#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {1998#(<= (+ main_~i~0 99998) main_~n~0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {1999#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {1999#(<= (+ main_~pos~0 99998) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1999#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {1999#(<= (+ main_~pos~0 99998) main_~n~0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {1999#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {1999#(<= (+ main_~pos~0 99998) main_~n~0)} assume 0 != ~found~0;~i~0 := ~pos~0; {1998#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:30,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#(<= (+ main_~i~0 99998) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {1995#false} is VALID [2018-11-23 11:58:30,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {1995#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1995#false} is VALID [2018-11-23 11:58:30,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {1995#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1995#false} is VALID [2018-11-23 11:58:30,198 INFO L256 TraceCheckUtils]: 20: Hoare triple {1995#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1995#false} is VALID [2018-11-23 11:58:30,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1995#false} ~cond := #in~cond; {1995#false} is VALID [2018-11-23 11:58:30,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {1995#false} assume 0 == ~cond; {1995#false} is VALID [2018-11-23 11:58:30,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {1995#false} assume !false; {1995#false} is VALID [2018-11-23 11:58:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:30,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:30,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:30,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:30,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:30,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {1994#true} call ULTIMATE.init(); {1994#true} is VALID [2018-11-23 11:58:30,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1994#true} is VALID [2018-11-23 11:58:30,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1994#true} assume true; {1994#true} is VALID [2018-11-23 11:58:30,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1994#true} {1994#true} #78#return; {1994#true} is VALID [2018-11-23 11:58:30,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {1994#true} call #t~ret7 := main(); {1994#true} is VALID [2018-11-23 11:58:30,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1994#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:30,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:30,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:30,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {2018#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {2028#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {2045#(and (<= main_~pos~0 2) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:30,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {2038#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {1995#false} is VALID [2018-11-23 11:58:30,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1995#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {1995#false} is VALID [2018-11-23 11:58:30,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {1995#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {1995#false} is VALID [2018-11-23 11:58:30,408 INFO L256 TraceCheckUtils]: 20: Hoare triple {1995#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {1995#false} is VALID [2018-11-23 11:58:30,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {1995#false} ~cond := #in~cond; {1995#false} is VALID [2018-11-23 11:58:30,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1995#false} assume 0 == ~cond; {1995#false} is VALID [2018-11-23 11:58:30,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {1995#false} assume !false; {1995#false} is VALID [2018-11-23 11:58:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:30,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:30,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:58:30,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:58:30,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:30,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:58:30,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:30,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:58:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:58:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:30,514 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 10 states. [2018-11-23 11:58:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,049 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:58:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:31,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:58:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:58:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:58:31,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2018-11-23 11:58:31,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,148 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:58:31,148 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:58:31,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:58:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-11-23 11:58:31,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:31,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 42 states. [2018-11-23 11:58:31,187 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 42 states. [2018-11-23 11:58:31,188 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 42 states. [2018-11-23 11:58:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,191 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 11:58:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:58:31,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,192 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 52 states. [2018-11-23 11:58:31,192 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 52 states. [2018-11-23 11:58:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,194 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 11:58:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:58:31,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:31,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:58:31,197 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-11-23 11:58:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:31,197 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:58:31,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:58:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:58:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:58:31,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:31,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:31,198 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:31,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash 521254287, now seen corresponding path program 2 times [2018-11-23 11:58:31,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:31,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:31,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {2329#true} call ULTIMATE.init(); {2329#true} is VALID [2018-11-23 11:58:31,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {2329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2329#true} is VALID [2018-11-23 11:58:31,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 11:58:31,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2329#true} {2329#true} #78#return; {2329#true} is VALID [2018-11-23 11:58:31,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {2329#true} call #t~ret7 := main(); {2329#true} is VALID [2018-11-23 11:58:31,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {2329#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:31,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:31,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:31,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {2331#(and (<= 100000 main_~n~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2332#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {2332#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2332#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {2332#(<= (+ main_~i~0 99999) main_~n~0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {2333#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#(<= (+ main_~pos~0 99999) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2333#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2333#(<= (+ main_~pos~0 99999) main_~n~0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {2333#(<= (+ main_~pos~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2333#(<= (+ main_~pos~0 99999) main_~n~0)} assume 0 != ~found~0;~i~0 := ~pos~0; {2332#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {2332#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2332#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:31,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {2332#(<= (+ main_~i~0 99999) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2334#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:31,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {2334#(<= (+ main_~i~0 99998) main_~n~0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2334#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:31,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {2334#(<= (+ main_~i~0 99998) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2335#(<= (+ main_~i~0 99997) main_~n~0)} is VALID [2018-11-23 11:58:31,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {2335#(<= (+ main_~i~0 99997) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {2330#false} is VALID [2018-11-23 11:58:31,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {2330#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {2330#false} is VALID [2018-11-23 11:58:31,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {2330#false} is VALID [2018-11-23 11:58:31,337 INFO L256 TraceCheckUtils]: 21: Hoare triple {2330#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {2330#false} is VALID [2018-11-23 11:58:31,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {2330#false} ~cond := #in~cond; {2330#false} is VALID [2018-11-23 11:58:31,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {2330#false} assume 0 == ~cond; {2330#false} is VALID [2018-11-23 11:58:31,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {2330#false} assume !false; {2330#false} is VALID [2018-11-23 11:58:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:31,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:31,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:31,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:31,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:31,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:31,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {2329#true} call ULTIMATE.init(); {2329#true} is VALID [2018-11-23 11:58:31,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {2329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2329#true} is VALID [2018-11-23 11:58:31,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 11:58:31,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2329#true} {2329#true} #78#return; {2329#true} is VALID [2018-11-23 11:58:31,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {2329#true} call #t~ret7 := main(); {2329#true} is VALID [2018-11-23 11:58:31,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {2329#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:31,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:31,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 11:58:31,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {2354#(and (<= 100000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {2371#(and (<= main_~pos~0 1) (<= 100000 main_~n~0))} assume 0 != ~found~0;~i~0 := ~pos~0; {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {2364#(and (<= main_~i~0 1) (<= 100000 main_~n~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2387#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {2387#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2387#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {2387#(and (<= main_~i~0 2) (<= 100000 main_~n~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2394#(and (<= main_~i~0 3) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:31,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {2394#(and (<= main_~i~0 3) (<= 100000 main_~n~0))} assume !(~i~0 < ~n~0 - 1); {2330#false} is VALID [2018-11-23 11:58:31,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {2330#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {2330#false} is VALID [2018-11-23 11:58:31,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {2330#false} is VALID [2018-11-23 11:58:31,556 INFO L256 TraceCheckUtils]: 21: Hoare triple {2330#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {2330#false} is VALID [2018-11-23 11:58:31,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {2330#false} ~cond := #in~cond; {2330#false} is VALID [2018-11-23 11:58:31,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {2330#false} assume 0 == ~cond; {2330#false} is VALID [2018-11-23 11:58:31,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {2330#false} assume !false; {2330#false} is VALID [2018-11-23 11:58:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:31,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:31,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:58:31,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:58:31,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:31,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:31,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:31,618 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-23 11:58:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,186 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 11:58:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:32,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:58:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2018-11-23 11:58:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2018-11-23 11:58:32,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2018-11-23 11:58:32,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:32,347 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:58:32,347 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:58:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:58:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-23 11:58:32,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:32,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 44 states. [2018-11-23 11:58:32,462 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 44 states. [2018-11-23 11:58:32,462 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 44 states. [2018-11-23 11:58:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,464 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 11:58:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:58:32,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:32,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:32,465 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 58 states. [2018-11-23 11:58:32,465 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 58 states. [2018-11-23 11:58:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:32,466 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 11:58:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:58:32,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:32,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:32,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:32,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:58:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 11:58:32,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2018-11-23 11:58:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 11:58:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 11:58:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:58:32,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:32,470 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:32,470 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:32,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 414073776, now seen corresponding path program 3 times [2018-11-23 11:58:32,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:32,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:32,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {2694#true} call ULTIMATE.init(); {2694#true} is VALID [2018-11-23 11:58:32,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {2694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2694#true} is VALID [2018-11-23 11:58:32,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {2694#true} assume true; {2694#true} is VALID [2018-11-23 11:58:32,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2694#true} {2694#true} #78#return; {2694#true} is VALID [2018-11-23 11:58:32,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {2694#true} call #t~ret7 := main(); {2694#true} is VALID [2018-11-23 11:58:32,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:32,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:32,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:32,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(and (<= 100000 main_~n~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2697#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:32,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {2697#(<= (+ main_~i~0 99999) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2697#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:32,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {2697#(<= (+ main_~i~0 99999) main_~n~0)} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2697#(<= (+ main_~i~0 99999) main_~n~0)} is VALID [2018-11-23 11:58:32,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {2697#(<= (+ main_~i~0 99999) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2698#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {2698#(<= (+ main_~i~0 99998) main_~n~0)} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2698#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(<= (+ main_~i~0 99998) main_~n~0)} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {2699#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {2699#(<= (+ main_~pos~0 99998) main_~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2699#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {2699#(<= (+ main_~pos~0 99998) main_~n~0)} assume !(~i~0 < ~n~0 && 0 == ~found~0); {2699#(<= (+ main_~pos~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(<= (+ main_~pos~0 99998) main_~n~0)} assume 0 != ~found~0;~i~0 := ~pos~0; {2698#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {2698#(<= (+ main_~i~0 99998) main_~n~0)} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2698#(<= (+ main_~i~0 99998) main_~n~0)} is VALID [2018-11-23 11:58:32,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {2698#(<= (+ main_~i~0 99998) main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2700#(<= (+ main_~i~0 99997) main_~n~0)} is VALID [2018-11-23 11:58:32,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {2700#(<= (+ main_~i~0 99997) main_~n~0)} assume !(~i~0 < ~n~0 - 1); {2695#false} is VALID [2018-11-23 11:58:32,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {2695#false} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {2695#false} is VALID [2018-11-23 11:58:32,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {2695#false} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {2695#false} is VALID [2018-11-23 11:58:32,768 INFO L256 TraceCheckUtils]: 22: Hoare triple {2695#false} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {2695#false} is VALID [2018-11-23 11:58:32,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {2695#false} ~cond := #in~cond; {2695#false} is VALID [2018-11-23 11:58:32,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {2695#false} assume 0 == ~cond; {2695#false} is VALID [2018-11-23 11:58:32,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {2695#false} assume !false; {2695#false} is VALID [2018-11-23 11:58:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:32,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:32,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:32,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:58:32,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:32,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:33,202 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 26 [2018-11-23 11:58:33,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:58:33,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 53 [2018-11-23 11:58:33,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:58:33,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:58:33,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:58:33,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:70 [2018-11-23 11:58:33,288 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:33,289 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|]. (let ((.cse0 (select |v_#memory_int_7| |main_~#vectorx~0.base|))) (and (= (store |v_#memory_int_7| |main_~#vectorx~0.base| (let ((.cse1 (* 4 main_~i~0))) (store .cse0 (+ |main_~#vectorx~0.offset| .cse1) (select .cse0 (+ |main_~#vectorx~0.offset| .cse1 4))))) |#memory_int|) (= 0 |main_~#vectorx~0.offset|) (not (= (select .cse0 |main_~#vectorx~0.offset|) main_~element~0)) (<= 100000 main_~n~0))) [2018-11-23 11:58:33,289 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (* 4 main_~i~0))) (let ((.cse3 (select |#memory_int| |main_~#vectorx~0.base|)) (.cse4 (+ |main_~#vectorx~0.offset| .cse5))) (let ((.cse0 (= (select .cse3 (+ |main_~#vectorx~0.offset| .cse5 4)) (select .cse3 .cse4))) (.cse1 (= 0 |main_~#vectorx~0.offset|)) (.cse2 (<= 100000 main_~n~0))) (or (and .cse0 .cse1 .cse2 (not (= (select .cse3 |main_~#vectorx~0.offset|) main_~element~0))) (and .cse0 .cse1 (= |main_~#vectorx~0.offset| .cse4) .cse2))))) [2018-11-23 11:58:39,519 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:58:49,632 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:58:51,728 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:58:51,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:58:51,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:58:51,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:58:51,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:58:51,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-11-23 11:58:51,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:4 [2018-11-23 11:58:51,805 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:51,806 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#vectorx~0.base|, v_main_~i~0_22]. (let ((.cse1 (select |#memory_int| |main_~#vectorx~0.base|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 main_~element~0)) (<= 99998 v_main_~i~0_22) (let ((.cse2 (* 4 v_main_~i~0_22))) (= (select .cse1 (+ .cse2 4)) (select .cse1 .cse2))) (= .cse0 |main_#t~mem6|)))) [2018-11-23 11:58:51,806 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem6| main_~element~0)) [2018-11-23 11:58:51,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {2694#true} call ULTIMATE.init(); {2694#true} is VALID [2018-11-23 11:58:51,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {2694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2694#true} is VALID [2018-11-23 11:58:51,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {2694#true} assume true; {2694#true} is VALID [2018-11-23 11:58:51,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2694#true} {2694#true} #78#return; {2694#true} is VALID [2018-11-23 11:58:51,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {2694#true} call #t~ret7 := main(); {2694#true} is VALID [2018-11-23 11:58:51,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#true} havoc ~i~0;~n~0 := 100000;havoc ~pos~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~element~0 := #t~nondet0;havoc #t~nondet0;~found~0 := 0;call ~#vectorx~0.base, ~#vectorx~0.offset := #Ultimate.alloc(4 * ~n~0);~i~0 := 0; {2719#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {2719#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2723#(and (= 0 |main_~#vectorx~0.offset|) (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) |main_#t~mem2|) (<= 100000 main_~n~0))} is VALID [2018-11-23 11:58:51,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {2723#(and (= 0 |main_~#vectorx~0.offset|) (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) |main_#t~mem2|) (<= 100000 main_~n~0))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !(#t~mem2 == ~element~0);havoc #t~mem2; {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !!(~i~0 < ~n~0 && 0 == ~found~0);call #t~mem2 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4); {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume #t~mem2 == ~element~0;havoc #t~mem2;~found~0 := 1;~pos~0 := ~i~0; {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !(~i~0 < ~n~0 && 0 == ~found~0); {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {2746#(and (= 0 |main_~#vectorx~0.offset|) (= 1 main_~found~0) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume 0 != ~found~0;~i~0 := ~pos~0; {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !!(~i~0 < ~n~0 - 1);call #t~mem4 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * (1 + ~i~0), 4);call write~int(#t~mem4, ~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2759#(or (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0)))) (= 0 |main_~#vectorx~0.offset|) (= 0 (* 4 main_~i~0)) (<= 100000 main_~n~0)) (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0)))) (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0))))} is VALID [2018-11-23 11:58:51,913 INFO L273 TraceCheckUtils]: 18: Hoare triple {2759#(or (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0)))) (= 0 |main_~#vectorx~0.offset|) (= 0 (* 4 main_~i~0)) (<= 100000 main_~n~0)) (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~i~0)))) (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2763#(or (and (= 0 |main_~#vectorx~0.offset|) (<= main_~i~0 1) (<= 100000 main_~n~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|))) (and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)) (exists ((v_main_~i~0_22 Int)) (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))) (<= main_~i~0 (+ v_main_~i~0_22 1))))))} is VALID [2018-11-23 11:58:51,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {2763#(or (and (= 0 |main_~#vectorx~0.offset|) (<= main_~i~0 1) (<= 100000 main_~n~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|))) (and (= 0 |main_~#vectorx~0.offset|) (<= 100000 main_~n~0) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)) (exists ((v_main_~i~0_22 Int)) (and (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))) (<= main_~i~0 (+ v_main_~i~0_22 1))))))} assume !(~i~0 < ~n~0 - 1); {2767#(and (= 0 |main_~#vectorx~0.offset|) (exists ((v_main_~i~0_22 Int)) (and (<= 99998 v_main_~i~0_22) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))))) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {2767#(and (= 0 |main_~#vectorx~0.offset|) (exists ((v_main_~i~0_22 Int)) (and (<= 99998 v_main_~i~0_22) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))))) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume 0 != ~found~0;havoc ~x~0;~x~0 := 0; {2771#(and (= 0 |main_~#vectorx~0.offset|) (= main_~x~0 0) (exists ((v_main_~i~0_22 Int)) (and (<= 99998 v_main_~i~0_22) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))))) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} is VALID [2018-11-23 11:58:51,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {2771#(and (= 0 |main_~#vectorx~0.offset|) (= main_~x~0 0) (exists ((v_main_~i~0_22 Int)) (and (<= 99998 v_main_~i~0_22) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22) 4)) (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 v_main_~i~0_22)))))) (not (= (select (select |#memory_int| |main_~#vectorx~0.base|) |main_~#vectorx~0.offset|) main_~element~0)))} assume !!(~x~0 < ~pos~0);call #t~mem6 := read~int(~#vectorx~0.base, ~#vectorx~0.offset + 4 * ~x~0, 4); {2775#(not (= |main_#t~mem6| main_~element~0))} is VALID [2018-11-23 11:58:51,917 INFO L256 TraceCheckUtils]: 22: Hoare triple {2775#(not (= |main_#t~mem6| main_~element~0))} call __VERIFIER_assert((if #t~mem6 != ~element~0 then 1 else 0)); {2779#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:51,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {2779#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2783#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:58:51,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {2783#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2695#false} is VALID [2018-11-23 11:58:51,919 INFO L273 TraceCheckUtils]: 25: Hoare triple {2695#false} assume !false; {2695#false} is VALID [2018-11-23 11:58:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:58:51,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:51,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-11-23 11:58:51,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-11-23 11:58:51,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:51,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:52,038 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 11:58:52,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=254, Unknown=6, NotChecked=0, Total=306 [2018-11-23 11:58:52,039 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 18 states. [2018-11-23 12:00:40,362 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 42