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/standard_init2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:24,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:24,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:24,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:24,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:24,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:24,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:24,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:24,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:24,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:24,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:24,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:24,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:24,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:24,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:24,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:24,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:24,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:24,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:24,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:24,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:24,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:24,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:24,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:24,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:24,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:24,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:24,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:24,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:24,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:24,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:24,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:24,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:24,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:24,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:24,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:24,618 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 12:02:24,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:24,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:24,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:24,635 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:24,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:24,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:24,636 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:24,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:24,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:24,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:24,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:24,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:24,639 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:24,640 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:24,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:24,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:24,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:24,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:24,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:24,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:24,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:24,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:24,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:24,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:24,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:24,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:24,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:24,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:24,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:24,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:24,749 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:24,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_true-unreach-call_ground.i [2018-11-23 12:02:24,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ab5fbc8/55b6b1d18afa40b3833699b194ffd5a1/FLAGad0dddf99 [2018-11-23 12:02:25,269 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:25,270 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_true-unreach-call_ground.i [2018-11-23 12:02:25,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ab5fbc8/55b6b1d18afa40b3833699b194ffd5a1/FLAGad0dddf99 [2018-11-23 12:02:25,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ab5fbc8/55b6b1d18afa40b3833699b194ffd5a1 [2018-11-23 12:02:25,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:25,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:25,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:25,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:25,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:25,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:25" (1/1) ... [2018-11-23 12:02:25,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fecae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:25, skipping insertion in model container [2018-11-23 12:02:25,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:25" (1/1) ... [2018-11-23 12:02:25,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:25,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:25,960 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:25,964 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:25,993 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:26,027 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:26,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26 WrapperNode [2018-11-23 12:02:26,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:26,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:26,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:26,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:26,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:26,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:26,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:26,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:26,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (1/1) ... [2018-11-23 12:02:26,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:26,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:26,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:26,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:26,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (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 12:02:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:26,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:26,736 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:26,737 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:02:26,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:26 BoogieIcfgContainer [2018-11-23 12:02:26,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:26,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:26,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:26,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:26,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:25" (1/3) ... [2018-11-23 12:02:26,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c0b918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:26, skipping insertion in model container [2018-11-23 12:02:26,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:26" (2/3) ... [2018-11-23 12:02:26,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c0b918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:26, skipping insertion in model container [2018-11-23 12:02:26,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:26" (3/3) ... [2018-11-23 12:02:26,750 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_true-unreach-call_ground.i [2018-11-23 12:02:26,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:26,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:26,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:26,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:26,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:26,825 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:26,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:26,827 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:26,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:26,827 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:26,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:26,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:02:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:02:26,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:26,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:26,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:26,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2104113866, now seen corresponding path program 1 times [2018-11-23 12:02:26,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:26,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:02:27,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:02:27,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:02:27,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #61#return; {28#true} is VALID [2018-11-23 12:02:27,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2018-11-23 12:02:27,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28#true} is VALID [2018-11-23 12:02:27,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:02:27,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2018-11-23 12:02:27,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !(~i~0 < 100000); {29#false} is VALID [2018-11-23 12:02:27,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 12:02:27,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 12:02:27,017 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {29#false} is VALID [2018-11-23 12:02:27,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 12:02:27,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 12:02:27,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:02:27,022 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 12:02:27,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:27,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:02:27,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:27,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:27,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:27,124 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:02:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,344 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 12:02:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:27,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:02:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:02:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:02:27,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 12:02:27,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:27,664 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:02:27,664 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:02:27,668 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 12:02:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:02:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:02:27,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:27,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:27,776 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:27,776 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,780 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:02:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:02:27,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:27,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:27,781 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:27,781 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,785 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:02:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:02:27,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:27,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:27,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:27,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:02:27,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 12:02:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:27,791 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:02:27,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:02:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:02:27,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:27,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:27,793 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:27,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 743997126, now seen corresponding path program 1 times [2018-11-23 12:02:27,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:27,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:27,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:27,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-23 12:02:27,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {157#true} is VALID [2018-11-23 12:02:27,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2018-11-23 12:02:27,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #61#return; {157#true} is VALID [2018-11-23 12:02:27,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret2 := main(); {157#true} is VALID [2018-11-23 12:02:27,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {159#(= main_~i~0 0)} is VALID [2018-11-23 12:02:27,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {159#(= main_~i~0 0)} assume !(~i~0 < 100000); {158#false} is VALID [2018-11-23 12:02:27,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {158#false} ~i~0 := 0; {158#false} is VALID [2018-11-23 12:02:27,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {158#false} assume !(~i~0 < 100000); {158#false} is VALID [2018-11-23 12:02:27,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#false} havoc ~x~0;~x~0 := 0; {158#false} is VALID [2018-11-23 12:02:27,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {158#false} is VALID [2018-11-23 12:02:27,895 INFO L256 TraceCheckUtils]: 11: Hoare triple {158#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {158#false} is VALID [2018-11-23 12:02:27,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#false} ~cond := #in~cond; {158#false} is VALID [2018-11-23 12:02:27,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {158#false} assume 0 == ~cond; {158#false} is VALID [2018-11-23 12:02:27,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-23 12:02:27,900 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 12:02:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:27,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:27,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:02:27,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:27,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:28,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:28,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:28,041 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:02:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,213 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:02:28,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:28,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:02:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 12:02:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 12:02:28,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-23 12:02:28,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:28,310 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:02:28,310 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:02:28,312 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 12:02:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:02:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:02:28,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:28,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:28,362 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:28,362 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,365 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:02:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:02:28,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,367 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:28,367 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,371 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:02:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:02:28,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:28,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:02:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:02:28,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 12:02:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:02:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:02:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:02:28,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:28,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:28,379 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:28,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 494025381, now seen corresponding path program 1 times [2018-11-23 12:02:28,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:02:28,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:02:28,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:02:28,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #61#return; {289#true} is VALID [2018-11-23 12:02:28,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-23 12:02:28,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {291#(= main_~i~0 0)} is VALID [2018-11-23 12:02:28,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {292#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:28,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 12:02:28,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 12:02:28,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {290#false} is VALID [2018-11-23 12:02:28,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 12:02:28,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} havoc ~x~0;~x~0 := 0; {290#false} is VALID [2018-11-23 12:02:28,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {290#false} is VALID [2018-11-23 12:02:28,709 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {290#false} is VALID [2018-11-23 12:02:28,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 12:02:28,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 12:02:28,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:02:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:02:28,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:28,712 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 12:02:28,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:28,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:02:28,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:02:28,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:02:28,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #61#return; {289#true} is VALID [2018-11-23 12:02:28,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-23 12:02:28,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {311#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:28,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {292#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:28,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 12:02:28,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 12:02:28,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {290#false} is VALID [2018-11-23 12:02:28,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 12:02:28,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} havoc ~x~0;~x~0 := 0; {290#false} is VALID [2018-11-23 12:02:28,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {290#false} is VALID [2018-11-23 12:02:28,970 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {290#false} is VALID [2018-11-23 12:02:28,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 12:02:28,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 12:02:28,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:02:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:02:28,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:28,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:28,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:02:28,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:28,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:29,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:29,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:29,080 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 12:02:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,415 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:02:29,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:29,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:02:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:02:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:02:29,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:02:29,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:29,529 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:02:29,529 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:02:29,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:02:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:02:29,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:29,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:29,549 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:29,549 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,552 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 12:02:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:02:29,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:29,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:29,553 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:29,553 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,556 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 12:02:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:02:29,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:29,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:29,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:29,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:02:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 12:02:29,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 12:02:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:29,559 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 12:02:29,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:02:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:02:29,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:29,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:29,561 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:29,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash -254426330, now seen corresponding path program 2 times [2018-11-23 12:02:29,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2018-11-23 12:02:29,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {485#true} is VALID [2018-11-23 12:02:29,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2018-11-23 12:02:29,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #61#return; {485#true} is VALID [2018-11-23 12:02:29,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret2 := main(); {485#true} is VALID [2018-11-23 12:02:29,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {487#(= main_~i~0 0)} is VALID [2018-11-23 12:02:29,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {487#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {488#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:29,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {489#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:29,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(<= main_~i~0 2)} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 12:02:29,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#false} ~i~0 := 0; {486#false} is VALID [2018-11-23 12:02:29,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 12:02:29,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 12:02:29,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#false} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 12:02:29,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#false} havoc ~x~0;~x~0 := 0; {486#false} is VALID [2018-11-23 12:02:29,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {486#false} is VALID [2018-11-23 12:02:29,685 INFO L256 TraceCheckUtils]: 15: Hoare triple {486#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {486#false} is VALID [2018-11-23 12:02:29,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2018-11-23 12:02:29,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2018-11-23 12:02:29,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {486#false} assume !false; {486#false} is VALID [2018-11-23 12:02:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:02:29,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:29,687 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 12:02:29,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:29,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:29,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:29,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2018-11-23 12:02:29,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {485#true} is VALID [2018-11-23 12:02:29,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2018-11-23 12:02:29,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #61#return; {485#true} is VALID [2018-11-23 12:02:29,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret2 := main(); {485#true} is VALID [2018-11-23 12:02:29,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {508#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:29,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {488#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:29,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {489#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:29,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(<= main_~i~0 2)} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 12:02:29,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#false} ~i~0 := 0; {486#false} is VALID [2018-11-23 12:02:29,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 12:02:29,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 12:02:29,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#false} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 12:02:29,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#false} havoc ~x~0;~x~0 := 0; {486#false} is VALID [2018-11-23 12:02:29,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {486#false} is VALID [2018-11-23 12:02:29,942 INFO L256 TraceCheckUtils]: 15: Hoare triple {486#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {486#false} is VALID [2018-11-23 12:02:29,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2018-11-23 12:02:29,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2018-11-23 12:02:29,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {486#false} assume !false; {486#false} is VALID [2018-11-23 12:02:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:02:29,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:29,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:02:29,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:29,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:30,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:30,031 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-23 12:02:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,231 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:02:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:30,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:02:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 12:02:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 12:02:30,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2018-11-23 12:02:30,313 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 12:02:30,316 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:02:30,316 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:02:30,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:02:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:02:30,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:30,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,343 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,343 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,345 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:02:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:02:30,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,346 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,346 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,349 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:02:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:02:30,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:30,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:02:30,352 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 12:02:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:30,353 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:02:30,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:02:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:02:30,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:30,354 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:30,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:30,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash -254217403, now seen corresponding path program 3 times [2018-11-23 12:02:30,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 12:02:30,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-23 12:02:30,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 12:02:30,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #61#return; {702#true} is VALID [2018-11-23 12:02:30,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret2 := main(); {702#true} is VALID [2018-11-23 12:02:30,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {704#(= main_~i~0 0)} is VALID [2018-11-23 12:02:30,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {704#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {705#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {706#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {707#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {707#(<= main_~i~0 3)} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 12:02:30,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#false} ~i~0 := 0; {703#false} is VALID [2018-11-23 12:02:30,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#false} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 12:02:30,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {703#false} havoc ~x~0;~x~0 := 0; {703#false} is VALID [2018-11-23 12:02:30,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {703#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {703#false} is VALID [2018-11-23 12:02:30,500 INFO L256 TraceCheckUtils]: 17: Hoare triple {703#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {703#false} is VALID [2018-11-23 12:02:30,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2018-11-23 12:02:30,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2018-11-23 12:02:30,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 12:02:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:02:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:30,503 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 12:02:30,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:30,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:30,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:30,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 12:02:30,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-23 12:02:30,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 12:02:30,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #61#return; {702#true} is VALID [2018-11-23 12:02:30,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret2 := main(); {702#true} is VALID [2018-11-23 12:02:30,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {726#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:30,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {705#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {706#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {707#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {707#(<= main_~i~0 3)} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 12:02:30,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#false} ~i~0 := 0; {703#false} is VALID [2018-11-23 12:02:30,664 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 12:02:30,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#false} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 12:02:30,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {703#false} havoc ~x~0;~x~0 := 0; {703#false} is VALID [2018-11-23 12:02:30,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {703#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {703#false} is VALID [2018-11-23 12:02:30,666 INFO L256 TraceCheckUtils]: 17: Hoare triple {703#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {703#false} is VALID [2018-11-23 12:02:30,666 INFO L273 TraceCheckUtils]: 18: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2018-11-23 12:02:30,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2018-11-23 12:02:30,667 INFO L273 TraceCheckUtils]: 20: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 12:02:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:02:30,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:30,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:30,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:02:30,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:30,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:30,720 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 12:02:30,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:30,721 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-11-23 12:02:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,909 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:02:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:30,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:02:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 12:02:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 12:02:30,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-23 12:02:31,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,012 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:02:31,012 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:02:31,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:02:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:02:31,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:31,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:31,029 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:31,030 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,033 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 12:02:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:02:31,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,034 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:31,034 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,037 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 12:02:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:02:31,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:31,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 12:02:31,040 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-11-23 12:02:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:31,040 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 12:02:31,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:02:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:31,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:31,042 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:31,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:31,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1902727046, now seen corresponding path program 4 times [2018-11-23 12:02:31,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:31,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:31,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:31,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2018-11-23 12:02:31,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {940#true} is VALID [2018-11-23 12:02:31,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2018-11-23 12:02:31,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #61#return; {940#true} is VALID [2018-11-23 12:02:31,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret2 := main(); {940#true} is VALID [2018-11-23 12:02:31,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {942#(= main_~i~0 0)} is VALID [2018-11-23 12:02:31,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {942#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {943#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:31,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {943#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {944#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:31,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {945#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:31,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {946#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:31,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {946#(<= main_~i~0 4)} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 12:02:31,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#false} ~i~0 := 0; {941#false} is VALID [2018-11-23 12:02:31,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {941#false} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 12:02:31,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {941#false} havoc ~x~0;~x~0 := 0; {941#false} is VALID [2018-11-23 12:02:31,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {941#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {941#false} is VALID [2018-11-23 12:02:31,195 INFO L256 TraceCheckUtils]: 19: Hoare triple {941#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {941#false} is VALID [2018-11-23 12:02:31,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2018-11-23 12:02:31,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2018-11-23 12:02:31,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {941#false} assume !false; {941#false} is VALID [2018-11-23 12:02:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:02:31,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:31,197 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 12:02:31,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:31,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:31,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:31,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2018-11-23 12:02:31,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {940#true} is VALID [2018-11-23 12:02:31,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2018-11-23 12:02:31,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #61#return; {940#true} is VALID [2018-11-23 12:02:31,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret2 := main(); {940#true} is VALID [2018-11-23 12:02:31,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {965#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:31,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {943#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:31,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {943#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {944#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:31,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {945#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:31,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {946#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:31,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {946#(<= main_~i~0 4)} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 12:02:31,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#false} ~i~0 := 0; {941#false} is VALID [2018-11-23 12:02:31,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 12:02:31,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {941#false} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 12:02:31,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {941#false} havoc ~x~0;~x~0 := 0; {941#false} is VALID [2018-11-23 12:02:31,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {941#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {941#false} is VALID [2018-11-23 12:02:31,422 INFO L256 TraceCheckUtils]: 19: Hoare triple {941#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {941#false} is VALID [2018-11-23 12:02:31,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2018-11-23 12:02:31,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2018-11-23 12:02:31,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {941#false} assume !false; {941#false} is VALID [2018-11-23 12:02:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:02:31,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:31,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:31,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:02:31,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:31,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:31,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:31,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:31,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:31,525 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 12:02:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,729 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 12:02:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:31,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:02:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 12:02:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 12:02:31,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2018-11-23 12:02:31,926 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 12:02:31,928 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:02:31,928 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:02:31,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:02:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:02:31,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:31,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:31,946 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:31,946 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,948 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:02:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:02:31,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,950 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:31,950 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,952 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:02:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:02:31,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:31,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:02:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 12:02:31,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-23 12:02:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:31,955 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 12:02:31,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:02:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:02:31,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:31,957 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:31,957 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:31,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:31,957 INFO L82 PathProgramCache]: Analyzing trace with hash 768730085, now seen corresponding path program 5 times [2018-11-23 12:02:31,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {1199#true} call ULTIMATE.init(); {1199#true} is VALID [2018-11-23 12:02:32,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {1199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1199#true} is VALID [2018-11-23 12:02:32,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {1199#true} assume true; {1199#true} is VALID [2018-11-23 12:02:32,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1199#true} {1199#true} #61#return; {1199#true} is VALID [2018-11-23 12:02:32,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {1199#true} call #t~ret2 := main(); {1199#true} is VALID [2018-11-23 12:02:32,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {1199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1201#(= main_~i~0 0)} is VALID [2018-11-23 12:02:32,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1202#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:32,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1203#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:32,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {1203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1204#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:32,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1205#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:32,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1206#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:32,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {1206#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 12:02:32,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {1200#false} ~i~0 := 0; {1200#false} is VALID [2018-11-23 12:02:32,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#false} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 12:02:32,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#false} havoc ~x~0;~x~0 := 0; {1200#false} is VALID [2018-11-23 12:02:32,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {1200#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1200#false} is VALID [2018-11-23 12:02:32,131 INFO L256 TraceCheckUtils]: 21: Hoare triple {1200#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1200#false} is VALID [2018-11-23 12:02:32,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {1200#false} ~cond := #in~cond; {1200#false} is VALID [2018-11-23 12:02:32,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {1200#false} assume 0 == ~cond; {1200#false} is VALID [2018-11-23 12:02:32,132 INFO L273 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2018-11-23 12:02:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:02:32,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:32,134 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 12:02:32,149 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:32,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:32,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:32,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {1199#true} call ULTIMATE.init(); {1199#true} is VALID [2018-11-23 12:02:32,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {1199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1199#true} is VALID [2018-11-23 12:02:32,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {1199#true} assume true; {1199#true} is VALID [2018-11-23 12:02:32,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1199#true} {1199#true} #61#return; {1199#true} is VALID [2018-11-23 12:02:32,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {1199#true} call #t~ret2 := main(); {1199#true} is VALID [2018-11-23 12:02:32,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {1199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1225#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:32,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1202#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:32,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1203#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:32,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {1203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1204#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:32,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {1204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1205#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:32,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1206#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:32,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1206#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 12:02:32,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {1200#false} ~i~0 := 0; {1200#false} is VALID [2018-11-23 12:02:32,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 12:02:32,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#false} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 12:02:32,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#false} havoc ~x~0;~x~0 := 0; {1200#false} is VALID [2018-11-23 12:02:32,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {1200#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1200#false} is VALID [2018-11-23 12:02:32,395 INFO L256 TraceCheckUtils]: 21: Hoare triple {1200#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1200#false} is VALID [2018-11-23 12:02:32,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {1200#false} ~cond := #in~cond; {1200#false} is VALID [2018-11-23 12:02:32,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {1200#false} assume 0 == ~cond; {1200#false} is VALID [2018-11-23 12:02:32,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2018-11-23 12:02:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:02:32,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:32,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 12:02:32,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:32,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:32,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:32,449 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-23 12:02:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,732 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-23 12:02:32,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:32,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 12:02:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 12:02:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 12:02:32,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2018-11-23 12:02:32,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,818 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:02:32,818 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:02:32,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:02:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:02:32,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:32,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:32,906 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:32,907 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,909 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 12:02:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:02:32,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,910 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:32,910 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,912 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 12:02:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:02:32,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:32,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:02:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:02:32,915 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2018-11-23 12:02:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:02:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:02:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:32,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:32,917 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:32,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:32,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 598811622, now seen corresponding path program 6 times [2018-11-23 12:02:32,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-23 12:02:33,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1479#true} is VALID [2018-11-23 12:02:33,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-23 12:02:33,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #61#return; {1479#true} is VALID [2018-11-23 12:02:33,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret2 := main(); {1479#true} is VALID [2018-11-23 12:02:33,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {1479#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1481#(= main_~i~0 0)} is VALID [2018-11-23 12:02:33,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {1481#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1482#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {1482#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1483#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1484#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1485#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {1485#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1486#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1487#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 12:02:33,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#false} ~i~0 := 0; {1480#false} is VALID [2018-11-23 12:02:33,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#false} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 12:02:33,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#false} havoc ~x~0;~x~0 := 0; {1480#false} is VALID [2018-11-23 12:02:33,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1480#false} is VALID [2018-11-23 12:02:33,236 INFO L256 TraceCheckUtils]: 23: Hoare triple {1480#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1480#false} is VALID [2018-11-23 12:02:33,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2018-11-23 12:02:33,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2018-11-23 12:02:33,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-23 12:02:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:02:33,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:33,238 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 12:02:33,256 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:33,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:33,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-23 12:02:33,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1479#true} is VALID [2018-11-23 12:02:33,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-23 12:02:33,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #61#return; {1479#true} is VALID [2018-11-23 12:02:33,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret2 := main(); {1479#true} is VALID [2018-11-23 12:02:33,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {1479#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1506#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {1506#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1482#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {1482#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1483#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1484#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1485#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {1485#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1486#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1487#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 12:02:33,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#false} ~i~0 := 0; {1480#false} is VALID [2018-11-23 12:02:33,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 12:02:33,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#false} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 12:02:33,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#false} havoc ~x~0;~x~0 := 0; {1480#false} is VALID [2018-11-23 12:02:33,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1480#false} is VALID [2018-11-23 12:02:33,462 INFO L256 TraceCheckUtils]: 23: Hoare triple {1480#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1480#false} is VALID [2018-11-23 12:02:33,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2018-11-23 12:02:33,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2018-11-23 12:02:33,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-23 12:02:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:02:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:33,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 12:02:33,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:33,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:33,534 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2018-11-23 12:02:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,901 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 12:02:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:33,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 12:02:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:02:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:02:33,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2018-11-23 12:02:33,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,966 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:02:33,967 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:02:33,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:02:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:02:34,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:34,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,005 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,005 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,007 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:02:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 12:02:34,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,008 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,009 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,010 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:02:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 12:02:34,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:34,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:02:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 12:02:34,013 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2018-11-23 12:02:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:34,013 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 12:02:34,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 12:02:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:34,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,015 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:34,015 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1765864315, now seen corresponding path program 7 times [2018-11-23 12:02:34,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:34,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 12:02:34,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 12:02:34,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 12:02:34,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2018-11-23 12:02:34,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret2 := main(); {1780#true} is VALID [2018-11-23 12:02:34,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1782#(= main_~i~0 0)} is VALID [2018-11-23 12:02:34,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1783#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:34,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1784#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:34,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1785#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:34,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1786#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:34,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1787#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:34,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1788#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:34,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1789#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:34,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 12:02:34,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} ~i~0 := 0; {1781#false} is VALID [2018-11-23 12:02:34,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {1781#false} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 12:02:34,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 12:02:34,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:02:34,243 INFO L256 TraceCheckUtils]: 25: Hoare triple {1781#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1781#false} is VALID [2018-11-23 12:02:34,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 12:02:34,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 12:02:34,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 12:02:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:02:34,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:34,245 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 12:02:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:34,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 12:02:34,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 12:02:34,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 12:02:34,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2018-11-23 12:02:34,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret2 := main(); {1780#true} is VALID [2018-11-23 12:02:34,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1808#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:34,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {1808#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1783#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:34,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1784#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:34,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1785#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:34,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1786#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:34,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1787#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:34,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1788#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:34,440 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1789#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:34,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 12:02:34,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} ~i~0 := 0; {1781#false} is VALID [2018-11-23 12:02:34,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 12:02:34,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {1781#false} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 12:02:34,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 12:02:34,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:02:34,445 INFO L256 TraceCheckUtils]: 25: Hoare triple {1781#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1781#false} is VALID [2018-11-23 12:02:34,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 12:02:34,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 12:02:34,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 12:02:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:02:34,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:34,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 12:02:34,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:34,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:34,651 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 12:02:34,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:34,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:34,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:34,652 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2018-11-23 12:02:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,032 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 12:02:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:35,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 12:02:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 12:02:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 12:02:35,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2018-11-23 12:02:35,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,408 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:02:35,409 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:02:35,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:02:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:02:35,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:35,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:35,435 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:35,435 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,437 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:02:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:02:35,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,439 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:35,439 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,440 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:02:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:02:35,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:35,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:02:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 12:02:35,443 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2018-11-23 12:02:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:35,443 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 12:02:35,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:02:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:02:35,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:35,444 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:35,444 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:35,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 97206342, now seen corresponding path program 8 times [2018-11-23 12:02:35,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:35,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2018-11-23 12:02:35,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2102#true} is VALID [2018-11-23 12:02:35,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2018-11-23 12:02:35,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #61#return; {2102#true} is VALID [2018-11-23 12:02:35,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret2 := main(); {2102#true} is VALID [2018-11-23 12:02:35,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {2102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2104#(= main_~i~0 0)} is VALID [2018-11-23 12:02:35,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {2104#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:35,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {2105#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:35,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {2106#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:35,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {2107#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:35,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {2108#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:35,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {2109#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2110#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:35,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {2110#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2111#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:35,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {2111#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2112#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:35,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 12:02:35,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {2103#false} ~i~0 := 0; {2103#false} is VALID [2018-11-23 12:02:35,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:35,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 12:02:35,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {2103#false} havoc ~x~0;~x~0 := 0; {2103#false} is VALID [2018-11-23 12:02:35,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2103#false} is VALID [2018-11-23 12:02:35,715 INFO L256 TraceCheckUtils]: 27: Hoare triple {2103#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2103#false} is VALID [2018-11-23 12:02:35,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {2103#false} ~cond := #in~cond; {2103#false} is VALID [2018-11-23 12:02:35,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {2103#false} assume 0 == ~cond; {2103#false} is VALID [2018-11-23 12:02:35,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2018-11-23 12:02:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:35,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:35,718 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 12:02:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:35,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:35,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:36,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2018-11-23 12:02:36,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2102#true} is VALID [2018-11-23 12:02:36,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2018-11-23 12:02:36,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #61#return; {2102#true} is VALID [2018-11-23 12:02:36,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret2 := main(); {2102#true} is VALID [2018-11-23 12:02:36,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {2102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2131#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:36,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {2131#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {2105#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:36,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {2106#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:36,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {2107#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:36,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {2108#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:36,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {2109#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2110#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:36,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {2110#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2111#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:36,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {2111#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2112#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:36,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 12:02:36,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {2103#false} ~i~0 := 0; {2103#false} is VALID [2018-11-23 12:02:36,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 12:02:36,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 12:02:36,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {2103#false} havoc ~x~0;~x~0 := 0; {2103#false} is VALID [2018-11-23 12:02:36,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2103#false} is VALID [2018-11-23 12:02:36,411 INFO L256 TraceCheckUtils]: 27: Hoare triple {2103#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2103#false} is VALID [2018-11-23 12:02:36,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {2103#false} ~cond := #in~cond; {2103#false} is VALID [2018-11-23 12:02:36,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {2103#false} assume 0 == ~cond; {2103#false} is VALID [2018-11-23 12:02:36,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2018-11-23 12:02:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:36,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:36,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:02:36,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:36,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:36,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:36,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:36,457 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2018-11-23 12:02:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,624 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-23 12:02:36,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:36,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:02:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 12:02:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 12:02:36,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2018-11-23 12:02:36,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,692 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:02:36,693 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:02:36,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:02:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:02:36,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:36,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:36,724 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:36,724 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,727 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:02:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:02:36,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,728 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:36,728 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,729 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:02:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:02:36,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:36,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:02:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 12:02:36,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-11-23 12:02:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:36,731 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 12:02:36,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:02:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:02:36,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:36,732 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:36,732 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:36,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1434610981, now seen corresponding path program 9 times [2018-11-23 12:02:36,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 12:02:36,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 12:02:36,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 12:02:36,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2018-11-23 12:02:36,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret2 := main(); {2445#true} is VALID [2018-11-23 12:02:36,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2447#(= main_~i~0 0)} is VALID [2018-11-23 12:02:36,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {2447#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {2448#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:36,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:36,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {2450#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:36,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {2451#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:36,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {2452#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:36,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {2453#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:36,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {2454#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:36,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {2455#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {2446#false} ~i~0 := 0; {2446#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 12:02:36,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {2446#false} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 12:02:36,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 12:02:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:02:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:36,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:36,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:37,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:37,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:37,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:37,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 12:02:37,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 12:02:37,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret2 := main(); {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 12:02:37,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2502#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:37,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {2502#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {2445#true} is VALID [2018-11-23 12:02:37,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {2445#true} ~i~0 := 0; {2509#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:37,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {2509#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:37,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {2448#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:37,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {2449#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:37,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {2450#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:37,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {2451#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:37,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {2452#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:37,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {2453#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:37,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {2454#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:37,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {2455#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:37,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {2456#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 12:02:37,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 12:02:37,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2446#false} is VALID [2018-11-23 12:02:37,393 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2446#false} is VALID [2018-11-23 12:02:37,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 12:02:37,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 12:02:37,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 12:02:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-23 12:02:37,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:02:37,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:37,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:37,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:37,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:37,472 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2018-11-23 12:02:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,756 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-23 12:02:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:37,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:02:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-23 12:02:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-23 12:02:37,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2018-11-23 12:02:37,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,838 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:02:37,838 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:37,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:37,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:37,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:37,953 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:37,953 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,954 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:02:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 12:02:37,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,955 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:37,955 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,956 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:02:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 12:02:37,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:37,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 12:02:37,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-11-23 12:02:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:37,958 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 12:02:37,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 12:02:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:37,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:37,959 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:37,959 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:37,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2119541926, now seen corresponding path program 10 times [2018-11-23 12:02:37,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:37,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-23 12:02:38,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2810#true} is VALID [2018-11-23 12:02:38,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-23 12:02:38,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #61#return; {2810#true} is VALID [2018-11-23 12:02:38,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret2 := main(); {2810#true} is VALID [2018-11-23 12:02:38,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2812#(= main_~i~0 0)} is VALID [2018-11-23 12:02:38,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {2812#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2813#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {2813#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2814#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {2814#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2815#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:38,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {2815#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2816#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:38,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2817#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:38,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {2817#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2818#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:38,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {2818#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2819#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:38,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {2819#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2820#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:38,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {2820#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2821#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:38,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {2821#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2822#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:38,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {2822#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 12:02:38,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {2811#false} ~i~0 := 0; {2811#false} is VALID [2018-11-23 12:02:38,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {2811#false} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 12:02:38,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {2811#false} havoc ~x~0;~x~0 := 0; {2811#false} is VALID [2018-11-23 12:02:38,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {2811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2811#false} is VALID [2018-11-23 12:02:38,350 INFO L256 TraceCheckUtils]: 31: Hoare triple {2811#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2811#false} is VALID [2018-11-23 12:02:38,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-23 12:02:38,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {2811#false} assume 0 == ~cond; {2811#false} is VALID [2018-11-23 12:02:38,351 INFO L273 TraceCheckUtils]: 34: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-23 12:02:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:02:38,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:38,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:38,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:38,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:38,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:38,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-23 12:02:38,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2810#true} is VALID [2018-11-23 12:02:38,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-23 12:02:38,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #61#return; {2810#true} is VALID [2018-11-23 12:02:38,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret2 := main(); {2810#true} is VALID [2018-11-23 12:02:38,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2841#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:38,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {2841#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2813#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {2813#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2814#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {2814#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2815#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:38,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {2815#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2816#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:38,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2817#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:38,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {2817#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2818#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:38,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {2818#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2819#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:38,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {2819#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2820#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:38,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {2820#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2821#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:38,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {2821#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2822#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:38,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {2822#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 12:02:38,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {2811#false} ~i~0 := 0; {2811#false} is VALID [2018-11-23 12:02:38,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 12:02:38,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {2811#false} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 12:02:38,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {2811#false} havoc ~x~0;~x~0 := 0; {2811#false} is VALID [2018-11-23 12:02:38,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {2811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2811#false} is VALID [2018-11-23 12:02:38,588 INFO L256 TraceCheckUtils]: 31: Hoare triple {2811#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2811#false} is VALID [2018-11-23 12:02:38,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-23 12:02:38,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {2811#false} assume 0 == ~cond; {2811#false} is VALID [2018-11-23 12:02:38,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-23 12:02:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:02:38,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:38,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:38,612 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 12:02:38,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:38,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:38,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:38,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:38,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:38,639 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2018-11-23 12:02:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:38,872 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-23 12:02:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:38,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 12:02:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 12:02:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 12:02:38,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2018-11-23 12:02:38,979 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 12:02:38,980 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:02:38,980 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:02:38,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:02:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:02:39,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:39,017 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:39,017 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,019 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:02:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:02:39,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,020 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:39,020 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,021 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:02:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:02:39,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:02:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 12:02:39,023 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2018-11-23 12:02:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,023 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 12:02:39,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:02:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:02:39,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,024 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:39,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 461243845, now seen corresponding path program 11 times [2018-11-23 12:02:39,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3195#true} is VALID [2018-11-23 12:02:39,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {3195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3195#true} is VALID [2018-11-23 12:02:39,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2018-11-23 12:02:39,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #61#return; {3195#true} is VALID [2018-11-23 12:02:39,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret2 := main(); {3195#true} is VALID [2018-11-23 12:02:39,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {3195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3197#(= main_~i~0 0)} is VALID [2018-11-23 12:02:39,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {3197#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {3198#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {3200#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {3201#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {3202#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {3203#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3204#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {3204#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3205#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {3205#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3206#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {3206#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3207#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {3207#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3208#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:39,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {3208#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 12:02:39,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {3196#false} ~i~0 := 0; {3196#false} is VALID [2018-11-23 12:02:39,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,239 INFO L273 TraceCheckUtils]: 30: Hoare triple {3196#false} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 12:02:39,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {3196#false} havoc ~x~0;~x~0 := 0; {3196#false} is VALID [2018-11-23 12:02:39,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {3196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3196#false} is VALID [2018-11-23 12:02:39,240 INFO L256 TraceCheckUtils]: 33: Hoare triple {3196#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3196#false} is VALID [2018-11-23 12:02:39,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {3196#false} ~cond := #in~cond; {3196#false} is VALID [2018-11-23 12:02:39,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {3196#false} assume 0 == ~cond; {3196#false} is VALID [2018-11-23 12:02:39,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2018-11-23 12:02:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:02:39,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:39,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:39,593 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:02:39,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3195#true} is VALID [2018-11-23 12:02:39,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {3195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3195#true} is VALID [2018-11-23 12:02:39,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2018-11-23 12:02:39,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #61#return; {3195#true} is VALID [2018-11-23 12:02:39,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret2 := main(); {3195#true} is VALID [2018-11-23 12:02:39,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {3195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3227#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {3227#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {3198#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {3200#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {3201#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {3202#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {3203#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3204#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {3204#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3205#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {3205#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3206#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {3206#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3207#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {3207#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3208#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:39,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {3208#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 12:02:39,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {3196#false} ~i~0 := 0; {3196#false} is VALID [2018-11-23 12:02:39,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {3196#false} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {3196#false} havoc ~x~0;~x~0 := 0; {3196#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {3196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3196#false} is VALID [2018-11-23 12:02:39,734 INFO L256 TraceCheckUtils]: 33: Hoare triple {3196#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3196#false} is VALID [2018-11-23 12:02:39,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {3196#false} ~cond := #in~cond; {3196#false} is VALID [2018-11-23 12:02:39,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {3196#false} assume 0 == ~cond; {3196#false} is VALID [2018-11-23 12:02:39,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2018-11-23 12:02:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:02:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:39,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 12:02:39,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:39,779 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 12:02:39,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:39,780 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 15 states. [2018-11-23 12:02:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,113 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 12:02:40,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:40,114 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 12:02:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 12:02:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 12:02:40,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 62 transitions. [2018-11-23 12:02:40,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,192 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:02:40,192 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:02:40,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:02:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:02:40,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,242 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,242 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,244 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:02:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:02:40,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,244 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,245 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,246 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:02:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:02:40,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:02:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 12:02:40,248 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2018-11-23 12:02:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,248 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 12:02:40,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:02:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:02:40,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,249 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,249 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1013862662, now seen corresponding path program 12 times [2018-11-23 12:02:40,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {3601#true} call ULTIMATE.init(); {3601#true} is VALID [2018-11-23 12:02:41,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {3601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3601#true} is VALID [2018-11-23 12:02:41,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {3601#true} assume true; {3601#true} is VALID [2018-11-23 12:02:41,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} #61#return; {3601#true} is VALID [2018-11-23 12:02:41,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {3601#true} call #t~ret2 := main(); {3601#true} is VALID [2018-11-23 12:02:41,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {3601#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3603#(= main_~i~0 0)} is VALID [2018-11-23 12:02:41,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {3603#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3604#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:41,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {3604#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3605#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:41,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {3605#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3606#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:41,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {3606#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3607#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:41,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {3607#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3608#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:41,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {3608#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3609#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:41,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {3609#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3610#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:41,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {3610#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3611#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:41,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {3611#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3612#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:41,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {3612#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3613#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:41,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {3613#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3614#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:41,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {3614#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3615#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:41,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {3615#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 12:02:41,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {3602#false} ~i~0 := 0; {3602#false} is VALID [2018-11-23 12:02:41,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 12:02:41,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {3602#false} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 12:02:41,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {3602#false} havoc ~x~0;~x~0 := 0; {3602#false} is VALID [2018-11-23 12:02:41,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {3602#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3602#false} is VALID [2018-11-23 12:02:41,075 INFO L256 TraceCheckUtils]: 35: Hoare triple {3602#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3602#false} is VALID [2018-11-23 12:02:41,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#false} ~cond := #in~cond; {3602#false} is VALID [2018-11-23 12:02:41,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#false} assume 0 == ~cond; {3602#false} is VALID [2018-11-23 12:02:41,075 INFO L273 TraceCheckUtils]: 38: Hoare triple {3602#false} assume !false; {3602#false} is VALID [2018-11-23 12:02:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:02:41,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:41,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:41,092 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:41,888 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:02:41,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:42,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {3601#true} call ULTIMATE.init(); {3601#true} is VALID [2018-11-23 12:02:42,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {3601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3601#true} is VALID [2018-11-23 12:02:42,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {3601#true} assume true; {3601#true} is VALID [2018-11-23 12:02:42,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} #61#return; {3601#true} is VALID [2018-11-23 12:02:42,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {3601#true} call #t~ret2 := main(); {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {3601#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 12:02:42,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {3601#true} assume !(~i~0 < 100000); {3601#true} is VALID [2018-11-23 12:02:42,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {3601#true} ~i~0 := 0; {3676#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:42,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {3676#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3604#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {3604#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3605#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:42,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {3605#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3606#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:42,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {3606#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3607#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:42,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {3607#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3608#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:42,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {3608#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3609#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:42,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3610#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:42,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3611#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:42,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {3611#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3612#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:42,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {3612#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3613#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:42,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {3613#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3614#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:42,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {3614#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3615#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:42,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {3615#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 12:02:42,065 INFO L273 TraceCheckUtils]: 33: Hoare triple {3602#false} havoc ~x~0;~x~0 := 0; {3602#false} is VALID [2018-11-23 12:02:42,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {3602#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3602#false} is VALID [2018-11-23 12:02:42,066 INFO L256 TraceCheckUtils]: 35: Hoare triple {3602#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3602#false} is VALID [2018-11-23 12:02:42,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#false} ~cond := #in~cond; {3602#false} is VALID [2018-11-23 12:02:42,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#false} assume 0 == ~cond; {3602#false} is VALID [2018-11-23 12:02:42,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {3602#false} assume !false; {3602#false} is VALID [2018-11-23 12:02:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:02:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:42,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:02:42,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 12:02:42,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:42,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:02:42,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:02:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:02:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:42,158 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-11-23 12:02:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,512 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 12:02:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:02:42,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 12:02:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2018-11-23 12:02:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2018-11-23 12:02:42,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2018-11-23 12:02:42,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,587 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:02:42,587 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:02:42,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:02:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:02:42,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:42,696 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:42,696 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,697 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:02:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 12:02:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:42,698 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,699 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:02:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 12:02:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:02:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 12:02:42,701 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2018-11-23 12:02:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,701 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 12:02:42,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:02:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 12:02:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:02:42,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,702 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:42,702 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1100207717, now seen corresponding path program 13 times [2018-11-23 12:02:42,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-23 12:02:43,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4028#true} is VALID [2018-11-23 12:02:43,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-23 12:02:43,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #61#return; {4028#true} is VALID [2018-11-23 12:02:43,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-23 12:02:43,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4030#(= main_~i~0 0)} is VALID [2018-11-23 12:02:43,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {4030#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4032#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4033#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:43,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4034#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4035#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {4035#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4036#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4037#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:43,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {4037#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4038#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:43,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {4038#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4039#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:43,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {4039#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4040#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:43,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4041#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:43,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4042#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:43,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {4042#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4043#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:43,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {4043#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 12:02:43,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {4029#false} ~i~0 := 0; {4029#false} is VALID [2018-11-23 12:02:43,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {4029#false} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 12:02:43,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {4029#false} havoc ~x~0;~x~0 := 0; {4029#false} is VALID [2018-11-23 12:02:43,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {4029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4029#false} is VALID [2018-11-23 12:02:43,210 INFO L256 TraceCheckUtils]: 37: Hoare triple {4029#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4029#false} is VALID [2018-11-23 12:02:43,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {4029#false} ~cond := #in~cond; {4029#false} is VALID [2018-11-23 12:02:43,210 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#false} assume 0 == ~cond; {4029#false} is VALID [2018-11-23 12:02:43,211 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-23 12:02:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:02:43,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:43,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-23 12:02:43,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4028#true} is VALID [2018-11-23 12:02:43,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-23 12:02:43,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #61#return; {4028#true} is VALID [2018-11-23 12:02:43,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-23 12:02:43,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4062#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:43,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {4062#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4032#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4033#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:43,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4034#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4035#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {4035#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4036#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4037#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {4037#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4038#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {4038#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4039#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {4039#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4040#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:43,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4041#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:43,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4042#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:43,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {4042#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4043#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:43,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {4043#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 12:02:43,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {4029#false} ~i~0 := 0; {4029#false} is VALID [2018-11-23 12:02:43,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L273 TraceCheckUtils]: 34: Hoare triple {4029#false} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {4029#false} havoc ~x~0;~x~0 := 0; {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L273 TraceCheckUtils]: 36: Hoare triple {4029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L256 TraceCheckUtils]: 37: Hoare triple {4029#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L273 TraceCheckUtils]: 38: Hoare triple {4029#false} ~cond := #in~cond; {4029#false} is VALID [2018-11-23 12:02:43,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#false} assume 0 == ~cond; {4029#false} is VALID [2018-11-23 12:02:43,384 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-23 12:02:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:02:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:02:43,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 12:02:43,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:43,516 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 12:02:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:43,518 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2018-11-23 12:02:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,844 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-23 12:02:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:43,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 12:02:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2018-11-23 12:02:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2018-11-23 12:02:43,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2018-11-23 12:02:43,953 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 12:02:43,954 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:02:43,954 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:02:43,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:02:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:02:43,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:43,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:43,994 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:43,994 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,995 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:02:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:02:43,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,996 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:43,996 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,997 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:02:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:02:43,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:43,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:02:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-23 12:02:43,999 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-11-23 12:02:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:43,999 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 12:02:43,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:02:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:02:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:02:44,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,000 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:44,001 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 397624678, now seen corresponding path program 14 times [2018-11-23 12:02:44,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {4476#true} call ULTIMATE.init(); {4476#true} is VALID [2018-11-23 12:02:44,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {4476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4476#true} is VALID [2018-11-23 12:02:44,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {4476#true} assume true; {4476#true} is VALID [2018-11-23 12:02:44,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4476#true} {4476#true} #61#return; {4476#true} is VALID [2018-11-23 12:02:44,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {4476#true} call #t~ret2 := main(); {4476#true} is VALID [2018-11-23 12:02:44,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {4476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4478#(= main_~i~0 0)} is VALID [2018-11-23 12:02:44,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {4478#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4479#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {4479#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4480#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {4480#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4481#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {4481#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4482#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:44,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {4482#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4483#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:44,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {4483#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4484#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:44,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {4484#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4485#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:44,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {4485#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4486#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:44,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {4486#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4487#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:44,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4488#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:44,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4489#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:44,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {4489#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4490#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:44,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {4490#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4491#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:44,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {4491#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4492#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:44,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {4492#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 12:02:44,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {4477#false} ~i~0 := 0; {4477#false} is VALID [2018-11-23 12:02:44,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,308 INFO L273 TraceCheckUtils]: 34: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {4477#false} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {4477#false} havoc ~x~0;~x~0 := 0; {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {4477#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L256 TraceCheckUtils]: 39: Hoare triple {4477#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {4477#false} ~cond := #in~cond; {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {4477#false} assume 0 == ~cond; {4477#false} is VALID [2018-11-23 12:02:44,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {4477#false} assume !false; {4477#false} is VALID [2018-11-23 12:02:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:02:44,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:44,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:44,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:44,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:44,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {4476#true} call ULTIMATE.init(); {4476#true} is VALID [2018-11-23 12:02:44,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {4476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4476#true} is VALID [2018-11-23 12:02:44,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {4476#true} assume true; {4476#true} is VALID [2018-11-23 12:02:44,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4476#true} {4476#true} #61#return; {4476#true} is VALID [2018-11-23 12:02:44,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {4476#true} call #t~ret2 := main(); {4476#true} is VALID [2018-11-23 12:02:44,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {4476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4511#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {4511#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4479#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {4479#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4480#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {4480#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4481#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {4481#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4482#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:44,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {4482#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4483#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:44,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {4483#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4484#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:44,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {4484#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4485#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:44,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {4485#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4486#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:44,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {4486#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4487#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:44,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4488#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:44,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4489#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:44,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {4489#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4490#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:44,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {4490#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4491#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:44,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {4491#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4492#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:44,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {4492#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 12:02:44,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {4477#false} ~i~0 := 0; {4477#false} is VALID [2018-11-23 12:02:44,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 12:02:44,488 INFO L273 TraceCheckUtils]: 36: Hoare triple {4477#false} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 12:02:44,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {4477#false} havoc ~x~0;~x~0 := 0; {4477#false} is VALID [2018-11-23 12:02:44,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {4477#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4477#false} is VALID [2018-11-23 12:02:44,488 INFO L256 TraceCheckUtils]: 39: Hoare triple {4477#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4477#false} is VALID [2018-11-23 12:02:44,488 INFO L273 TraceCheckUtils]: 40: Hoare triple {4477#false} ~cond := #in~cond; {4477#false} is VALID [2018-11-23 12:02:44,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {4477#false} assume 0 == ~cond; {4477#false} is VALID [2018-11-23 12:02:44,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {4477#false} assume !false; {4477#false} is VALID [2018-11-23 12:02:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:02:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:02:44,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 12:02:44,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:02:44,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:02:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:02:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:44,534 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-11-23 12:02:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,946 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-23 12:02:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:02:44,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 12:02:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 12:02:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 12:02:44,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2018-11-23 12:02:45,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,404 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:02:45,404 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:02:45,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:02:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 12:02:45,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 12:02:45,443 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:02:45,443 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:02:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,445 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:02:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 12:02:45,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,445 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:02:45,445 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:02:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,447 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:02:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 12:02:45,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:02:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 12:02:45,449 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2018-11-23 12:02:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,449 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 12:02:45,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:02:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 12:02:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:02:45,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,450 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:45,451 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -400171259, now seen corresponding path program 15 times [2018-11-23 12:02:45,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {4945#true} call ULTIMATE.init(); {4945#true} is VALID [2018-11-23 12:02:46,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {4945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4945#true} is VALID [2018-11-23 12:02:46,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {4945#true} assume true; {4945#true} is VALID [2018-11-23 12:02:46,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4945#true} {4945#true} #61#return; {4945#true} is VALID [2018-11-23 12:02:46,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {4945#true} call #t~ret2 := main(); {4945#true} is VALID [2018-11-23 12:02:46,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {4945#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4947#(= main_~i~0 0)} is VALID [2018-11-23 12:02:46,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {4947#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4948#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4949#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4950#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4951#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4952#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:46,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4953#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:46,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4954#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:46,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4955#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:46,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4956#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:46,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4957#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:46,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {4957#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4958#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:46,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {4958#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4959#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:46,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {4959#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4960#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:46,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {4960#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4961#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:46,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {4961#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4962#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:46,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {4962#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 12:02:46,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {4946#false} ~i~0 := 0; {4946#false} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {4946#false} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {4946#false} havoc ~x~0;~x~0 := 0; {4946#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {4946#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4946#false} is VALID [2018-11-23 12:02:46,308 INFO L256 TraceCheckUtils]: 41: Hoare triple {4946#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4946#false} is VALID [2018-11-23 12:02:46,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {4946#false} ~cond := #in~cond; {4946#false} is VALID [2018-11-23 12:02:46,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {4946#false} assume 0 == ~cond; {4946#false} is VALID [2018-11-23 12:02:46,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {4946#false} assume !false; {4946#false} is VALID [2018-11-23 12:02:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:02:46,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:46,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:46,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:46,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:02:46,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {4945#true} call ULTIMATE.init(); {4945#true} is VALID [2018-11-23 12:02:46,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {4945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4945#true} is VALID [2018-11-23 12:02:46,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {4945#true} assume true; {4945#true} is VALID [2018-11-23 12:02:46,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4945#true} {4945#true} #61#return; {4945#true} is VALID [2018-11-23 12:02:46,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {4945#true} call #t~ret2 := main(); {4945#true} is VALID [2018-11-23 12:02:46,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {4945#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4981#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:46,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {4981#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4948#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4949#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4950#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4951#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4952#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:46,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4953#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:46,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4954#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:46,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4955#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:46,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4956#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:46,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4957#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:46,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {4957#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4958#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:46,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {4958#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4959#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:46,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {4959#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4960#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:46,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {4960#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4961#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:46,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {4961#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4962#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:46,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {4962#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 12:02:46,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {4946#false} ~i~0 := 0; {4946#false} is VALID [2018-11-23 12:02:46,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {4946#false} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {4946#false} havoc ~x~0;~x~0 := 0; {4946#false} is VALID [2018-11-23 12:02:46,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {4946#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4946#false} is VALID [2018-11-23 12:02:46,882 INFO L256 TraceCheckUtils]: 41: Hoare triple {4946#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4946#false} is VALID [2018-11-23 12:02:46,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {4946#false} ~cond := #in~cond; {4946#false} is VALID [2018-11-23 12:02:46,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {4946#false} assume 0 == ~cond; {4946#false} is VALID [2018-11-23 12:02:46,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {4946#false} assume !false; {4946#false} is VALID [2018-11-23 12:02:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:02:46,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:02:46,903 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 12:02:46,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:02:46,928 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 12:02:46,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:02:46,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:02:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:46,930 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 19 states. [2018-11-23 12:02:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,360 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-23 12:02:47,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:02:47,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 12:02:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2018-11-23 12:02:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2018-11-23 12:02:47,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 70 transitions. [2018-11-23 12:02:47,784 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 12:02:47,785 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:02:47,786 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:02:47,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:02:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:02:47,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,825 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,825 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,826 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:02:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 12:02:47,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,826 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,826 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,827 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:02:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 12:02:47,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 12:02:47,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2018-11-23 12:02:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,830 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 12:02:47,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:02:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 12:02:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:47,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,831 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:47,831 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash -264076858, now seen corresponding path program 16 times [2018-11-23 12:02:47,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {5435#true} call ULTIMATE.init(); {5435#true} is VALID [2018-11-23 12:02:48,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {5435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5435#true} is VALID [2018-11-23 12:02:48,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {5435#true} assume true; {5435#true} is VALID [2018-11-23 12:02:48,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5435#true} {5435#true} #61#return; {5435#true} is VALID [2018-11-23 12:02:48,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {5435#true} call #t~ret2 := main(); {5435#true} is VALID [2018-11-23 12:02:48,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {5435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5437#(= main_~i~0 0)} is VALID [2018-11-23 12:02:48,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {5437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5438#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {5438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5439#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {5439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5440#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:48,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {5440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5441#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:48,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {5441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:48,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {5442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:48,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {5443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:48,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {5444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:48,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {5445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:48,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {5446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:48,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {5447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5448#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:48,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {5448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5449#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:48,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {5449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5450#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:48,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {5450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5451#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:48,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {5451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5452#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:48,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {5452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5453#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:48,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {5453#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 12:02:48,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {5436#false} ~i~0 := 0; {5436#false} is VALID [2018-11-23 12:02:48,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 27: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 31: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 33: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 39: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {5436#false} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {5436#false} havoc ~x~0;~x~0 := 0; {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {5436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L256 TraceCheckUtils]: 43: Hoare triple {5436#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {5436#false} ~cond := #in~cond; {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 45: Hoare triple {5436#false} assume 0 == ~cond; {5436#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {5436#false} assume !false; {5436#false} is VALID [2018-11-23 12:02:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 12:02:48,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:48,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:48,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:48,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:48,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {5435#true} call ULTIMATE.init(); {5435#true} is VALID [2018-11-23 12:02:48,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {5435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5435#true} is VALID [2018-11-23 12:02:48,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {5435#true} assume true; {5435#true} is VALID [2018-11-23 12:02:48,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5435#true} {5435#true} #61#return; {5435#true} is VALID [2018-11-23 12:02:48,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {5435#true} call #t~ret2 := main(); {5435#true} is VALID [2018-11-23 12:02:48,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {5435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5472#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:48,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {5472#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5438#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {5438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5439#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {5439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5440#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:48,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {5440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5441#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:48,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {5441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:48,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {5442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:48,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {5443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {5444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {5445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {5446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {5447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5448#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:48,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {5448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5449#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:48,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {5449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5450#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:48,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {5450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5451#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:48,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {5451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5452#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:48,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {5452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5453#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:48,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {5453#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 12:02:48,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {5436#false} ~i~0 := 0; {5436#false} is VALID [2018-11-23 12:02:48,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 28: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 33: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {5436#false} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 41: Hoare triple {5436#false} havoc ~x~0;~x~0 := 0; {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 42: Hoare triple {5436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L256 TraceCheckUtils]: 43: Hoare triple {5436#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {5436#false} ~cond := #in~cond; {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 45: Hoare triple {5436#false} assume 0 == ~cond; {5436#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {5436#false} assume !false; {5436#false} is VALID [2018-11-23 12:02:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 12:02:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:48,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:02:48,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 12:02:48,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:48,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:02:48,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:02:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:02:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:48,953 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-11-23 12:02:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,314 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 12:02:49,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:02:49,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 12:02:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-23 12:02:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-23 12:02:49,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2018-11-23 12:02:49,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,470 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:02:49,471 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:02:49,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:02:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 12:02:49,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:49,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 12:02:49,526 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:02:49,527 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:02:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,529 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:02:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:02:49,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,530 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:02:49,530 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:02:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,531 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:02:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:02:49,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:49,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:02:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-23 12:02:49,534 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-23 12:02:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:49,534 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 12:02:49,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:02:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:02:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:02:49,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:49,535 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:49,535 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:49,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash 387325861, now seen corresponding path program 17 times [2018-11-23 12:02:49,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {5946#true} call ULTIMATE.init(); {5946#true} is VALID [2018-11-23 12:02:50,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {5946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5946#true} is VALID [2018-11-23 12:02:50,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {5946#true} assume true; {5946#true} is VALID [2018-11-23 12:02:50,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5946#true} {5946#true} #61#return; {5946#true} is VALID [2018-11-23 12:02:50,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {5946#true} call #t~ret2 := main(); {5946#true} is VALID [2018-11-23 12:02:50,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {5946#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5948#(= main_~i~0 0)} is VALID [2018-11-23 12:02:50,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {5948#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5949#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {5949#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5950#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {5950#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5951#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {5951#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5952#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {5952#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5953#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {5953#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5954#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5955#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {5955#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5956#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {5956#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5957#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {5957#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5958#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {5958#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5959#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5960#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:50,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5961#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:50,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {5961#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5962#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:50,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {5962#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5963#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:50,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {5963#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5964#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {5964#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5965#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {5965#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {5947#false} ~i~0 := 0; {5947#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {5947#false} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {5947#false} havoc ~x~0;~x~0 := 0; {5947#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {5947#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5947#false} is VALID [2018-11-23 12:02:50,667 INFO L256 TraceCheckUtils]: 45: Hoare triple {5947#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5947#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {5947#false} ~cond := #in~cond; {5947#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {5947#false} assume 0 == ~cond; {5947#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {5947#false} assume !false; {5947#false} is VALID [2018-11-23 12:02:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:02:50,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:50,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:50,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:02,887 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:03:02,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:03,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {5946#true} call ULTIMATE.init(); {5946#true} is VALID [2018-11-23 12:03:03,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {5946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5946#true} is VALID [2018-11-23 12:03:03,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {5946#true} assume true; {5946#true} is VALID [2018-11-23 12:03:03,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5946#true} {5946#true} #61#return; {5946#true} is VALID [2018-11-23 12:03:03,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {5946#true} call #t~ret2 := main(); {5946#true} is VALID [2018-11-23 12:03:03,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {5946#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5984#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:03,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {5984#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5949#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:03,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {5949#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5950#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:03,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {5950#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5951#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:03,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {5951#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5952#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:03,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {5952#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5953#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:03,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {5953#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5954#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:03,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5955#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:03,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {5955#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5956#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:03,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {5956#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5957#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:03,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {5957#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5958#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:03,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {5958#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5959#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:03,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5960#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:03,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5961#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:03,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {5961#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5962#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:03,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {5962#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5963#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:03,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {5963#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5964#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:03,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {5964#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5965#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:03,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {5965#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 12:03:03,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {5947#false} ~i~0 := 0; {5947#false} is VALID [2018-11-23 12:03:03,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 12:03:03,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {5947#false} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L273 TraceCheckUtils]: 43: Hoare triple {5947#false} havoc ~x~0;~x~0 := 0; {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {5947#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L256 TraceCheckUtils]: 45: Hoare triple {5947#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L273 TraceCheckUtils]: 46: Hoare triple {5947#false} ~cond := #in~cond; {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {5947#false} assume 0 == ~cond; {5947#false} is VALID [2018-11-23 12:03:03,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {5947#false} assume !false; {5947#false} is VALID [2018-11-23 12:03:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:03:03,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:03,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:03:03,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 12:03:03,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:03,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:03:03,152 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 12:03:03,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:03:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:03:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:03,154 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 21 states. [2018-11-23 12:03:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,741 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 12:03:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:03:03,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 12:03:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-23 12:03:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-23 12:03:03,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 74 transitions. [2018-11-23 12:03:04,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:04,217 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:03:04,218 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:03:04,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:03:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:03:04,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:04,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:04,384 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:04,384 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:04,386 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:03:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 12:03:04,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:04,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:04,386 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:04,387 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:04,388 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:03:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 12:03:04,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:04,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:04,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:04,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:03:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 12:03:04,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2018-11-23 12:03:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:04,391 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 12:03:04,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:03:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 12:03:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:03:04,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:04,392 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:04,392 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:04,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1900411354, now seen corresponding path program 18 times [2018-11-23 12:03:04,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:04,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {6478#true} call ULTIMATE.init(); {6478#true} is VALID [2018-11-23 12:03:05,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {6478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6478#true} is VALID [2018-11-23 12:03:05,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {6478#true} assume true; {6478#true} is VALID [2018-11-23 12:03:05,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6478#true} {6478#true} #61#return; {6478#true} is VALID [2018-11-23 12:03:05,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {6478#true} call #t~ret2 := main(); {6478#true} is VALID [2018-11-23 12:03:05,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {6478#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6480#(= main_~i~0 0)} is VALID [2018-11-23 12:03:05,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {6480#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6481#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {6481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6482#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6483#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6484#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:05,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6487#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:05,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {6487#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6488#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:05,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {6488#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6489#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:05,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {6489#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6490#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:05,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {6490#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6491#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:05,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {6491#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6492#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:05,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {6492#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6493#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:05,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {6493#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6494#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:05,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {6494#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6495#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:05,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {6495#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6496#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:05,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {6496#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6497#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {6497#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6498#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {6498#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {6479#false} ~i~0 := 0; {6479#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 38: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 44: Hoare triple {6479#false} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {6479#false} havoc ~x~0;~x~0 := 0; {6479#false} is VALID [2018-11-23 12:03:05,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {6479#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6479#false} is VALID [2018-11-23 12:03:05,810 INFO L256 TraceCheckUtils]: 47: Hoare triple {6479#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6479#false} is VALID [2018-11-23 12:03:05,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {6479#false} ~cond := #in~cond; {6479#false} is VALID [2018-11-23 12:03:05,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {6479#false} assume 0 == ~cond; {6479#false} is VALID [2018-11-23 12:03:05,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {6479#false} assume !false; {6479#false} is VALID [2018-11-23 12:03:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 12:03:05,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:05,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:05,820 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:08,011 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:03:08,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:08,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {6478#true} call ULTIMATE.init(); {6478#true} is VALID [2018-11-23 12:03:08,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {6478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6478#true} is VALID [2018-11-23 12:03:08,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {6478#true} assume true; {6478#true} is VALID [2018-11-23 12:03:08,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6478#true} {6478#true} #61#return; {6478#true} is VALID [2018-11-23 12:03:08,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {6478#true} call #t~ret2 := main(); {6478#true} is VALID [2018-11-23 12:03:08,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {6478#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6517#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:08,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {6517#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6481#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:08,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {6481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6482#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:08,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6483#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:08,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6484#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:08,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:08,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:08,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6487#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:08,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {6487#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6488#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:08,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {6488#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6489#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:08,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {6489#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6490#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:08,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {6490#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6491#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:08,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {6491#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6492#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:08,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {6492#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6493#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:08,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {6493#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6494#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:08,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {6494#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6495#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:08,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {6495#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6496#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:08,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {6496#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6497#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:08,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {6497#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6498#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:08,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {6498#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 12:03:08,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {6479#false} ~i~0 := 0; {6479#false} is VALID [2018-11-23 12:03:08,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {6479#false} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {6479#false} havoc ~x~0;~x~0 := 0; {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {6479#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L256 TraceCheckUtils]: 47: Hoare triple {6479#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6479#false} is VALID [2018-11-23 12:03:08,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {6479#false} ~cond := #in~cond; {6479#false} is VALID [2018-11-23 12:03:08,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {6479#false} assume 0 == ~cond; {6479#false} is VALID [2018-11-23 12:03:08,274 INFO L273 TraceCheckUtils]: 50: Hoare triple {6479#false} assume !false; {6479#false} is VALID [2018-11-23 12:03:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 12:03:08,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:08,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:03:08,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 12:03:08,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:08,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:03:08,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:08,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:03:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:03:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:03:08,327 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-11-23 12:03:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:08,691 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-11-23 12:03:08,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:03:08,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 12:03:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:03:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 76 transitions. [2018-11-23 12:03:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:03:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 76 transitions. [2018-11-23 12:03:08,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 76 transitions. [2018-11-23 12:03:09,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:09,081 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:03:09,081 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:03:09,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:03:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:03:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:03:09,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:09,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:03:09,147 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:03:09,147 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:03:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,149 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:03:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:03:09,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,150 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:03:09,150 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:03:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,152 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:03:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:03:09,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:09,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:03:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 12:03:09,155 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2018-11-23 12:03:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:09,155 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 12:03:09,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:03:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:03:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:03:09,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:09,157 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:09,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:09,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash -574187451, now seen corresponding path program 19 times [2018-11-23 12:03:09,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:09,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:09,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {7031#true} call ULTIMATE.init(); {7031#true} is VALID [2018-11-23 12:03:09,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {7031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7031#true} is VALID [2018-11-23 12:03:09,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {7031#true} assume true; {7031#true} is VALID [2018-11-23 12:03:09,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7031#true} {7031#true} #61#return; {7031#true} is VALID [2018-11-23 12:03:09,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {7031#true} call #t~ret2 := main(); {7031#true} is VALID [2018-11-23 12:03:09,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {7031#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7033#(= main_~i~0 0)} is VALID [2018-11-23 12:03:09,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {7033#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7034#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:09,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {7034#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7035#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:09,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {7035#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7036#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:09,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {7036#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7037#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:09,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {7037#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7038#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:09,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {7038#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7039#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:09,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {7039#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7040#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:09,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {7040#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7041#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:09,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {7041#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7042#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:09,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {7042#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7043#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:09,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {7043#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7044#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:09,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {7044#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7045#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:09,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {7045#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7046#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:09,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {7046#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7047#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:09,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {7047#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7048#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:09,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {7048#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7049#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:09,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {7049#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7050#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:09,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {7050#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7051#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:09,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {7051#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7052#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:09,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {7052#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 12:03:09,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {7032#false} ~i~0 := 0; {7032#false} is VALID [2018-11-23 12:03:09,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,972 INFO L273 TraceCheckUtils]: 36: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,973 INFO L273 TraceCheckUtils]: 40: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,973 INFO L273 TraceCheckUtils]: 41: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,974 INFO L273 TraceCheckUtils]: 43: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:09,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {7032#false} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 12:03:09,974 INFO L273 TraceCheckUtils]: 47: Hoare triple {7032#false} havoc ~x~0;~x~0 := 0; {7032#false} is VALID [2018-11-23 12:03:09,975 INFO L273 TraceCheckUtils]: 48: Hoare triple {7032#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7032#false} is VALID [2018-11-23 12:03:09,975 INFO L256 TraceCheckUtils]: 49: Hoare triple {7032#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7032#false} is VALID [2018-11-23 12:03:09,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {7032#false} ~cond := #in~cond; {7032#false} is VALID [2018-11-23 12:03:09,975 INFO L273 TraceCheckUtils]: 51: Hoare triple {7032#false} assume 0 == ~cond; {7032#false} is VALID [2018-11-23 12:03:09,975 INFO L273 TraceCheckUtils]: 52: Hoare triple {7032#false} assume !false; {7032#false} is VALID [2018-11-23 12:03:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 12:03:09,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:09,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:10,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {7031#true} call ULTIMATE.init(); {7031#true} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {7031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7031#true} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {7031#true} assume true; {7031#true} is VALID [2018-11-23 12:03:10,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7031#true} {7031#true} #61#return; {7031#true} is VALID [2018-11-23 12:03:10,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {7031#true} call #t~ret2 := main(); {7031#true} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {7031#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7071#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {7071#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7034#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {7034#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7035#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:10,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {7035#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7036#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:10,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {7036#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7037#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:10,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {7037#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7038#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:10,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {7038#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7039#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:10,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {7039#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7040#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:10,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {7040#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7041#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:10,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {7041#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7042#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:10,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {7042#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7043#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:10,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {7043#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7044#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:10,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {7044#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7045#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:10,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {7045#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7046#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:10,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {7046#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7047#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:10,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {7047#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7048#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:10,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {7048#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7049#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:10,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {7049#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7050#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:10,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {7050#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7051#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:10,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {7051#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7052#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:10,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {7052#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {7032#false} ~i~0 := 0; {7032#false} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,202 INFO L273 TraceCheckUtils]: 43: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {7032#false} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 47: Hoare triple {7032#false} havoc ~x~0;~x~0 := 0; {7032#false} is VALID [2018-11-23 12:03:10,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {7032#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7032#false} is VALID [2018-11-23 12:03:10,204 INFO L256 TraceCheckUtils]: 49: Hoare triple {7032#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7032#false} is VALID [2018-11-23 12:03:10,204 INFO L273 TraceCheckUtils]: 50: Hoare triple {7032#false} ~cond := #in~cond; {7032#false} is VALID [2018-11-23 12:03:10,204 INFO L273 TraceCheckUtils]: 51: Hoare triple {7032#false} assume 0 == ~cond; {7032#false} is VALID [2018-11-23 12:03:10,204 INFO L273 TraceCheckUtils]: 52: Hoare triple {7032#false} assume !false; {7032#false} is VALID [2018-11-23 12:03:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 12:03:10,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:10,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:03:10,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:03:10,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:10,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:03:10,260 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 12:03:10,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:03:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:03:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:10,261 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 23 states. [2018-11-23 12:03:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,059 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 12:03:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:03:11,059 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:03:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2018-11-23 12:03:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:03:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2018-11-23 12:03:11,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 78 transitions. [2018-11-23 12:03:11,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:11,468 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:03:11,469 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:03:11,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:03:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:03:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 12:03:11,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:11,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 12:03:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:03:11,601 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:03:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,602 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:03:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 12:03:11,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:11,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:11,603 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:03:11,603 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:03:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,604 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:03:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 12:03:11,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:11,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:11,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:11,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:03:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 12:03:11,606 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-11-23 12:03:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:11,606 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 12:03:11,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:03:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 12:03:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:03:11,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:11,607 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:11,607 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:11,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2076716410, now seen corresponding path program 20 times [2018-11-23 12:03:11,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:11,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {7605#true} call ULTIMATE.init(); {7605#true} is VALID [2018-11-23 12:03:12,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {7605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7605#true} is VALID [2018-11-23 12:03:12,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {7605#true} assume true; {7605#true} is VALID [2018-11-23 12:03:12,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7605#true} {7605#true} #61#return; {7605#true} is VALID [2018-11-23 12:03:12,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {7605#true} call #t~ret2 := main(); {7605#true} is VALID [2018-11-23 12:03:12,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {7605#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7607#(= main_~i~0 0)} is VALID [2018-11-23 12:03:12,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {7607#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7608#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {7608#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7609#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {7609#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7610#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {7610#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7611#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {7611#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7612#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {7612#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7613#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {7613#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7614#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:12,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {7614#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7615#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:12,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {7615#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7616#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:12,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {7616#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7617#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:12,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {7617#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7618#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:12,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {7618#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7619#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:12,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {7619#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7620#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:12,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {7620#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7621#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:12,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {7621#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7622#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:12,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {7622#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7623#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:12,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {7623#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7624#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:12,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {7624#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7625#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:12,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {7625#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7626#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:12,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {7626#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7627#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:12,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 12:03:12,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {7606#false} ~i~0 := 0; {7606#false} is VALID [2018-11-23 12:03:12,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,040 INFO L273 TraceCheckUtils]: 33: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {7606#false} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {7606#false} havoc ~x~0;~x~0 := 0; {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {7606#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L256 TraceCheckUtils]: 51: Hoare triple {7606#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {7606#false} ~cond := #in~cond; {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {7606#false} assume 0 == ~cond; {7606#false} is VALID [2018-11-23 12:03:12,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {7606#false} assume !false; {7606#false} is VALID [2018-11-23 12:03:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:03:12,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:12,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:12,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:12,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:12,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:12,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {7605#true} call ULTIMATE.init(); {7605#true} is VALID [2018-11-23 12:03:12,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {7605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7605#true} is VALID [2018-11-23 12:03:12,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {7605#true} assume true; {7605#true} is VALID [2018-11-23 12:03:12,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7605#true} {7605#true} #61#return; {7605#true} is VALID [2018-11-23 12:03:12,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {7605#true} call #t~ret2 := main(); {7605#true} is VALID [2018-11-23 12:03:12,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {7605#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7646#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:12,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {7646#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7608#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {7608#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7609#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {7609#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7610#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {7610#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7611#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {7611#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7612#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {7612#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7613#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {7613#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7614#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:12,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {7614#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7615#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:12,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {7615#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7616#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:12,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {7616#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7617#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:12,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {7617#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7618#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:12,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {7618#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7619#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:12,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {7619#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7620#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:12,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {7620#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7621#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:12,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {7621#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7622#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:12,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {7622#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7623#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:12,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {7623#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7624#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:12,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {7624#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7625#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:12,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {7625#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7626#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:12,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {7626#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7627#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:12,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 12:03:12,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {7606#false} ~i~0 := 0; {7606#false} is VALID [2018-11-23 12:03:12,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,270 INFO L273 TraceCheckUtils]: 39: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,271 INFO L273 TraceCheckUtils]: 41: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,271 INFO L273 TraceCheckUtils]: 43: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,271 INFO L273 TraceCheckUtils]: 44: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 12:03:12,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {7606#false} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 12:03:12,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {7606#false} havoc ~x~0;~x~0 := 0; {7606#false} is VALID [2018-11-23 12:03:12,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {7606#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7606#false} is VALID [2018-11-23 12:03:12,273 INFO L256 TraceCheckUtils]: 51: Hoare triple {7606#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7606#false} is VALID [2018-11-23 12:03:12,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {7606#false} ~cond := #in~cond; {7606#false} is VALID [2018-11-23 12:03:12,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {7606#false} assume 0 == ~cond; {7606#false} is VALID [2018-11-23 12:03:12,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {7606#false} assume !false; {7606#false} is VALID [2018-11-23 12:03:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:03:12,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:12,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:03:12,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 12:03:12,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:12,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:03:12,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:12,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:03:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:03:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:03:12,330 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2018-11-23 12:03:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,762 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-23 12:03:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:03:12,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 12:03:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:03:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2018-11-23 12:03:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:03:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2018-11-23 12:03:12,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 80 transitions. [2018-11-23 12:03:12,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:12,848 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:03:12,849 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:03:12,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:03:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:03:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 12:03:12,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:12,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 12:03:12,987 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:03:12,987 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:03:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,988 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:03:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 12:03:12,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,989 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:03:12,989 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:03:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,991 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:03:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 12:03:12,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:12,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:03:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 12:03:12,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2018-11-23 12:03:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:12,993 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 12:03:12,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:03:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 12:03:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:03:12,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:12,994 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:12,994 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:12,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1931036901, now seen corresponding path program 21 times [2018-11-23 12:03:12,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:13,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {8200#true} call ULTIMATE.init(); {8200#true} is VALID [2018-11-23 12:03:13,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {8200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8200#true} is VALID [2018-11-23 12:03:13,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {8200#true} assume true; {8200#true} is VALID [2018-11-23 12:03:13,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8200#true} {8200#true} #61#return; {8200#true} is VALID [2018-11-23 12:03:13,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {8200#true} call #t~ret2 := main(); {8200#true} is VALID [2018-11-23 12:03:13,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {8200#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8202#(= main_~i~0 0)} is VALID [2018-11-23 12:03:13,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {8202#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8203#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:13,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {8203#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8204#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:13,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {8204#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8205#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:13,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {8205#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8206#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:13,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {8206#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8207#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:13,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {8207#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8208#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:13,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {8208#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8209#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:13,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {8209#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8210#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:13,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {8210#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8211#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:13,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {8211#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8212#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:13,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {8212#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8213#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:13,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {8213#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8214#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:13,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {8214#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8215#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:13,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {8215#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8216#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:13,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {8216#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8217#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:13,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {8217#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8218#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:13,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {8218#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8219#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:13,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {8219#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8220#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:13,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {8220#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8221#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:13,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {8221#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8222#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:13,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {8222#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8223#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:13,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {8223#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 12:03:13,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {8201#false} ~i~0 := 0; {8201#false} is VALID [2018-11-23 12:03:13,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,379 INFO L273 TraceCheckUtils]: 38: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 49: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 50: Hoare triple {8201#false} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {8201#false} havoc ~x~0;~x~0 := 0; {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {8201#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L256 TraceCheckUtils]: 53: Hoare triple {8201#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {8201#false} ~cond := #in~cond; {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {8201#false} assume 0 == ~cond; {8201#false} is VALID [2018-11-23 12:03:13,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {8201#false} assume !false; {8201#false} is VALID [2018-11-23 12:03:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 12:03:13,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:13,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:13,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:15,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:03:15,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:15,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {8200#true} call ULTIMATE.init(); {8200#true} is VALID [2018-11-23 12:03:15,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {8200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8200#true} is VALID [2018-11-23 12:03:15,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {8200#true} assume true; {8200#true} is VALID [2018-11-23 12:03:15,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8200#true} {8200#true} #61#return; {8200#true} is VALID [2018-11-23 12:03:15,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {8200#true} call #t~ret2 := main(); {8200#true} is VALID [2018-11-23 12:03:15,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {8200#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8242#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:15,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {8242#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8203#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {8203#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8204#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {8204#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8205#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {8205#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8206#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {8206#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8207#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {8207#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8208#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {8208#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8209#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {8209#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8210#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:15,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {8210#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8211#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:15,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {8211#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8212#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:15,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {8212#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8213#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:15,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {8213#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8214#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:15,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {8214#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8215#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:15,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {8215#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8216#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:15,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {8216#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8217#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:15,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {8217#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8218#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:15,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {8218#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8219#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:15,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {8219#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8220#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:15,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {8220#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8221#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:15,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {8221#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8222#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:15,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {8222#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8223#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:15,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {8223#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 12:03:15,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {8201#false} ~i~0 := 0; {8201#false} is VALID [2018-11-23 12:03:15,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,723 INFO L273 TraceCheckUtils]: 30: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,723 INFO L273 TraceCheckUtils]: 31: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,723 INFO L273 TraceCheckUtils]: 32: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,724 INFO L273 TraceCheckUtils]: 33: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,724 INFO L273 TraceCheckUtils]: 34: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,724 INFO L273 TraceCheckUtils]: 36: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,724 INFO L273 TraceCheckUtils]: 37: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,725 INFO L273 TraceCheckUtils]: 38: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,725 INFO L273 TraceCheckUtils]: 39: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,725 INFO L273 TraceCheckUtils]: 42: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,726 INFO L273 TraceCheckUtils]: 45: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {8201#false} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {8201#false} havoc ~x~0;~x~0 := 0; {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {8201#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8201#false} is VALID [2018-11-23 12:03:15,727 INFO L256 TraceCheckUtils]: 53: Hoare triple {8201#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8201#false} is VALID [2018-11-23 12:03:15,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {8201#false} ~cond := #in~cond; {8201#false} is VALID [2018-11-23 12:03:15,728 INFO L273 TraceCheckUtils]: 55: Hoare triple {8201#false} assume 0 == ~cond; {8201#false} is VALID [2018-11-23 12:03:15,728 INFO L273 TraceCheckUtils]: 56: Hoare triple {8201#false} assume !false; {8201#false} is VALID [2018-11-23 12:03:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 12:03:15,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:15,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:03:15,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 12:03:15,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:15,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:03:15,781 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 12:03:15,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:03:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:03:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:03:15,783 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 25 states. [2018-11-23 12:03:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,314 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-11-23 12:03:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:03:16,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 12:03:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:03:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 12:03:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:03:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 12:03:16,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 82 transitions. [2018-11-23 12:03:16,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:16,401 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:03:16,401 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:03:16,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:03:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:03:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:03:16,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:16,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:16,454 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:16,454 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,456 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:03:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:03:16,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,456 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:16,456 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,457 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:03:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:03:16,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:16,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:03:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 12:03:16,459 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2018-11-23 12:03:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:16,459 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 12:03:16,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:03:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:03:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:03:16,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:16,460 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:16,461 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:16,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash 173663974, now seen corresponding path program 22 times [2018-11-23 12:03:16,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:16,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:16,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 12:03:16,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 12:03:16,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 12:03:16,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #61#return; {8816#true} is VALID [2018-11-23 12:03:16,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret2 := main(); {8816#true} is VALID [2018-11-23 12:03:16,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8818#(= main_~i~0 0)} is VALID [2018-11-23 12:03:16,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {8818#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8819#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {8819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8820#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {8820#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8821#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {8821#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8822#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {8822#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8823#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {8823#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8824#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {8824#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8825#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {8825#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8826#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:16,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {8826#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8827#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:16,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8828#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:16,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8829#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:16,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8830#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:16,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {8830#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8831#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:16,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {8831#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8832#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:16,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {8832#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8833#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:16,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {8833#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8834#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:16,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {8834#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8835#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:16,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {8835#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8836#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:16,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {8836#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8837#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:16,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {8837#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8838#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:16,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {8838#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8839#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:16,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {8839#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8840#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:16,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {8840#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:03:16,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 12:03:16,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 41: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 52: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 53: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L256 TraceCheckUtils]: 55: Hoare triple {8817#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 12:03:16,921 INFO L273 TraceCheckUtils]: 57: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 12:03:16,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 12:03:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:03:16,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:16,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:16,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:16,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:17,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:17,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 12:03:17,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 12:03:17,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 12:03:17,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #61#return; {8816#true} is VALID [2018-11-23 12:03:17,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret2 := main(); {8816#true} is VALID [2018-11-23 12:03:17,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8859#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:17,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {8859#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8819#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:17,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {8819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8820#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:17,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {8820#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8821#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:17,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {8821#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8822#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:17,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {8822#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8823#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:17,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {8823#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8824#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:17,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {8824#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8825#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:17,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {8825#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8826#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:17,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {8826#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8827#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:17,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8828#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:17,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8829#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:17,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8830#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:17,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {8830#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8831#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:17,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {8831#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8832#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:17,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {8832#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8833#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:17,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {8833#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8834#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:17,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {8834#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8835#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:17,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {8835#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8836#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:17,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {8836#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8837#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:17,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {8837#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8838#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:17,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {8838#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8839#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:17,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {8839#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8840#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:17,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {8840#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:03:17,245 INFO L273 TraceCheckUtils]: 29: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 12:03:17,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,247 INFO L273 TraceCheckUtils]: 39: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 44: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L256 TraceCheckUtils]: 55: Hoare triple {8817#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 57: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 12:03:17,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 12:03:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:03:17,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:03:17,271 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 12:03:17,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:17,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:03:17,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:17,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:03:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:03:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:17,304 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 26 states. [2018-11-23 12:03:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,729 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 12:03:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:03:17,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 12:03:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 84 transitions. [2018-11-23 12:03:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 84 transitions. [2018-11-23 12:03:17,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 84 transitions. [2018-11-23 12:03:17,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:17,819 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:03:17,819 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:03:17,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:03:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 12:03:17,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:17,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 12:03:17,885 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 12:03:17,885 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 12:03:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,886 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:03:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:03:17,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,887 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 12:03:17,887 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 12:03:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,888 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:03:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:03:17,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:17,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:03:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 12:03:17,890 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2018-11-23 12:03:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:17,890 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 12:03:17,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:03:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:03:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:03:17,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:17,891 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:17,891 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:17,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1433416069, now seen corresponding path program 23 times [2018-11-23 12:03:17,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:17,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 12:03:18,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9453#true} is VALID [2018-11-23 12:03:18,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 12:03:18,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9453#true} {9453#true} #61#return; {9453#true} is VALID [2018-11-23 12:03:18,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {9453#true} call #t~ret2 := main(); {9453#true} is VALID [2018-11-23 12:03:18,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {9453#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9455#(= main_~i~0 0)} is VALID [2018-11-23 12:03:18,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {9455#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9456#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {9456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9457#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {9457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9458#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9459#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9460#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {9460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9461#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {9461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9462#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {9462#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9463#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {9463#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9464#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:18,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {9464#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9465#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:18,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {9465#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9466#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:18,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {9466#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9467#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:18,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {9467#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9468#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:18,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {9468#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9469#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:18,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {9469#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9470#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:18,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {9470#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9471#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:18,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {9471#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9472#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:18,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {9472#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9473#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {9473#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9474#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {9474#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9475#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {9475#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9476#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {9476#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9477#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {9477#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9478#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {9454#false} ~i~0 := 0; {9454#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 53: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {9454#false} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {9454#false} havoc ~x~0;~x~0 := 0; {9454#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9454#false} is VALID [2018-11-23 12:03:18,375 INFO L256 TraceCheckUtils]: 57: Hoare triple {9454#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9454#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#false} ~cond := #in~cond; {9454#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#false} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 12:03:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:03:18,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:18,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:18,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:11,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:04:11,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:11,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:11,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 12:04:11,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9453#true} is VALID [2018-11-23 12:04:11,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 12:04:11,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9453#true} {9453#true} #61#return; {9453#true} is VALID [2018-11-23 12:04:11,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {9453#true} call #t~ret2 := main(); {9453#true} is VALID [2018-11-23 12:04:11,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {9453#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9497#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:11,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {9497#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9456#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:11,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {9456#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9457#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:11,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {9457#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9458#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:11,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9459#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:11,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9460#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:11,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {9460#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9461#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:11,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {9461#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9462#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:11,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {9462#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9463#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:11,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {9463#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9464#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:11,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {9464#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9465#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:11,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {9465#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9466#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:11,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {9466#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9467#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:11,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {9467#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9468#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:11,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {9468#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9469#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:11,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {9469#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9470#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:11,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {9470#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9471#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:11,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {9471#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9472#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:11,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {9472#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9473#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:11,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {9473#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9474#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:11,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {9474#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9475#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:11,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {9475#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9476#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:11,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {9476#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9477#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:11,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {9477#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9478#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:11,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 12:04:11,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {9454#false} ~i~0 := 0; {9454#false} is VALID [2018-11-23 12:04:11,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,925 INFO L273 TraceCheckUtils]: 49: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 51: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 54: Hoare triple {9454#false} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 55: Hoare triple {9454#false} havoc ~x~0;~x~0 := 0; {9454#false} is VALID [2018-11-23 12:04:11,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9454#false} is VALID [2018-11-23 12:04:11,927 INFO L256 TraceCheckUtils]: 57: Hoare triple {9454#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9454#false} is VALID [2018-11-23 12:04:11,927 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#false} ~cond := #in~cond; {9454#false} is VALID [2018-11-23 12:04:11,927 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#false} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 12:04:11,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 12:04:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:04:11,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:11,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:04:11,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 12:04:11,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:11,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:04:11,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:11,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:04:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:04:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:04:11,990 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 27 states. [2018-11-23 12:04:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:12,552 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-11-23 12:04:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:04:12,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 12:04:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:04:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 86 transitions. [2018-11-23 12:04:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:04:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 86 transitions. [2018-11-23 12:04:12,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 86 transitions. [2018-11-23 12:04:12,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:12,735 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:04:12,735 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:04:12,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:04:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:04:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 12:04:12,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:12,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 12:04:12,785 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 12:04:12,785 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 12:04:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:12,786 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:04:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 12:04:12,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:12,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:12,787 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 12:04:12,787 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 12:04:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:12,788 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:04:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 12:04:12,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:12,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:12,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:12,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:04:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 12:04:12,790 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2018-11-23 12:04:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:12,791 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 12:04:12,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:04:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 12:04:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:04:12,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:12,792 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:12,792 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:12,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -482458810, now seen corresponding path program 24 times [2018-11-23 12:04:12,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:12,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:12,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:13,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {10111#true} call ULTIMATE.init(); {10111#true} is VALID [2018-11-23 12:04:13,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {10111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10111#true} is VALID [2018-11-23 12:04:13,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {10111#true} assume true; {10111#true} is VALID [2018-11-23 12:04:13,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10111#true} {10111#true} #61#return; {10111#true} is VALID [2018-11-23 12:04:13,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {10111#true} call #t~ret2 := main(); {10111#true} is VALID [2018-11-23 12:04:13,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {10111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10113#(= main_~i~0 0)} is VALID [2018-11-23 12:04:13,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {10113#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10114#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:13,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {10114#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10115#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:13,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {10115#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10116#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:13,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {10116#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10117#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:13,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {10117#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10118#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:13,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {10118#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10119#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:13,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {10119#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10120#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:13,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {10120#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10121#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:13,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {10121#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10122#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:13,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {10122#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10123#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:13,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {10123#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10124#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:13,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {10124#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10125#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:13,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {10125#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10126#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:13,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {10126#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10127#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:13,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {10127#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10128#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:13,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {10128#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10129#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:13,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {10129#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10130#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:13,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {10130#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10131#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:13,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {10131#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10132#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:13,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {10132#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10133#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:13,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {10133#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10134#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:13,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {10134#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10135#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:13,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {10135#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10136#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:13,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {10136#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10137#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:13,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {10137#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 12:04:13,853 INFO L273 TraceCheckUtils]: 31: Hoare triple {10112#false} ~i~0 := 0; {10112#false} is VALID [2018-11-23 12:04:13,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,853 INFO L273 TraceCheckUtils]: 33: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,855 INFO L273 TraceCheckUtils]: 40: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,855 INFO L273 TraceCheckUtils]: 41: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,856 INFO L273 TraceCheckUtils]: 45: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 51: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 52: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,857 INFO L273 TraceCheckUtils]: 55: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {10112#false} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {10112#false} havoc ~x~0;~x~0 := 0; {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {10112#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L256 TraceCheckUtils]: 59: Hoare triple {10112#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {10112#false} ~cond := #in~cond; {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 61: Hoare triple {10112#false} assume 0 == ~cond; {10112#false} is VALID [2018-11-23 12:04:13,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2018-11-23 12:04:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:04:13,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:13,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:13,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:07,436 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:05:07,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:07,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:07,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {10111#true} call ULTIMATE.init(); {10111#true} is VALID [2018-11-23 12:05:07,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {10111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10111#true} is VALID [2018-11-23 12:05:07,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {10111#true} assume true; {10111#true} is VALID [2018-11-23 12:05:07,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10111#true} {10111#true} #61#return; {10111#true} is VALID [2018-11-23 12:05:07,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {10111#true} call #t~ret2 := main(); {10111#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {10111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10111#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 25: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 26: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 30: Hoare triple {10111#true} assume !(~i~0 < 100000); {10111#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {10111#true} ~i~0 := 0; {10234#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {10234#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10114#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {10114#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10115#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {10115#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10116#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {10116#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10117#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {10117#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10118#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {10118#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10119#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {10119#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10120#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {10120#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10121#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {10121#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10122#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:07,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {10122#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10123#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:07,681 INFO L273 TraceCheckUtils]: 42: Hoare triple {10123#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10124#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:07,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {10124#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10125#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:07,683 INFO L273 TraceCheckUtils]: 44: Hoare triple {10125#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10126#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:07,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {10126#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10127#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:07,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {10127#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10128#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:07,686 INFO L273 TraceCheckUtils]: 47: Hoare triple {10128#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10129#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:07,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {10129#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10130#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:07,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {10130#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10131#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:07,689 INFO L273 TraceCheckUtils]: 50: Hoare triple {10131#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10132#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:07,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {10132#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10133#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:07,690 INFO L273 TraceCheckUtils]: 52: Hoare triple {10133#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10134#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:07,691 INFO L273 TraceCheckUtils]: 53: Hoare triple {10134#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10135#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:07,692 INFO L273 TraceCheckUtils]: 54: Hoare triple {10135#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10136#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:07,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {10136#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10137#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:07,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {10137#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 12:05:07,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {10112#false} havoc ~x~0;~x~0 := 0; {10112#false} is VALID [2018-11-23 12:05:07,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {10112#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10112#false} is VALID [2018-11-23 12:05:07,695 INFO L256 TraceCheckUtils]: 59: Hoare triple {10112#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10112#false} is VALID [2018-11-23 12:05:07,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {10112#false} ~cond := #in~cond; {10112#false} is VALID [2018-11-23 12:05:07,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {10112#false} assume 0 == ~cond; {10112#false} is VALID [2018-11-23 12:05:07,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2018-11-23 12:05:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:05:07,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:07,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:05:07,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-23 12:05:07,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:07,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:05:07,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:07,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:05:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:05:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:07,807 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 28 states. [2018-11-23 12:05:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,364 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:05:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:05:08,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-23 12:05:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 88 transitions. [2018-11-23 12:05:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:05:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 88 transitions. [2018-11-23 12:05:08,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 88 transitions. [2018-11-23 12:05:08,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,463 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:05:08,463 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:05:08,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:05:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:05:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 12:05:08,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:08,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 12:05:08,531 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:05:08,531 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:05:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,533 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:05:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 12:05:08,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,534 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:05:08,534 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:05:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,535 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:05:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 12:05:08,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:08,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:05:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-23 12:05:08,537 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2018-11-23 12:05:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:08,537 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 12:05:08,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:05:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 12:05:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:05:08,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:08,538 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:08,538 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1789743653, now seen corresponding path program 25 times [2018-11-23 12:05:08,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:08,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {10790#true} call ULTIMATE.init(); {10790#true} is VALID [2018-11-23 12:05:10,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {10790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10790#true} is VALID [2018-11-23 12:05:10,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {10790#true} assume true; {10790#true} is VALID [2018-11-23 12:05:10,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10790#true} {10790#true} #61#return; {10790#true} is VALID [2018-11-23 12:05:10,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {10790#true} call #t~ret2 := main(); {10790#true} is VALID [2018-11-23 12:05:10,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {10790#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10792#(= main_~i~0 0)} is VALID [2018-11-23 12:05:10,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {10792#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10793#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {10793#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10794#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {10794#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10795#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {10795#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10796#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {10796#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10797#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {10797#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10798#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {10798#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10799#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {10799#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10800#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:10,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {10800#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:10,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {10801#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10802#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:10,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {10802#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10803#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:10,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10804#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:10,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {10804#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10805#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:10,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {10805#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10806#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:10,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {10806#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10807#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:10,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {10807#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10808#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:10,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {10808#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10809#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:10,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {10809#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10810#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:10,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {10810#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10811#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:10,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10812#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:10,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10813#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:10,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {10813#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10814#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:10,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {10814#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10815#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:10,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {10815#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10816#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:10,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {10816#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:10,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {10817#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 12:05:10,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {10791#false} ~i~0 := 0; {10791#false} is VALID [2018-11-23 12:05:10,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,200 INFO L273 TraceCheckUtils]: 35: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,201 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 45: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,202 INFO L273 TraceCheckUtils]: 49: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,203 INFO L273 TraceCheckUtils]: 51: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,203 INFO L273 TraceCheckUtils]: 52: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {10791#false} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {10791#false} havoc ~x~0;~x~0 := 0; {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {10791#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L256 TraceCheckUtils]: 61: Hoare triple {10791#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10791#false} is VALID [2018-11-23 12:05:10,204 INFO L273 TraceCheckUtils]: 62: Hoare triple {10791#false} ~cond := #in~cond; {10791#false} is VALID [2018-11-23 12:05:10,205 INFO L273 TraceCheckUtils]: 63: Hoare triple {10791#false} assume 0 == ~cond; {10791#false} is VALID [2018-11-23 12:05:10,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {10791#false} assume !false; {10791#false} is VALID [2018-11-23 12:05:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-23 12:05:10,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:10,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:10,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:10,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {10790#true} call ULTIMATE.init(); {10790#true} is VALID [2018-11-23 12:05:10,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {10790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10790#true} is VALID [2018-11-23 12:05:10,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {10790#true} assume true; {10790#true} is VALID [2018-11-23 12:05:10,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10790#true} {10790#true} #61#return; {10790#true} is VALID [2018-11-23 12:05:10,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {10790#true} call #t~ret2 := main(); {10790#true} is VALID [2018-11-23 12:05:10,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {10790#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10836#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:10,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {10836#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10793#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:10,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {10793#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10794#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:10,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {10794#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10795#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:10,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {10795#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10796#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:10,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {10796#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10797#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:10,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {10797#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10798#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:10,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {10798#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10799#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:10,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {10799#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10800#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:10,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {10800#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10801#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:10,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {10801#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10802#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:10,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {10802#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10803#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:10,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10804#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:10,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {10804#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10805#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:10,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {10805#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10806#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:10,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {10806#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10807#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:10,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {10807#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10808#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:10,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {10808#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10809#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:10,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {10809#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10810#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:10,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {10810#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10811#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:10,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10812#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:10,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10813#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:10,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {10813#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10814#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:10,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {10814#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10815#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:10,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {10815#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10816#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:10,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {10816#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:10,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {10817#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 12:05:10,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {10791#false} ~i~0 := 0; {10791#false} is VALID [2018-11-23 12:05:10,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 41: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 45: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 46: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,451 INFO L273 TraceCheckUtils]: 47: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 48: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 49: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 56: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 58: Hoare triple {10791#false} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 59: Hoare triple {10791#false} havoc ~x~0;~x~0 := 0; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {10791#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L256 TraceCheckUtils]: 61: Hoare triple {10791#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {10791#false} ~cond := #in~cond; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {10791#false} assume 0 == ~cond; {10791#false} is VALID [2018-11-23 12:05:10,453 INFO L273 TraceCheckUtils]: 64: Hoare triple {10791#false} assume !false; {10791#false} is VALID [2018-11-23 12:05:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-23 12:05:10,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:05:10,475 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-23 12:05:10,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:10,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:05:10,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:10,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:05:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:05:10,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:10,506 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 29 states. [2018-11-23 12:05:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,834 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-23 12:05:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:05:10,834 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-23 12:05:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2018-11-23 12:05:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2018-11-23 12:05:10,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 90 transitions. [2018-11-23 12:05:10,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:10,929 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:05:10,929 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:05:10,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:05:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:05:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 12:05:10,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:10,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 12:05:10,991 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:05:10,991 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:05:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,992 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:05:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:05:10,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:10,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:10,993 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:05:10,993 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:05:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,994 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:05:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:05:10,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:10,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:10,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:10,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:05:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 12:05:10,996 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2018-11-23 12:05:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:10,997 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 12:05:10,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:05:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:05:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:05:10,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:10,998 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:10,998 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:10,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash 964880294, now seen corresponding path program 26 times [2018-11-23 12:05:10,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:10,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:10,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {11490#true} call ULTIMATE.init(); {11490#true} is VALID [2018-11-23 12:05:12,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {11490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11490#true} is VALID [2018-11-23 12:05:12,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {11490#true} assume true; {11490#true} is VALID [2018-11-23 12:05:12,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11490#true} {11490#true} #61#return; {11490#true} is VALID [2018-11-23 12:05:12,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {11490#true} call #t~ret2 := main(); {11490#true} is VALID [2018-11-23 12:05:12,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {11490#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11492#(= main_~i~0 0)} is VALID [2018-11-23 12:05:12,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {11492#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11493#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {11493#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11494#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {11494#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11495#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {11495#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11496#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {11496#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11497#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {11497#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11498#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {11498#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11499#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {11499#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11500#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {11500#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11501#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {11501#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11502#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {11502#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11503#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {11503#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11504#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {11504#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11505#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {11505#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11506#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {11506#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11507#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:12,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {11507#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11508#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:12,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {11508#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11509#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:12,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {11509#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11510#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:12,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {11510#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11511#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:12,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {11511#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11512#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:12,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {11512#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11513#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:12,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {11513#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11514#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:12,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {11514#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11515#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:12,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {11515#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11516#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:12,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {11516#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11517#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:12,627 INFO L273 TraceCheckUtils]: 31: Hoare triple {11517#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11518#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:12,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {11518#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 12:05:12,628 INFO L273 TraceCheckUtils]: 33: Hoare triple {11491#false} ~i~0 := 0; {11491#false} is VALID [2018-11-23 12:05:12,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,628 INFO L273 TraceCheckUtils]: 37: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 38: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 39: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,630 INFO L273 TraceCheckUtils]: 46: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,630 INFO L273 TraceCheckUtils]: 47: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,630 INFO L273 TraceCheckUtils]: 48: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 56: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 57: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 58: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {11491#false} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 61: Hoare triple {11491#false} havoc ~x~0;~x~0 := 0; {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L273 TraceCheckUtils]: 62: Hoare triple {11491#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11491#false} is VALID [2018-11-23 12:05:12,632 INFO L256 TraceCheckUtils]: 63: Hoare triple {11491#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11491#false} is VALID [2018-11-23 12:05:12,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {11491#false} ~cond := #in~cond; {11491#false} is VALID [2018-11-23 12:05:12,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {11491#false} assume 0 == ~cond; {11491#false} is VALID [2018-11-23 12:05:12,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {11491#false} assume !false; {11491#false} is VALID [2018-11-23 12:05:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 12:05:12,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:12,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:12,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:12,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:12,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {11490#true} call ULTIMATE.init(); {11490#true} is VALID [2018-11-23 12:05:12,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {11490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11490#true} is VALID [2018-11-23 12:05:12,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {11490#true} assume true; {11490#true} is VALID [2018-11-23 12:05:12,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11490#true} {11490#true} #61#return; {11490#true} is VALID [2018-11-23 12:05:12,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {11490#true} call #t~ret2 := main(); {11490#true} is VALID [2018-11-23 12:05:12,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {11490#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11537#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:12,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {11537#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11493#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {11493#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11494#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {11494#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11495#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {11495#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11496#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {11496#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11497#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {11497#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11498#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {11498#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11499#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {11499#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11500#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {11500#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11501#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {11501#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11502#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {11502#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11503#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {11503#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11504#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {11504#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11505#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {11505#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11506#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,895 INFO L273 TraceCheckUtils]: 20: Hoare triple {11506#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11507#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:12,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {11507#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11508#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:12,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {11508#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11509#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:12,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {11509#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11510#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:12,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {11510#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11511#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:12,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {11511#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11512#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:12,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {11512#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11513#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:12,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {11513#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11514#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:12,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {11514#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11515#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:12,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {11515#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11516#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:12,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {11516#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11517#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:12,905 INFO L273 TraceCheckUtils]: 31: Hoare triple {11517#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11518#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:12,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {11518#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 12:05:12,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {11491#false} ~i~0 := 0; {11491#false} is VALID [2018-11-23 12:05:12,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 49: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 59: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {11491#false} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {11491#false} havoc ~x~0;~x~0 := 0; {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {11491#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L256 TraceCheckUtils]: 63: Hoare triple {11491#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11491#false} is VALID [2018-11-23 12:05:12,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {11491#false} ~cond := #in~cond; {11491#false} is VALID [2018-11-23 12:05:12,911 INFO L273 TraceCheckUtils]: 65: Hoare triple {11491#false} assume 0 == ~cond; {11491#false} is VALID [2018-11-23 12:05:12,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {11491#false} assume !false; {11491#false} is VALID [2018-11-23 12:05:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 12:05:12,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:12,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:05:12,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 12:05:12,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:12,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:05:12,966 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 12:05:12,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:05:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:05:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:12,967 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 30 states. [2018-11-23 12:05:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,567 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-23 12:05:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:05:13,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 12:05:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2018-11-23 12:05:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:05:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2018-11-23 12:05:13,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 92 transitions. [2018-11-23 12:05:13,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:13,740 INFO L225 Difference]: With dead ends: 113 [2018-11-23 12:05:13,740 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:05:13,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:05:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:05:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 12:05:13,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:13,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 12:05:13,793 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 12:05:13,793 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 12:05:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,795 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 12:05:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 12:05:13,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,795 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 12:05:13,795 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 12:05:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,797 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 12:05:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 12:05:13,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:13,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:13,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:13,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:05:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 12:05:13,799 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2018-11-23 12:05:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:13,799 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 12:05:13,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:05:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 12:05:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:05:13,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:13,800 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:13,800 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 540191429, now seen corresponding path program 27 times [2018-11-23 12:05:13,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:14,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-23 12:05:14,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-23 12:05:14,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-23 12:05:14,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #61#return; {12211#true} is VALID [2018-11-23 12:05:14,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret2 := main(); {12211#true} is VALID [2018-11-23 12:05:14,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12213#(= main_~i~0 0)} is VALID [2018-11-23 12:05:14,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {12213#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12214#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:14,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {12214#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12215#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:14,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {12215#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12216#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:14,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {12216#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12217#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:14,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {12217#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12218#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:14,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {12218#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12219#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:14,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {12219#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12220#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:14,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12221#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:14,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12222#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:14,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {12222#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12223#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:14,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {12223#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12224#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:14,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {12224#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12225#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:14,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {12225#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12226#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:14,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {12226#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12227#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:14,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {12227#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12228#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:14,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {12228#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12229#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:14,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {12229#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12230#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:14,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {12230#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12231#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:14,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {12231#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12232#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:14,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {12232#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12233#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:14,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {12233#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12234#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:14,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {12234#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12235#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:14,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {12235#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12236#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:14,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {12236#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12237#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:14,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12238#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:14,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12239#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:14,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12240#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:14,299 INFO L273 TraceCheckUtils]: 33: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 12:05:14,300 INFO L273 TraceCheckUtils]: 34: Hoare triple {12212#false} ~i~0 := 0; {12212#false} is VALID [2018-11-23 12:05:14,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 40: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,302 INFO L273 TraceCheckUtils]: 45: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 50: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 51: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 53: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 54: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,303 INFO L273 TraceCheckUtils]: 55: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 58: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 59: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 62: Hoare triple {12212#false} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 12:05:14,304 INFO L273 TraceCheckUtils]: 63: Hoare triple {12212#false} havoc ~x~0;~x~0 := 0; {12212#false} is VALID [2018-11-23 12:05:14,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {12212#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12212#false} is VALID [2018-11-23 12:05:14,305 INFO L256 TraceCheckUtils]: 65: Hoare triple {12212#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12212#false} is VALID [2018-11-23 12:05:14,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-23 12:05:14,305 INFO L273 TraceCheckUtils]: 67: Hoare triple {12212#false} assume 0 == ~cond; {12212#false} is VALID [2018-11-23 12:05:14,305 INFO L273 TraceCheckUtils]: 68: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-23 12:05:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 12:05:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:14,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:14,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:23,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 12:05:23,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-23 12:05:23,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-23 12:05:23,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-23 12:05:23,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #61#return; {12211#true} is VALID [2018-11-23 12:05:23,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret2 := main(); {12211#true} is VALID [2018-11-23 12:05:23,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12211#true} is VALID [2018-11-23 12:05:23,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 12:05:23,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 100000)} is VALID [2018-11-23 12:05:23,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {12340#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12211#true} is VALID [2018-11-23 12:05:23,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {12211#true} ~i~0 := 0; {12347#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {12347#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12214#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {12214#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12215#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,861 INFO L273 TraceCheckUtils]: 37: Hoare triple {12215#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12216#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {12216#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12217#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {12217#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12218#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:23,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {12218#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12219#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:23,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {12219#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12220#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:23,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {12220#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12221#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:23,866 INFO L273 TraceCheckUtils]: 43: Hoare triple {12221#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12222#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:23,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {12222#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12223#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:23,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {12223#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12224#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:23,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {12224#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12225#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:23,869 INFO L273 TraceCheckUtils]: 47: Hoare triple {12225#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12226#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:23,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {12226#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12227#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:23,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {12227#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12228#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:23,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {12228#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12229#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:23,873 INFO L273 TraceCheckUtils]: 51: Hoare triple {12229#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12230#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:23,874 INFO L273 TraceCheckUtils]: 52: Hoare triple {12230#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12231#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:23,875 INFO L273 TraceCheckUtils]: 53: Hoare triple {12231#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12232#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:23,876 INFO L273 TraceCheckUtils]: 54: Hoare triple {12232#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12233#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:23,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {12233#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12234#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:23,877 INFO L273 TraceCheckUtils]: 56: Hoare triple {12234#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12235#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:23,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {12235#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12236#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:23,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {12236#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12237#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:23,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12238#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:23,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12239#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:23,882 INFO L273 TraceCheckUtils]: 61: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12240#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:23,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 12:05:23,883 INFO L273 TraceCheckUtils]: 63: Hoare triple {12212#false} havoc ~x~0;~x~0 := 0; {12212#false} is VALID [2018-11-23 12:05:23,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {12212#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12212#false} is VALID [2018-11-23 12:05:23,883 INFO L256 TraceCheckUtils]: 65: Hoare triple {12212#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12212#false} is VALID [2018-11-23 12:05:23,883 INFO L273 TraceCheckUtils]: 66: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-23 12:05:23,883 INFO L273 TraceCheckUtils]: 67: Hoare triple {12212#false} assume 0 == ~cond; {12212#false} is VALID [2018-11-23 12:05:23,884 INFO L273 TraceCheckUtils]: 68: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-23 12:05:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 12:05:23,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:23,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2018-11-23 12:05:23,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:05:23,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:23,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:05:24,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:24,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:05:24,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:05:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:24,009 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 32 states. [2018-11-23 12:05:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,573 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-23 12:05:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:05:24,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:05:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 94 transitions. [2018-11-23 12:05:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 94 transitions. [2018-11-23 12:05:24,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 94 transitions. [2018-11-23 12:05:24,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:24,676 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:05:24,676 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:05:24,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:05:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 12:05:24,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:24,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 12:05:24,791 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:05:24,792 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:05:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,793 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:05:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:05:24,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,794 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:05:24,794 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:05:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,795 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:05:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:05:24,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:24,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:05:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 12:05:24,797 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2018-11-23 12:05:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 12:05:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:05:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:05:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:05:24,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:24,798 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:24,799 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:24,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2142907386, now seen corresponding path program 28 times [2018-11-23 12:05:24,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {12954#true} call ULTIMATE.init(); {12954#true} is VALID [2018-11-23 12:05:25,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {12954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12954#true} is VALID [2018-11-23 12:05:25,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {12954#true} assume true; {12954#true} is VALID [2018-11-23 12:05:25,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12954#true} {12954#true} #61#return; {12954#true} is VALID [2018-11-23 12:05:25,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {12954#true} call #t~ret2 := main(); {12954#true} is VALID [2018-11-23 12:05:25,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {12954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12956#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {12956#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12957#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {12957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12958#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {12958#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12959#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {12959#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12960#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {12960#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12961#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {12961#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12962#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {12962#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12963#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {12963#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12964#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {12964#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12965#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {12965#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12966#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {12966#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12967#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {12967#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12968#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {12968#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12969#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {12969#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {12970#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {12971#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:25,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {12972#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:25,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {12973#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:25,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {12974#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:25,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:25,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {12976#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:25,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {12977#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:25,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {12978#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:25,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {12979#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:25,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {12980#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:25,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {12981#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:25,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {12982#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:25,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {12983#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:25,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 12:05:25,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {12955#false} ~i~0 := 0; {12955#false} is VALID [2018-11-23 12:05:25,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,388 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,389 INFO L273 TraceCheckUtils]: 45: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,389 INFO L273 TraceCheckUtils]: 46: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 62: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 63: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,391 INFO L273 TraceCheckUtils]: 64: Hoare triple {12955#false} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {12955#false} havoc ~x~0;~x~0 := 0; {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {12955#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L256 TraceCheckUtils]: 67: Hoare triple {12955#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {12955#false} ~cond := #in~cond; {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {12955#false} assume 0 == ~cond; {12955#false} is VALID [2018-11-23 12:05:25,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {12955#false} assume !false; {12955#false} is VALID [2018-11-23 12:05:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-23 12:05:25,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:25,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:25,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:25,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:25,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {12954#true} call ULTIMATE.init(); {12954#true} is VALID [2018-11-23 12:05:25,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {12954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12954#true} is VALID [2018-11-23 12:05:25,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {12954#true} assume true; {12954#true} is VALID [2018-11-23 12:05:25,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12954#true} {12954#true} #61#return; {12954#true} is VALID [2018-11-23 12:05:25,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {12954#true} call #t~ret2 := main(); {12954#true} is VALID [2018-11-23 12:05:25,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {12954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13003#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {13003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12957#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {12957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12958#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {12958#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12959#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {12959#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12960#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {12960#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12961#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {12961#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12962#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {12962#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12963#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {12963#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12964#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {12964#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12965#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {12965#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12966#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {12966#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12967#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {12967#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12968#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {12968#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12969#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {12969#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {12970#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {12971#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:25,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {12972#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:25,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {12973#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:25,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {12974#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:25,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:25,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {12976#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:25,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {12977#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:25,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {12978#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:25,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {12979#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:25,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {12980#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:25,680 INFO L273 TraceCheckUtils]: 31: Hoare triple {12981#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:25,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {12982#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:25,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {12983#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:25,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {12955#false} ~i~0 := 0; {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 58: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 59: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 60: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,686 INFO L273 TraceCheckUtils]: 61: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 62: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 63: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 64: Hoare triple {12955#false} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 65: Hoare triple {12955#false} havoc ~x~0;~x~0 := 0; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 66: Hoare triple {12955#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L256 TraceCheckUtils]: 67: Hoare triple {12955#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 68: Hoare triple {12955#false} ~cond := #in~cond; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 69: Hoare triple {12955#false} assume 0 == ~cond; {12955#false} is VALID [2018-11-23 12:05:25,687 INFO L273 TraceCheckUtils]: 70: Hoare triple {12955#false} assume !false; {12955#false} is VALID [2018-11-23 12:05:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-23 12:05:25,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:25,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:05:25,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 12:05:25,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:25,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:05:25,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:05:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:05:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:25,744 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 32 states. [2018-11-23 12:05:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,412 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 12:05:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:05:26,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 12:05:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 96 transitions. [2018-11-23 12:05:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 96 transitions. [2018-11-23 12:05:26,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 96 transitions. [2018-11-23 12:05:26,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,515 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:05:26,515 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:05:26,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:05:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:05:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 12:05:26,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:26,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 12:05:26,586 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 12:05:26,586 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 12:05:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,588 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:05:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 12:05:26,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,588 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 12:05:26,588 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 12:05:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:26,589 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:05:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 12:05:26,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:26,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:26,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:26,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:05:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-23 12:05:26,591 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2018-11-23 12:05:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:26,591 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-23 12:05:26,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:05:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 12:05:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:05:26,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:26,592 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:26,592 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:26,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1964885147, now seen corresponding path program 29 times [2018-11-23 12:05:26,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:26,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {13717#true} call ULTIMATE.init(); {13717#true} is VALID [2018-11-23 12:05:27,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {13717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13717#true} is VALID [2018-11-23 12:05:27,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {13717#true} assume true; {13717#true} is VALID [2018-11-23 12:05:27,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13717#true} {13717#true} #61#return; {13717#true} is VALID [2018-11-23 12:05:27,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {13717#true} call #t~ret2 := main(); {13717#true} is VALID [2018-11-23 12:05:27,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {13717#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13719#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {13719#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13720#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {13720#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13721#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {13721#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13722#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {13722#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13723#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {13723#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13724#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {13724#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13725#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {13725#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13726#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {13726#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13727#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {13727#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13728#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {13728#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13729#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {13729#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13730#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {13730#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13731#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {13731#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13732#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {13732#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13733#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {13733#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13734#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {13734#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13735#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {13735#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13736#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {13736#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13737#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {13737#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13738#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {13738#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13739#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {13739#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13740#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:27,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {13740#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13741#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:27,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {13741#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13742#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:27,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {13742#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13743#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:27,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {13743#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13744#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:27,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {13744#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13745#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:27,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {13745#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13746#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:27,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {13746#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13747#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:27,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {13747#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13748#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:27,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {13748#(<= main_~i~0 29)} assume !(~i~0 < 100000); {13718#false} is VALID [2018-11-23 12:05:27,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {13718#false} ~i~0 := 0; {13718#false} is VALID [2018-11-23 12:05:27,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,739 INFO L273 TraceCheckUtils]: 58: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 60: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 61: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 62: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 63: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 64: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 12:05:27,740 INFO L273 TraceCheckUtils]: 66: Hoare triple {13718#false} assume !(~i~0 < 100000); {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {13718#false} havoc ~x~0;~x~0 := 0; {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {13718#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L256 TraceCheckUtils]: 69: Hoare triple {13718#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L273 TraceCheckUtils]: 70: Hoare triple {13718#false} ~cond := #in~cond; {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L273 TraceCheckUtils]: 71: Hoare triple {13718#false} assume 0 == ~cond; {13718#false} is VALID [2018-11-23 12:05:27,741 INFO L273 TraceCheckUtils]: 72: Hoare triple {13718#false} assume !false; {13718#false} is VALID [2018-11-23 12:05:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-23 12:05:27,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1