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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:52:01,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:52:01,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:52:01,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:52:01,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:52:01,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:52:01,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:52:01,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:52:01,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:52:01,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:52:01,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:52:01,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:52:01,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:52:01,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:52:01,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:52:01,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:52:01,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:52:01,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:52:01,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:52:01,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:52:01,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:52:01,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:52:01,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:52:01,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:52:01,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:52:01,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:52:01,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:52:01,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:52:01,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:52:01,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:52:01,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:52:01,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:52:01,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:52:01,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:52:01,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:52:01,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:52:01,638 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-14 16:52:01,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:52:01,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:52:01,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:52:01,668 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:52:01,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:52:01,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:52:01,670 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:52:01,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:52:01,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:52:01,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:52:01,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:52:01,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:52:01,673 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:52:01,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:52:01,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:52:01,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:52:01,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:52:01,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:52:01,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:52:01,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:52:01,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:52:01,675 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:52:01,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:52:01,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:52:01,676 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:52:01,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:52:01,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:52:01,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:52:01,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:52:01,762 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:52:01,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-14 16:52:01,829 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547311bd0/f492cd312b224726a9fc6188f62b6980/FLAG28b5272db [2018-11-14 16:52:02,253 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:52:02,253 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-14 16:52:02,260 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547311bd0/f492cd312b224726a9fc6188f62b6980/FLAG28b5272db [2018-11-14 16:52:02,275 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547311bd0/f492cd312b224726a9fc6188f62b6980 [2018-11-14 16:52:02,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:52:02,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:52:02,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:52:02,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:52:02,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:52:02,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f35d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02, skipping insertion in model container [2018-11-14 16:52:02,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:52:02,334 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:52:02,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:52:02,542 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:52:02,569 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:52:02,594 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:52:02,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02 WrapperNode [2018-11-14 16:52:02,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:52:02,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:52:02,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:52:02,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:52:02,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2018-11-14 16:52:02,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:52:02,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:52:02,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:52:02,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:52:02,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (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-14 16:52:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:52:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:52:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:52:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:52:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:52:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:52:02,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:52:02,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:52:03,409 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:52:03,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:03 BoogieIcfgContainer [2018-11-14 16:52:03,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:52:03,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:52:03,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:52:03,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:52:03,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:52:02" (1/3) ... [2018-11-14 16:52:03,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d6e4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:03, skipping insertion in model container [2018-11-14 16:52:03,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (2/3) ... [2018-11-14 16:52:03,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d6e4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:03, skipping insertion in model container [2018-11-14 16:52:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:03" (3/3) ... [2018-11-14 16:52:03,419 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_false-unreach-call_ground.i [2018-11-14 16:52:03,429 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:52:03,438 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:52:03,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:52:03,490 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:52:03,491 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:52:03,491 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:52:03,491 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:52:03,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:52:03,492 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:52:03,492 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:52:03,492 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:52:03,492 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:52:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-14 16:52:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:52:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:03,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:03,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:03,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash 546316117, now seen corresponding path program 1 times [2018-11-14 16:52:03,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:03,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:03,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-14 16:52:03,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-14 16:52:03,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:52:03,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #78#return; {34#true} is VALID [2018-11-14 16:52:03,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret2 := main(); {34#true} is VALID [2018-11-14 16:52:03,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {34#true} is VALID [2018-11-14 16:52:03,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-14 16:52:03,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-14 16:52:03,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 16:52:03,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-14 16:52:03,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 16:52:03,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} havoc ~x~0;~x~0 := 0; {35#false} is VALID [2018-11-14 16:52:03,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-14 16:52:03,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {35#false} is VALID [2018-11-14 16:52:03,737 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {35#false} is VALID [2018-11-14 16:52:03,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-14 16:52:03,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume ~cond == 0; {35#false} is VALID [2018-11-14 16:52:03,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-14 16:52:03,743 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-14 16:52:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:03,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:52:03,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:52:03,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:03,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:52:03,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:03,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:52:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:52:03,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:52:03,915 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-14 16:52:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,200 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-14 16:52:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:52:04,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:52:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-14 16:52:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-14 16:52:04,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-14 16:52:04,533 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-14 16:52:04,544 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:52:04,544 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 16:52:04,548 INFO L604 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-14 16:52:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 16:52:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 16:52:04,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:04,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 16:52:04,602 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:52:04,602 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:52:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,608 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:52:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:52:04,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:04,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:04,609 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:52:04,609 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:52:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,614 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:52:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:52:04,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:04,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:04,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:04,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:52:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 16:52:04,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2018-11-14 16:52:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:04,623 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 16:52:04,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:52:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:52:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:52:04,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:04,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:04,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1482380482, now seen corresponding path program 1 times [2018-11-14 16:52:04,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:04,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:04,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:04,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2018-11-14 16:52:04,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {195#true} is VALID [2018-11-14 16:52:04,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2018-11-14 16:52:04,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #78#return; {195#true} is VALID [2018-11-14 16:52:04,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2018-11-14 16:52:04,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {197#(= main_~i~0 0)} is VALID [2018-11-14 16:52:04,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= main_~i~0 0)} assume true; {197#(= main_~i~0 0)} is VALID [2018-11-14 16:52:04,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {197#(= main_~i~0 0)} assume !(~i~0 < 100000); {196#false} is VALID [2018-11-14 16:52:04,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#false} ~i~0 := 0; {196#false} is VALID [2018-11-14 16:52:04,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#false} assume true; {196#false} is VALID [2018-11-14 16:52:04,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#false} assume !(~i~0 < 100000); {196#false} is VALID [2018-11-14 16:52:04,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {196#false} ~i~0 := 0; {196#false} is VALID [2018-11-14 16:52:04,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {196#false} assume true; {196#false} is VALID [2018-11-14 16:52:04,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {196#false} assume !(~i~0 < 100000); {196#false} is VALID [2018-11-14 16:52:04,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {196#false} havoc ~x~0;~x~0 := 0; {196#false} is VALID [2018-11-14 16:52:04,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {196#false} assume true; {196#false} is VALID [2018-11-14 16:52:04,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {196#false} is VALID [2018-11-14 16:52:04,724 INFO L256 TraceCheckUtils]: 17: Hoare triple {196#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {196#false} is VALID [2018-11-14 16:52:04,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {196#false} ~cond := #in~cond; {196#false} is VALID [2018-11-14 16:52:04,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {196#false} assume ~cond == 0; {196#false} is VALID [2018-11-14 16:52:04,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {196#false} assume !false; {196#false} is VALID [2018-11-14 16:52:04,727 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-14 16:52:04,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:04,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:52:04,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:52:04,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:04,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:52:04,792 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-14 16:52:04,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:52:04,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:52:04,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:52:04,793 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-14 16:52:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,037 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 16:52:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:52:05,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:52:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:52:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:52:05,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 16:52:05,380 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-14 16:52:05,382 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:52:05,383 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:52:05,384 INFO L604 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-14 16:52:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:52:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 16:52:05,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:05,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 16:52:05,416 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:52:05,416 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:52:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,419 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:52:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:52:05,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:05,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:05,421 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:52:05,421 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:52:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,424 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:52:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:52:05,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:05,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:05,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:05,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:52:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 16:52:05,428 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2018-11-14 16:52:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:05,429 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 16:52:05,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:52:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:52:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:52:05,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:05,430 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:05,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:05,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash -920677416, now seen corresponding path program 1 times [2018-11-14 16:52:05,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:05,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2018-11-14 16:52:05,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {377#true} is VALID [2018-11-14 16:52:05,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2018-11-14 16:52:05,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #78#return; {377#true} is VALID [2018-11-14 16:52:05,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret2 := main(); {377#true} is VALID [2018-11-14 16:52:05,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {377#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {379#(= main_~i~0 0)} is VALID [2018-11-14 16:52:05,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {379#(= main_~i~0 0)} assume true; {379#(= main_~i~0 0)} is VALID [2018-11-14 16:52:05,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {380#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(<= main_~i~0 1)} assume true; {380#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {380#(<= main_~i~0 1)} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#false} ~i~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {378#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {378#false} is VALID [2018-11-14 16:52:05,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {378#false} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {378#false} ~i~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {378#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {378#false} is VALID [2018-11-14 16:52:05,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {378#false} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {378#false} havoc ~x~0;~x~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {378#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {378#false} is VALID [2018-11-14 16:52:05,569 INFO L256 TraceCheckUtils]: 23: Hoare triple {378#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {378#false} is VALID [2018-11-14 16:52:05,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {378#false} ~cond := #in~cond; {378#false} is VALID [2018-11-14 16:52:05,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {378#false} assume ~cond == 0; {378#false} is VALID [2018-11-14 16:52:05,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {378#false} assume !false; {378#false} is VALID [2018-11-14 16:52:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:52:05,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:05,573 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-14 16:52:05,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:05,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:05,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2018-11-14 16:52:05,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {377#true} is VALID [2018-11-14 16:52:05,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2018-11-14 16:52:05,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #78#return; {377#true} is VALID [2018-11-14 16:52:05,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret2 := main(); {377#true} is VALID [2018-11-14 16:52:05,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {377#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {399#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:05,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#(<= main_~i~0 0)} assume true; {399#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:05,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {380#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(<= main_~i~0 1)} assume true; {380#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {380#(<= main_~i~0 1)} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#false} ~i~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {378#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {378#false} is VALID [2018-11-14 16:52:05,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {378#false} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {378#false} ~i~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {378#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {378#false} is VALID [2018-11-14 16:52:05,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {378#false} assume !(~i~0 < 100000); {378#false} is VALID [2018-11-14 16:52:05,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {378#false} havoc ~x~0;~x~0 := 0; {378#false} is VALID [2018-11-14 16:52:05,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {378#false} assume true; {378#false} is VALID [2018-11-14 16:52:05,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {378#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {378#false} is VALID [2018-11-14 16:52:05,821 INFO L256 TraceCheckUtils]: 23: Hoare triple {378#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {378#false} is VALID [2018-11-14 16:52:05,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {378#false} ~cond := #in~cond; {378#false} is VALID [2018-11-14 16:52:05,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {378#false} assume ~cond == 0; {378#false} is VALID [2018-11-14 16:52:05,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {378#false} assume !false; {378#false} is VALID [2018-11-14 16:52:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:52:05,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:05,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:52:05,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:52:05,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:05,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:52:06,021 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-14 16:52:06,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:52:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:52:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:52:06,022 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-14 16:52:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,421 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 16:52:06,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:52:06,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:52:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-14 16:52:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-14 16:52:06,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2018-11-14 16:52:06,598 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-14 16:52:06,602 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:52:06,602 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 16:52:06,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:52:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 16:52:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 16:52:06,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:06,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 16:52:06,629 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:52:06,630 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:52:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,632 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-14 16:52:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 16:52:06,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:06,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:06,634 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:52:06,634 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:52:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,637 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-14 16:52:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 16:52:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:06,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:06,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:06,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:52:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-14 16:52:06,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-11-14 16:52:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:06,641 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-14 16:52:06,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:52:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 16:52:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:52:06,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:06,643 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:06,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:06,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash -197893902, now seen corresponding path program 2 times [2018-11-14 16:52:06,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:06,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:06,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:06,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {675#true} is VALID [2018-11-14 16:52:06,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {675#true} is VALID [2018-11-14 16:52:06,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #78#return; {675#true} is VALID [2018-11-14 16:52:06,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret2 := main(); {675#true} is VALID [2018-11-14 16:52:06,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {677#(= main_~i~0 0)} is VALID [2018-11-14 16:52:06,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {677#(= main_~i~0 0)} assume true; {677#(= main_~i~0 0)} is VALID [2018-11-14 16:52:06,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {677#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {678#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {678#(<= main_~i~0 1)} assume true; {678#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {679#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {679#(<= main_~i~0 2)} assume true; {679#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {679#(<= main_~i~0 2)} assume !(~i~0 < 100000); {676#false} is VALID [2018-11-14 16:52:06,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {676#false} ~i~0 := 0; {676#false} is VALID [2018-11-14 16:52:06,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {676#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {676#false} is VALID [2018-11-14 16:52:06,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {676#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {676#false} is VALID [2018-11-14 16:52:06,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {676#false} assume !(~i~0 < 100000); {676#false} is VALID [2018-11-14 16:52:06,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {676#false} ~i~0 := 0; {676#false} is VALID [2018-11-14 16:52:06,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {676#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {676#false} is VALID [2018-11-14 16:52:06,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {676#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {676#false} is VALID [2018-11-14 16:52:06,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {676#false} assume !(~i~0 < 100000); {676#false} is VALID [2018-11-14 16:52:06,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {676#false} havoc ~x~0;~x~0 := 0; {676#false} is VALID [2018-11-14 16:52:06,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {676#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {676#false} is VALID [2018-11-14 16:52:06,773 INFO L256 TraceCheckUtils]: 29: Hoare triple {676#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {676#false} is VALID [2018-11-14 16:52:06,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2018-11-14 16:52:06,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {676#false} assume ~cond == 0; {676#false} is VALID [2018-11-14 16:52:06,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {676#false} assume !false; {676#false} is VALID [2018-11-14 16:52:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:52:06,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:06,776 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-14 16:52:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:06,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:06,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:06,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:06,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {675#true} is VALID [2018-11-14 16:52:06,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {675#true} is VALID [2018-11-14 16:52:06,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #78#return; {675#true} is VALID [2018-11-14 16:52:06,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret2 := main(); {675#true} is VALID [2018-11-14 16:52:06,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {675#true} is VALID [2018-11-14 16:52:06,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {675#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {675#true} is VALID [2018-11-14 16:52:06,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {675#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {675#true} is VALID [2018-11-14 16:52:06,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {675#true} assume !(~i~0 < 100000); {675#true} is VALID [2018-11-14 16:52:06,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {675#true} ~i~0 := 0; {675#true} is VALID [2018-11-14 16:52:06,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {675#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {675#true} is VALID [2018-11-14 16:52:06,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {675#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {675#true} is VALID [2018-11-14 16:52:06,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {675#true} assume true; {675#true} is VALID [2018-11-14 16:52:06,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {675#true} assume !(~i~0 < 100000); {675#true} is VALID [2018-11-14 16:52:06,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {675#true} ~i~0 := 0; {740#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:06,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {740#(<= main_~i~0 0)} assume true; {740#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:06,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {740#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {678#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,991 INFO L273 TraceCheckUtils]: 22: Hoare triple {678#(<= main_~i~0 1)} assume true; {678#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {679#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {679#(<= main_~i~0 2)} assume true; {679#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {679#(<= main_~i~0 2)} assume !(~i~0 < 100000); {676#false} is VALID [2018-11-14 16:52:06,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {676#false} havoc ~x~0;~x~0 := 0; {676#false} is VALID [2018-11-14 16:52:06,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {676#false} assume true; {676#false} is VALID [2018-11-14 16:52:06,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {676#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {676#false} is VALID [2018-11-14 16:52:06,997 INFO L256 TraceCheckUtils]: 29: Hoare triple {676#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {676#false} is VALID [2018-11-14 16:52:06,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2018-11-14 16:52:06,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {676#false} assume ~cond == 0; {676#false} is VALID [2018-11-14 16:52:06,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {676#false} assume !false; {676#false} is VALID [2018-11-14 16:52:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:52:07,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:07,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:52:07,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 16:52:07,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:07,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:52:07,074 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-14 16:52:07,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:52:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:52:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:52:07,075 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-11-14 16:52:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,270 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-14 16:52:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:52:07,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 16:52:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 16:52:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 16:52:07,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-14 16:52:07,469 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-14 16:52:07,472 INFO L225 Difference]: With dead ends: 70 [2018-11-14 16:52:07,472 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:52:07,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-14 16:52:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:52:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 16:52:07,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:07,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 16:52:07,502 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:52:07,502 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:52:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,505 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 16:52:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 16:52:07,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:07,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:07,506 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:52:07,506 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:52:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,509 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 16:52:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 16:52:07,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:07,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:07,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:07,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:52:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-14 16:52:07,513 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 33 [2018-11-14 16:52:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:07,513 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-14 16:52:07,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:52:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 16:52:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:52:07,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:07,515 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:07,515 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:07,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash 745812620, now seen corresponding path program 3 times [2018-11-14 16:52:07,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:07,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:07,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:07,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {1028#true} call ULTIMATE.init(); {1028#true} is VALID [2018-11-14 16:52:07,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {1028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1028#true} is VALID [2018-11-14 16:52:07,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1028#true} {1028#true} #78#return; {1028#true} is VALID [2018-11-14 16:52:07,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {1028#true} call #t~ret2 := main(); {1028#true} is VALID [2018-11-14 16:52:07,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {1028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1030#(= main_~i~0 0)} is VALID [2018-11-14 16:52:07,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {1030#(= main_~i~0 0)} assume true; {1030#(= main_~i~0 0)} is VALID [2018-11-14 16:52:07,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {1030#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1031#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {1031#(<= main_~i~0 1)} assume true; {1031#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {1031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1032#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {1032#(<= main_~i~0 2)} assume true; {1032#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {1032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1033#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {1033#(<= main_~i~0 3)} assume true; {1033#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {1033#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1029#false} is VALID [2018-11-14 16:52:07,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {1029#false} ~i~0 := 0; {1029#false} is VALID [2018-11-14 16:52:07,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {1029#false} assume !(~i~0 < 100000); {1029#false} is VALID [2018-11-14 16:52:07,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {1029#false} ~i~0 := 0; {1029#false} is VALID [2018-11-14 16:52:07,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,660 INFO L273 TraceCheckUtils]: 25: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,661 INFO L273 TraceCheckUtils]: 29: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,661 INFO L273 TraceCheckUtils]: 30: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,661 INFO L273 TraceCheckUtils]: 31: Hoare triple {1029#false} assume !(~i~0 < 100000); {1029#false} is VALID [2018-11-14 16:52:07,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {1029#false} havoc ~x~0;~x~0 := 0; {1029#false} is VALID [2018-11-14 16:52:07,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {1029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1029#false} is VALID [2018-11-14 16:52:07,663 INFO L256 TraceCheckUtils]: 35: Hoare triple {1029#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1029#false} is VALID [2018-11-14 16:52:07,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {1029#false} ~cond := #in~cond; {1029#false} is VALID [2018-11-14 16:52:07,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {1029#false} assume ~cond == 0; {1029#false} is VALID [2018-11-14 16:52:07,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {1029#false} assume !false; {1029#false} is VALID [2018-11-14 16:52:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 16:52:07,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:07,667 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-14 16:52:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:07,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:52:07,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:07,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:07,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {1028#true} call ULTIMATE.init(); {1028#true} is VALID [2018-11-14 16:52:07,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {1028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1028#true} is VALID [2018-11-14 16:52:07,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1028#true} {1028#true} #78#return; {1028#true} is VALID [2018-11-14 16:52:07,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {1028#true} call #t~ret2 := main(); {1028#true} is VALID [2018-11-14 16:52:07,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {1028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1028#true} is VALID [2018-11-14 16:52:07,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {1028#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1028#true} is VALID [2018-11-14 16:52:07,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {1028#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1028#true} is VALID [2018-11-14 16:52:07,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {1028#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1028#true} is VALID [2018-11-14 16:52:07,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {1028#true} assume true; {1028#true} is VALID [2018-11-14 16:52:07,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {1028#true} assume !(~i~0 < 100000); {1028#true} is VALID [2018-11-14 16:52:07,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {1028#true} ~i~0 := 0; {1079#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:07,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~i~0 0)} assume true; {1079#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:07,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {1079#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1031#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {1031#(<= main_~i~0 1)} assume true; {1031#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {1031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1032#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {1032#(<= main_~i~0 2)} assume true; {1032#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {1032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1033#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {1033#(<= main_~i~0 3)} assume true; {1033#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1029#false} is VALID [2018-11-14 16:52:07,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {1029#false} ~i~0 := 0; {1029#false} is VALID [2018-11-14 16:52:07,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {1029#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1029#false} is VALID [2018-11-14 16:52:07,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {1029#false} assume !(~i~0 < 100000); {1029#false} is VALID [2018-11-14 16:52:07,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {1029#false} havoc ~x~0;~x~0 := 0; {1029#false} is VALID [2018-11-14 16:52:07,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {1029#false} assume true; {1029#false} is VALID [2018-11-14 16:52:07,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {1029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1029#false} is VALID [2018-11-14 16:52:07,896 INFO L256 TraceCheckUtils]: 35: Hoare triple {1029#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1029#false} is VALID [2018-11-14 16:52:07,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {1029#false} ~cond := #in~cond; {1029#false} is VALID [2018-11-14 16:52:07,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {1029#false} assume ~cond == 0; {1029#false} is VALID [2018-11-14 16:52:07,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {1029#false} assume !false; {1029#false} is VALID [2018-11-14 16:52:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 16:52:07,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:07,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:52:07,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-14 16:52:07,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:07,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:52:07,991 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-14 16:52:07,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:52:07,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:52:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:52:07,992 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2018-11-14 16:52:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,332 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-14 16:52:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:52:08,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-14 16:52:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 16:52:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 16:52:08,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-14 16:52:08,508 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-14 16:52:08,511 INFO L225 Difference]: With dead ends: 80 [2018-11-14 16:52:08,511 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:52:08,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-14 16:52:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:52:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 16:52:08,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:08,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 16:52:08,628 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:52:08,628 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:52:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,630 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:52:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:52:08,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:08,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:52:08,631 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:52:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,634 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:52:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:52:08,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:08,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:08,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:08,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:52:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-14 16:52:08,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2018-11-14 16:52:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:08,638 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-14 16:52:08,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:52:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:52:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:52:08,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:08,640 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:08,640 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:08,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash -952620890, now seen corresponding path program 4 times [2018-11-14 16:52:08,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:08,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:08,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:08,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2018-11-14 16:52:08,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {1436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1436#true} is VALID [2018-11-14 16:52:08,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2018-11-14 16:52:08,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #78#return; {1436#true} is VALID [2018-11-14 16:52:08,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret2 := main(); {1436#true} is VALID [2018-11-14 16:52:08,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {1436#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1438#(= main_~i~0 0)} is VALID [2018-11-14 16:52:08,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {1438#(= main_~i~0 0)} assume true; {1438#(= main_~i~0 0)} is VALID [2018-11-14 16:52:08,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {1438#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1439#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:08,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1439#(<= main_~i~0 1)} assume true; {1439#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:08,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {1439#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1440#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:08,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {1440#(<= main_~i~0 2)} assume true; {1440#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:08,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {1440#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1441#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:08,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {1441#(<= main_~i~0 3)} assume true; {1441#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:08,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {1441#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1442#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:08,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(<= main_~i~0 4)} assume true; {1442#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:08,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:08,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {1437#false} ~i~0 := 0; {1437#false} is VALID [2018-11-14 16:52:08,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {1437#false} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:08,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {1437#false} ~i~0 := 0; {1437#false} is VALID [2018-11-14 16:52:08,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:08,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#false} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:08,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#false} havoc ~x~0;~x~0 := 0; {1437#false} is VALID [2018-11-14 16:52:08,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:08,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {1437#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1437#false} is VALID [2018-11-14 16:52:08,844 INFO L256 TraceCheckUtils]: 41: Hoare triple {1437#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1437#false} is VALID [2018-11-14 16:52:08,844 INFO L273 TraceCheckUtils]: 42: Hoare triple {1437#false} ~cond := #in~cond; {1437#false} is VALID [2018-11-14 16:52:08,844 INFO L273 TraceCheckUtils]: 43: Hoare triple {1437#false} assume ~cond == 0; {1437#false} is VALID [2018-11-14 16:52:08,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2018-11-14 16:52:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 16:52:08,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:08,848 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-14 16:52:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:08,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:08,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:08,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:09,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2018-11-14 16:52:09,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {1436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1436#true} is VALID [2018-11-14 16:52:09,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2018-11-14 16:52:09,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #78#return; {1436#true} is VALID [2018-11-14 16:52:09,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret2 := main(); {1436#true} is VALID [2018-11-14 16:52:09,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {1436#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1461#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:09,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(<= main_~i~0 0)} assume true; {1461#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:09,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1439#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {1439#(<= main_~i~0 1)} assume true; {1439#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1439#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1440#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {1440#(<= main_~i~0 2)} assume true; {1440#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {1440#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1441#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {1441#(<= main_~i~0 3)} assume true; {1441#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {1441#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1442#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(<= main_~i~0 4)} assume true; {1442#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:09,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {1437#false} ~i~0 := 0; {1437#false} is VALID [2018-11-14 16:52:09,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {1437#false} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:09,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {1437#false} ~i~0 := 0; {1437#false} is VALID [2018-11-14 16:52:09,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {1437#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#false} assume !(~i~0 < 100000); {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#false} havoc ~x~0;~x~0 := 0; {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {1437#false} assume true; {1437#false} is VALID [2018-11-14 16:52:09,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {1437#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1437#false} is VALID [2018-11-14 16:52:09,274 INFO L256 TraceCheckUtils]: 41: Hoare triple {1437#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1437#false} is VALID [2018-11-14 16:52:09,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {1437#false} ~cond := #in~cond; {1437#false} is VALID [2018-11-14 16:52:09,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {1437#false} assume ~cond == 0; {1437#false} is VALID [2018-11-14 16:52:09,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2018-11-14 16:52:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 16:52:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:09,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:52:09,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:52:09,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:09,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:52:09,344 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-14 16:52:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:52:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:52:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:52:09,345 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 8 states. [2018-11-14 16:52:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,574 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-14 16:52:09,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:52:09,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:52:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 16:52:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 16:52:09,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2018-11-14 16:52:09,693 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-14 16:52:09,696 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:52:09,696 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:52:09,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:52:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:52:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-14 16:52:09,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:09,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-14 16:52:09,732 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 16:52:09,732 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 16:52:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,734 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 16:52:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 16:52:09,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:09,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:09,735 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 16:52:09,735 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 16:52:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,737 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 16:52:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 16:52:09,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:09,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:09,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:09,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:52:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-14 16:52:09,740 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 45 [2018-11-14 16:52:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:09,740 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-14 16:52:09,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:52:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 16:52:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:52:09,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:09,746 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:09,746 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:09,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1302422336, now seen corresponding path program 5 times [2018-11-14 16:52:09,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:09,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:09,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:09,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {1899#true} call ULTIMATE.init(); {1899#true} is VALID [2018-11-14 16:52:09,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {1899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1899#true} is VALID [2018-11-14 16:52:09,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:09,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1899#true} {1899#true} #78#return; {1899#true} is VALID [2018-11-14 16:52:09,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {1899#true} call #t~ret2 := main(); {1899#true} is VALID [2018-11-14 16:52:09,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1899#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1901#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {1901#(= main_~i~0 0)} assume true; {1901#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1902#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {1902#(<= main_~i~0 1)} assume true; {1902#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1903#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {1903#(<= main_~i~0 2)} assume true; {1903#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {1903#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1904#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {1904#(<= main_~i~0 3)} assume true; {1904#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {1904#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1905#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {1905#(<= main_~i~0 4)} assume true; {1905#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1906#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:09,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {1906#(<= main_~i~0 5)} assume true; {1906#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:09,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1900#false} is VALID [2018-11-14 16:52:09,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#false} ~i~0 := 0; {1900#false} is VALID [2018-11-14 16:52:09,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,939 INFO L273 TraceCheckUtils]: 29: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {1900#false} assume !(~i~0 < 100000); {1900#false} is VALID [2018-11-14 16:52:09,940 INFO L273 TraceCheckUtils]: 31: Hoare triple {1900#false} ~i~0 := 0; {1900#false} is VALID [2018-11-14 16:52:09,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,941 INFO L273 TraceCheckUtils]: 37: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,941 INFO L273 TraceCheckUtils]: 38: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,942 INFO L273 TraceCheckUtils]: 41: Hoare triple {1900#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1900#false} is VALID [2018-11-14 16:52:09,942 INFO L273 TraceCheckUtils]: 42: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {1900#false} assume !(~i~0 < 100000); {1900#false} is VALID [2018-11-14 16:52:09,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {1900#false} havoc ~x~0;~x~0 := 0; {1900#false} is VALID [2018-11-14 16:52:09,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:09,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {1900#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1900#false} is VALID [2018-11-14 16:52:09,944 INFO L256 TraceCheckUtils]: 47: Hoare triple {1900#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1900#false} is VALID [2018-11-14 16:52:09,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {1900#false} ~cond := #in~cond; {1900#false} is VALID [2018-11-14 16:52:09,944 INFO L273 TraceCheckUtils]: 49: Hoare triple {1900#false} assume ~cond == 0; {1900#false} is VALID [2018-11-14 16:52:09,944 INFO L273 TraceCheckUtils]: 50: Hoare triple {1900#false} assume !false; {1900#false} is VALID [2018-11-14 16:52:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:52:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:09,948 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-14 16:52:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:52:10,232 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:52:10,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:10,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:10,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {1899#true} call ULTIMATE.init(); {1899#true} is VALID [2018-11-14 16:52:10,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {1899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1899#true} is VALID [2018-11-14 16:52:10,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1899#true} {1899#true} #78#return; {1899#true} is VALID [2018-11-14 16:52:10,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {1899#true} call #t~ret2 := main(); {1899#true} is VALID [2018-11-14 16:52:10,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1899#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1899#true} is VALID [2018-11-14 16:52:10,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {1899#true} assume !(~i~0 < 100000); {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {1899#true} ~i~0 := 0; {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#true} is VALID [2018-11-14 16:52:10,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-14 16:52:10,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#true} assume !(~i~0 < 100000); {1899#true} is VALID [2018-11-14 16:52:10,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#true} ~i~0 := 0; {2003#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,429 INFO L273 TraceCheckUtils]: 32: Hoare triple {2003#(<= main_~i~0 0)} assume true; {2003#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {2003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1902#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {1902#(<= main_~i~0 1)} assume true; {1902#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {1902#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1903#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {1903#(<= main_~i~0 2)} assume true; {1903#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,435 INFO L273 TraceCheckUtils]: 37: Hoare triple {1903#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1904#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:10,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {1904#(<= main_~i~0 3)} assume true; {1904#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {1904#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1905#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 40: Hoare triple {1905#(<= main_~i~0 4)} assume true; {1905#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:10,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {1905#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1906#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {1906#(<= main_~i~0 5)} assume true; {1906#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {1906#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1900#false} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {1900#false} havoc ~x~0;~x~0 := 0; {1900#false} is VALID [2018-11-14 16:52:10,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {1900#false} assume true; {1900#false} is VALID [2018-11-14 16:52:10,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {1900#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1900#false} is VALID [2018-11-14 16:52:10,442 INFO L256 TraceCheckUtils]: 47: Hoare triple {1900#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {1900#false} is VALID [2018-11-14 16:52:10,443 INFO L273 TraceCheckUtils]: 48: Hoare triple {1900#false} ~cond := #in~cond; {1900#false} is VALID [2018-11-14 16:52:10,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {1900#false} assume ~cond == 0; {1900#false} is VALID [2018-11-14 16:52:10,443 INFO L273 TraceCheckUtils]: 50: Hoare triple {1900#false} assume !false; {1900#false} is VALID [2018-11-14 16:52:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:52:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:52:10,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-14 16:52:10,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:10,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:52:10,543 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-14 16:52:10,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:52:10,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:52:10,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:52:10,544 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 9 states. [2018-11-14 16:52:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,886 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-11-14 16:52:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:52:10,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-14 16:52:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-14 16:52:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-14 16:52:10,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2018-11-14 16:52:11,073 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-14 16:52:11,076 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:52:11,076 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:52:11,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 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-14 16:52:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:52:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 16:52:11,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:11,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 16:52:11,114 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:52:11,114 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:52:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:11,118 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-14 16:52:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 16:52:11,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:11,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:11,119 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:52:11,119 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:52:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:11,121 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-14 16:52:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 16:52:11,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:11,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:11,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:11,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 16:52:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-14 16:52:11,125 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 51 [2018-11-14 16:52:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:11,125 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-14 16:52:11,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:52:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 16:52:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:52:11,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:11,126 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:11,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:11,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash -560397734, now seen corresponding path program 6 times [2018-11-14 16:52:11,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:11,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:11,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:11,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {2417#true} call ULTIMATE.init(); {2417#true} is VALID [2018-11-14 16:52:11,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {2417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2417#true} is VALID [2018-11-14 16:52:11,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:11,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2417#true} {2417#true} #78#return; {2417#true} is VALID [2018-11-14 16:52:11,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {2417#true} call #t~ret2 := main(); {2417#true} is VALID [2018-11-14 16:52:11,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {2417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2419#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {2419#(= main_~i~0 0)} assume true; {2419#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {2419#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2420#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {2420#(<= main_~i~0 1)} assume true; {2420#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {2420#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2421#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {2421#(<= main_~i~0 2)} assume true; {2421#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {2421#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2422#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {2422#(<= main_~i~0 3)} assume true; {2422#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {2422#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2423#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {2423#(<= main_~i~0 4)} assume true; {2423#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {2423#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2424#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {2424#(<= main_~i~0 5)} assume true; {2424#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {2424#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2425#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {2425#(<= main_~i~0 6)} assume true; {2425#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {2425#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2418#false} is VALID [2018-11-14 16:52:11,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {2418#false} ~i~0 := 0; {2418#false} is VALID [2018-11-14 16:52:11,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,373 INFO L273 TraceCheckUtils]: 30: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,373 INFO L273 TraceCheckUtils]: 31: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {2418#false} assume !(~i~0 < 100000); {2418#false} is VALID [2018-11-14 16:52:11,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {2418#false} ~i~0 := 0; {2418#false} is VALID [2018-11-14 16:52:11,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,377 INFO L273 TraceCheckUtils]: 45: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {2418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2418#false} is VALID [2018-11-14 16:52:11,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {2418#false} assume !(~i~0 < 100000); {2418#false} is VALID [2018-11-14 16:52:11,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {2418#false} havoc ~x~0;~x~0 := 0; {2418#false} is VALID [2018-11-14 16:52:11,379 INFO L273 TraceCheckUtils]: 51: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:11,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {2418#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2418#false} is VALID [2018-11-14 16:52:11,379 INFO L256 TraceCheckUtils]: 53: Hoare triple {2418#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {2418#false} is VALID [2018-11-14 16:52:11,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {2418#false} ~cond := #in~cond; {2418#false} is VALID [2018-11-14 16:52:11,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {2418#false} assume ~cond == 0; {2418#false} is VALID [2018-11-14 16:52:11,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {2418#false} assume !false; {2418#false} is VALID [2018-11-14 16:52:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 16:52:11,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:11,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 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-14 16:52:11,417 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:52:11,599 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:52:11,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:12,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {2417#true} call ULTIMATE.init(); {2417#true} is VALID [2018-11-14 16:52:12,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {2417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2417#true} is VALID [2018-11-14 16:52:12,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2417#true} {2417#true} #78#return; {2417#true} is VALID [2018-11-14 16:52:12,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {2417#true} call #t~ret2 := main(); {2417#true} is VALID [2018-11-14 16:52:12,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {2417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2417#true} is VALID [2018-11-14 16:52:12,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2480#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:12,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {2480#(<= main_~i~0 100000)} assume true; {2480#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:12,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {2480#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {2417#true} is VALID [2018-11-14 16:52:12,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {2417#true} ~i~0 := 0; {2417#true} is VALID [2018-11-14 16:52:12,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,129 INFO L273 TraceCheckUtils]: 30: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2417#true} is VALID [2018-11-14 16:52:12,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-14 16:52:12,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {2417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2480#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:12,148 INFO L273 TraceCheckUtils]: 33: Hoare triple {2480#(<= main_~i~0 100000)} assume true; {2480#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:12,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {2480#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {2417#true} is VALID [2018-11-14 16:52:12,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {2417#true} ~i~0 := 0; {2535#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {2535#(<= main_~i~0 0)} assume true; {2535#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {2535#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2420#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {2420#(<= main_~i~0 1)} assume true; {2420#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {2420#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2421#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {2421#(<= main_~i~0 2)} assume true; {2421#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {2421#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2422#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {2422#(<= main_~i~0 3)} assume true; {2422#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {2422#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2423#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {2423#(<= main_~i~0 4)} assume true; {2423#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {2423#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2424#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {2424#(<= main_~i~0 5)} assume true; {2424#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {2424#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2425#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {2425#(<= main_~i~0 6)} assume true; {2425#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {2425#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2418#false} is VALID [2018-11-14 16:52:12,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {2418#false} havoc ~x~0;~x~0 := 0; {2418#false} is VALID [2018-11-14 16:52:12,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {2418#false} assume true; {2418#false} is VALID [2018-11-14 16:52:12,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {2418#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2418#false} is VALID [2018-11-14 16:52:12,157 INFO L256 TraceCheckUtils]: 53: Hoare triple {2418#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {2418#false} is VALID [2018-11-14 16:52:12,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {2418#false} ~cond := #in~cond; {2418#false} is VALID [2018-11-14 16:52:12,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {2418#false} assume ~cond == 0; {2418#false} is VALID [2018-11-14 16:52:12,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {2418#false} assume !false; {2418#false} is VALID [2018-11-14 16:52:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:52:12,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:12,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-14 16:52:12,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-14 16:52:12,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:12,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:52:12,423 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-14 16:52:12,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:52:12,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:52:12,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:12,424 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 11 states. [2018-11-14 16:52:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,849 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-14 16:52:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:52:12,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-14 16:52:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2018-11-14 16:52:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2018-11-14 16:52:12,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2018-11-14 16:52:12,937 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-14 16:52:12,939 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:52:12,939 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 16:52:12,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 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-14 16:52:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 16:52:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 16:52:13,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:13,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 16:52:13,101 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 16:52:13,101 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 16:52:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,103 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 16:52:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:52:13,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:13,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:13,104 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 16:52:13,104 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 16:52:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,106 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 16:52:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:52:13,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:13,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:13,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:13,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:52:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-14 16:52:13,109 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 57 [2018-11-14 16:52:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-14 16:52:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:52:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:52:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 16:52:13,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:13,110 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:13,111 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:13,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 282076660, now seen corresponding path program 7 times [2018-11-14 16:52:13,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:13,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:13,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2018-11-14 16:52:13,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2991#true} is VALID [2018-11-14 16:52:13,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2018-11-14 16:52:13,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #78#return; {2991#true} is VALID [2018-11-14 16:52:13,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret2 := main(); {2991#true} is VALID [2018-11-14 16:52:13,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {2991#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2993#(= main_~i~0 0)} is VALID [2018-11-14 16:52:13,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {2993#(= main_~i~0 0)} assume true; {2993#(= main_~i~0 0)} is VALID [2018-11-14 16:52:13,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {2993#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2994#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:13,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {2994#(<= main_~i~0 1)} assume true; {2994#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:13,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {2994#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2995#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:13,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {2995#(<= main_~i~0 2)} assume true; {2995#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:13,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {2995#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2996#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:13,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {2996#(<= main_~i~0 3)} assume true; {2996#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:13,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {2996#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2997#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:13,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {2997#(<= main_~i~0 4)} assume true; {2997#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:13,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2997#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2998#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:13,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {2998#(<= main_~i~0 5)} assume true; {2998#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:13,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {2998#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2999#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:13,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {2999#(<= main_~i~0 6)} assume true; {2999#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:13,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3000#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:13,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {3000#(<= main_~i~0 7)} assume true; {3000#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:13,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {3000#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {2992#false} ~i~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,367 INFO L273 TraceCheckUtils]: 37: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {2992#false} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {2992#false} ~i~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 43: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,368 INFO L273 TraceCheckUtils]: 45: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 46: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 47: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 48: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 49: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 50: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 55: Hoare triple {2992#false} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 56: Hoare triple {2992#false} havoc ~x~0;~x~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 57: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 58: Hoare triple {2992#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L256 TraceCheckUtils]: 59: Hoare triple {2992#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {2992#false} is VALID [2018-11-14 16:52:13,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2018-11-14 16:52:13,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {2992#false} assume ~cond == 0; {2992#false} is VALID [2018-11-14 16:52:13,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2018-11-14 16:52:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-14 16:52:13,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:13,373 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-14 16:52:13,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:13,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:13,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2018-11-14 16:52:13,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2991#true} is VALID [2018-11-14 16:52:13,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2018-11-14 16:52:13,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #78#return; {2991#true} is VALID [2018-11-14 16:52:13,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret2 := main(); {2991#true} is VALID [2018-11-14 16:52:13,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {2991#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3019#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:13,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {3019#(<= main_~i~0 0)} assume true; {3019#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:13,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {3019#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2994#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:13,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {2994#(<= main_~i~0 1)} assume true; {2994#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:13,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {2994#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2995#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:13,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {2995#(<= main_~i~0 2)} assume true; {2995#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:13,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {2995#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2996#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:13,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {2996#(<= main_~i~0 3)} assume true; {2996#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:13,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {2996#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2997#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:13,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {2997#(<= main_~i~0 4)} assume true; {2997#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:13,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {2997#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2998#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:13,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {2998#(<= main_~i~0 5)} assume true; {2998#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:13,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {2998#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2999#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:13,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {2999#(<= main_~i~0 6)} assume true; {2999#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:13,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3000#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:13,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {3000#(<= main_~i~0 7)} assume true; {3000#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:13,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {3000#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {2992#false} ~i~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,656 INFO L273 TraceCheckUtils]: 38: Hoare triple {2992#false} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {2992#false} ~i~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,657 INFO L273 TraceCheckUtils]: 43: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,657 INFO L273 TraceCheckUtils]: 44: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,658 INFO L273 TraceCheckUtils]: 50: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 53: Hoare triple {2992#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 54: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 55: Hoare triple {2992#false} assume !(~i~0 < 100000); {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 56: Hoare triple {2992#false} havoc ~x~0;~x~0 := 0; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {2992#false} assume true; {2992#false} is VALID [2018-11-14 16:52:13,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {2992#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2992#false} is VALID [2018-11-14 16:52:13,660 INFO L256 TraceCheckUtils]: 59: Hoare triple {2992#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {2992#false} is VALID [2018-11-14 16:52:13,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2018-11-14 16:52:13,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {2992#false} assume ~cond == 0; {2992#false} is VALID [2018-11-14 16:52:13,660 INFO L273 TraceCheckUtils]: 62: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2018-11-14 16:52:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-14 16:52:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:52:13,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-14 16:52:13,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:13,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:52:13,784 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-14 16:52:13,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:52:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:52:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:13,785 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 11 states. [2018-11-14 16:52:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:14,305 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-14 16:52:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:52:14,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-14 16:52:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2018-11-14 16:52:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2018-11-14 16:52:14,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2018-11-14 16:52:14,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:14,481 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:52:14,481 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:52:14,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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-14 16:52:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:52:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-14 16:52:14,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:14,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-14 16:52:14,522 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 16:52:14,522 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 16:52:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:14,526 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 16:52:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:52:14,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:14,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:14,527 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 16:52:14,527 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 16:52:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:14,529 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 16:52:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:52:14,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:14,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:14,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:14,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:52:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 16:52:14,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 63 [2018-11-14 16:52:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:14,533 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 16:52:14,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:52:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:52:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 16:52:14,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:14,534 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:14,535 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:14,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1421864462, now seen corresponding path program 8 times [2018-11-14 16:52:14,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:14,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:14,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:14,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:14,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:14,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {3619#true} call ULTIMATE.init(); {3619#true} is VALID [2018-11-14 16:52:14,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {3619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3619#true} is VALID [2018-11-14 16:52:14,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-14 16:52:14,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3619#true} {3619#true} #78#return; {3619#true} is VALID [2018-11-14 16:52:14,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {3619#true} call #t~ret2 := main(); {3619#true} is VALID [2018-11-14 16:52:14,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {3619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3621#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {3621#(= main_~i~0 0)} assume true; {3621#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {3621#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3622#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {3622#(<= main_~i~0 1)} assume true; {3622#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {3622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3623#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {3623#(<= main_~i~0 2)} assume true; {3623#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {3623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3624#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {3624#(<= main_~i~0 3)} assume true; {3624#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {3624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3625#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {3625#(<= main_~i~0 4)} assume true; {3625#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {3625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3626#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {3626#(<= main_~i~0 5)} assume true; {3626#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {3626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3627#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:14,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {3627#(<= main_~i~0 6)} assume true; {3627#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:14,863 INFO L273 TraceCheckUtils]: 19: Hoare triple {3627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3628#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:14,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {3628#(<= main_~i~0 7)} assume true; {3628#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:14,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {3628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3629#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:14,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {3629#(<= main_~i~0 8)} assume true; {3629#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:14,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {3629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:14,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {3620#false} ~i~0 := 0; {3620#false} is VALID [2018-11-14 16:52:14,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,868 INFO L273 TraceCheckUtils]: 31: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 32: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 39: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 40: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {3620#false} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {3620#false} ~i~0 := 0; {3620#false} is VALID [2018-11-14 16:52:14,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 47: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 48: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,871 INFO L273 TraceCheckUtils]: 50: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 51: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 52: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 54: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 55: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 58: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {3620#false} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 62: Hoare triple {3620#false} havoc ~x~0;~x~0 := 0; {3620#false} is VALID [2018-11-14 16:52:14,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:14,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {3620#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3620#false} is VALID [2018-11-14 16:52:14,874 INFO L256 TraceCheckUtils]: 65: Hoare triple {3620#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {3620#false} is VALID [2018-11-14 16:52:14,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {3620#false} ~cond := #in~cond; {3620#false} is VALID [2018-11-14 16:52:14,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {3620#false} assume ~cond == 0; {3620#false} is VALID [2018-11-14 16:52:14,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2018-11-14 16:52:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-14 16:52:14,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:14,878 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-14 16:52:14,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:14,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:14,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:14,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:15,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {3619#true} call ULTIMATE.init(); {3619#true} is VALID [2018-11-14 16:52:15,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {3619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3619#true} is VALID [2018-11-14 16:52:15,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-14 16:52:15,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3619#true} {3619#true} #78#return; {3619#true} is VALID [2018-11-14 16:52:15,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {3619#true} call #t~ret2 := main(); {3619#true} is VALID [2018-11-14 16:52:15,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {3619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3648#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:15,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {3648#(<= main_~i~0 0)} assume true; {3648#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:15,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {3648#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3622#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:15,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {3622#(<= main_~i~0 1)} assume true; {3622#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:15,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {3622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3623#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:15,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {3623#(<= main_~i~0 2)} assume true; {3623#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:15,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {3623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3624#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:15,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {3624#(<= main_~i~0 3)} assume true; {3624#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:15,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {3624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3625#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:15,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {3625#(<= main_~i~0 4)} assume true; {3625#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:15,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {3625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3626#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:15,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {3626#(<= main_~i~0 5)} assume true; {3626#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:15,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {3626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3627#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:15,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {3627#(<= main_~i~0 6)} assume true; {3627#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:15,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {3627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3628#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:15,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {3628#(<= main_~i~0 7)} assume true; {3628#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:15,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {3628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3629#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:15,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {3629#(<= main_~i~0 8)} assume true; {3629#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:15,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {3629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:15,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {3620#false} ~i~0 := 0; {3620#false} is VALID [2018-11-14 16:52:15,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {3620#false} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {3620#false} ~i~0 := 0; {3620#false} is VALID [2018-11-14 16:52:15,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,281 INFO L273 TraceCheckUtils]: 51: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 56: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 57: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 59: Hoare triple {3620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3620#false} is VALID [2018-11-14 16:52:15,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {3620#false} assume !(~i~0 < 100000); {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L273 TraceCheckUtils]: 62: Hoare triple {3620#false} havoc ~x~0;~x~0 := 0; {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L273 TraceCheckUtils]: 63: Hoare triple {3620#false} assume true; {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L273 TraceCheckUtils]: 64: Hoare triple {3620#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L256 TraceCheckUtils]: 65: Hoare triple {3620#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {3620#false} is VALID [2018-11-14 16:52:15,283 INFO L273 TraceCheckUtils]: 66: Hoare triple {3620#false} ~cond := #in~cond; {3620#false} is VALID [2018-11-14 16:52:15,284 INFO L273 TraceCheckUtils]: 67: Hoare triple {3620#false} assume ~cond == 0; {3620#false} is VALID [2018-11-14 16:52:15,284 INFO L273 TraceCheckUtils]: 68: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2018-11-14 16:52:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-14 16:52:15,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:15,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:52:15,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-14 16:52:15,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:15,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:52:15,425 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-14 16:52:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:52:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:52:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:52:15,426 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 12 states. [2018-11-14 16:52:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:15,813 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-14 16:52:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:52:15,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-14 16:52:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-14 16:52:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-14 16:52:15,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2018-11-14 16:52:15,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:15,971 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:52:15,971 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:52:15,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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-14 16:52:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:52:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 16:52:16,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:16,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 16:52:16,005 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:52:16,005 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:52:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:16,006 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 16:52:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:52:16,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:16,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:16,007 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:52:16,007 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:52:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:16,009 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 16:52:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:52:16,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:16,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:16,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:16,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:52:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-14 16:52:16,012 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 69 [2018-11-14 16:52:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:16,012 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-14 16:52:16,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:52:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:52:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 16:52:16,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:16,014 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:16,014 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:16,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -693536088, now seen corresponding path program 9 times [2018-11-14 16:52:16,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:16,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:16,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {4302#true} call ULTIMATE.init(); {4302#true} is VALID [2018-11-14 16:52:16,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {4302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4302#true} is VALID [2018-11-14 16:52:16,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:16,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4302#true} {4302#true} #78#return; {4302#true} is VALID [2018-11-14 16:52:16,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {4302#true} call #t~ret2 := main(); {4302#true} is VALID [2018-11-14 16:52:16,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {4302#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4304#(= main_~i~0 0)} is VALID [2018-11-14 16:52:16,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {4304#(= main_~i~0 0)} assume true; {4304#(= main_~i~0 0)} is VALID [2018-11-14 16:52:16,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {4304#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4305#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:16,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {4305#(<= main_~i~0 1)} assume true; {4305#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:16,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {4305#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4306#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:16,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {4306#(<= main_~i~0 2)} assume true; {4306#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:16,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {4306#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4307#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:16,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {4307#(<= main_~i~0 3)} assume true; {4307#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:16,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {4307#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4308#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:16,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {4308#(<= main_~i~0 4)} assume true; {4308#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:16,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {4308#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4309#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:16,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {4309#(<= main_~i~0 5)} assume true; {4309#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:16,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {4309#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4310#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:16,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {4310#(<= main_~i~0 6)} assume true; {4310#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:16,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {4310#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4311#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:16,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {4311#(<= main_~i~0 7)} assume true; {4311#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:16,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {4311#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4312#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:16,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {4312#(<= main_~i~0 8)} assume true; {4312#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:16,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {4312#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4313#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:16,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {4313#(<= main_~i~0 9)} assume true; {4313#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:16,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {4313#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4303#false} is VALID [2018-11-14 16:52:16,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {4303#false} ~i~0 := 0; {4303#false} is VALID [2018-11-14 16:52:16,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {4303#false} assume !(~i~0 < 100000); {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {4303#false} ~i~0 := 0; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {4303#false} assume !(~i~0 < 100000); {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {4303#false} havoc ~x~0;~x~0 := 0; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:16,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {4303#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4303#false} is VALID [2018-11-14 16:52:16,276 INFO L256 TraceCheckUtils]: 71: Hoare triple {4303#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {4303#false} is VALID [2018-11-14 16:52:16,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {4303#false} ~cond := #in~cond; {4303#false} is VALID [2018-11-14 16:52:16,276 INFO L273 TraceCheckUtils]: 73: Hoare triple {4303#false} assume ~cond == 0; {4303#false} is VALID [2018-11-14 16:52:16,276 INFO L273 TraceCheckUtils]: 74: Hoare triple {4303#false} assume !false; {4303#false} is VALID [2018-11-14 16:52:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-14 16:52:16,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:16,279 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-14 16:52:16,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:17,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:52:17,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:17,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:17,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {4302#true} call ULTIMATE.init(); {4302#true} is VALID [2018-11-14 16:52:17,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {4302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4302#true} is VALID [2018-11-14 16:52:17,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4302#true} {4302#true} #78#return; {4302#true} is VALID [2018-11-14 16:52:17,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {4302#true} call #t~ret2 := main(); {4302#true} is VALID [2018-11-14 16:52:17,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {4302#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4302#true} is VALID [2018-11-14 16:52:17,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {4302#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4302#true} is VALID [2018-11-14 16:52:17,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {4302#true} assume true; {4302#true} is VALID [2018-11-14 16:52:17,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {4302#true} assume !(~i~0 < 100000); {4302#true} is VALID [2018-11-14 16:52:17,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {4302#true} ~i~0 := 0; {4395#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {4395#(<= main_~i~0 0)} assume true; {4395#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {4395#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4305#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {4305#(<= main_~i~0 1)} assume true; {4305#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {4305#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4306#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {4306#(<= main_~i~0 2)} assume true; {4306#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {4306#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4307#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {4307#(<= main_~i~0 3)} assume true; {4307#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {4307#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4308#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {4308#(<= main_~i~0 4)} assume true; {4308#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {4308#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4309#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {4309#(<= main_~i~0 5)} assume true; {4309#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {4309#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4310#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {4310#(<= main_~i~0 6)} assume true; {4310#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,483 INFO L273 TraceCheckUtils]: 40: Hoare triple {4310#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4311#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:17,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {4311#(<= main_~i~0 7)} assume true; {4311#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:17,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {4311#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4312#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:17,485 INFO L273 TraceCheckUtils]: 43: Hoare triple {4312#(<= main_~i~0 8)} assume true; {4312#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:17,486 INFO L273 TraceCheckUtils]: 44: Hoare triple {4312#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4313#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:17,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {4313#(<= main_~i~0 9)} assume true; {4313#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:17,487 INFO L273 TraceCheckUtils]: 46: Hoare triple {4313#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4303#false} is VALID [2018-11-14 16:52:17,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {4303#false} ~i~0 := 0; {4303#false} is VALID [2018-11-14 16:52:17,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,488 INFO L273 TraceCheckUtils]: 51: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,488 INFO L273 TraceCheckUtils]: 52: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,490 INFO L273 TraceCheckUtils]: 60: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,490 INFO L273 TraceCheckUtils]: 61: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,491 INFO L273 TraceCheckUtils]: 64: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {4303#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4303#false} is VALID [2018-11-14 16:52:17,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {4303#false} assume !(~i~0 < 100000); {4303#false} is VALID [2018-11-14 16:52:17,491 INFO L273 TraceCheckUtils]: 68: Hoare triple {4303#false} havoc ~x~0;~x~0 := 0; {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L273 TraceCheckUtils]: 69: Hoare triple {4303#false} assume true; {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L273 TraceCheckUtils]: 70: Hoare triple {4303#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L256 TraceCheckUtils]: 71: Hoare triple {4303#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L273 TraceCheckUtils]: 72: Hoare triple {4303#false} ~cond := #in~cond; {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L273 TraceCheckUtils]: 73: Hoare triple {4303#false} assume ~cond == 0; {4303#false} is VALID [2018-11-14 16:52:17,492 INFO L273 TraceCheckUtils]: 74: Hoare triple {4303#false} assume !false; {4303#false} is VALID [2018-11-14 16:52:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-14 16:52:17,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:17,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 16:52:17,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-11-14 16:52:17,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:17,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:52:17,577 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-14 16:52:17,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:52:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:52:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:52:17,579 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 13 states. [2018-11-14 16:52:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,026 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 16:52:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:52:18,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-11-14 16:52:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:52:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-14 16:52:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:52:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-14 16:52:18,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-14 16:52:18,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:18,193 INFO L225 Difference]: With dead ends: 140 [2018-11-14 16:52:18,194 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 16:52:18,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:52:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 16:52:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-14 16:52:18,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:18,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-14 16:52:18,823 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 16:52:18,823 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 16:52:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,825 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-14 16:52:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 16:52:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,825 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 16:52:18,825 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 16:52:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,827 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-14 16:52:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 16:52:18,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:18,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 16:52:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-14 16:52:18,830 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 75 [2018-11-14 16:52:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:18,830 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-14 16:52:18,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:52:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 16:52:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 16:52:18,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:18,831 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:18,831 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:18,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -527045694, now seen corresponding path program 10 times [2018-11-14 16:52:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:19,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2018-11-14 16:52:19,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {5040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5040#true} is VALID [2018-11-14 16:52:19,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2018-11-14 16:52:19,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #78#return; {5040#true} is VALID [2018-11-14 16:52:19,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret2 := main(); {5040#true} is VALID [2018-11-14 16:52:19,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {5040#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5042#(= main_~i~0 0)} is VALID [2018-11-14 16:52:19,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {5042#(= main_~i~0 0)} assume true; {5042#(= main_~i~0 0)} is VALID [2018-11-14 16:52:19,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {5042#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5043#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {5043#(<= main_~i~0 1)} assume true; {5043#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {5043#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5044#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {5044#(<= main_~i~0 2)} assume true; {5044#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {5044#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5045#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {5045#(<= main_~i~0 3)} assume true; {5045#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {5045#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5046#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {5046#(<= main_~i~0 4)} assume true; {5046#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {5046#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5047#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {5047#(<= main_~i~0 5)} assume true; {5047#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {5047#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5048#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {5048#(<= main_~i~0 6)} assume true; {5048#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {5048#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5049#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {5049#(<= main_~i~0 7)} assume true; {5049#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {5049#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5050#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {5050#(<= main_~i~0 8)} assume true; {5050#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {5050#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5051#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {5051#(<= main_~i~0 9)} assume true; {5051#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {5051#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5052#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {5052#(<= main_~i~0 10)} assume true; {5052#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {5052#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,139 INFO L273 TraceCheckUtils]: 44: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 49: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {5041#false} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 54: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 62: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,142 INFO L273 TraceCheckUtils]: 63: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 64: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 65: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 66: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 67: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 69: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 70: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 71: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 72: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 73: Hoare triple {5041#false} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 74: Hoare triple {5041#false} havoc ~x~0;~x~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 75: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 76: Hoare triple {5041#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5041#false} is VALID [2018-11-14 16:52:19,145 INFO L256 TraceCheckUtils]: 77: Hoare triple {5041#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {5041#false} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 78: Hoare triple {5041#false} ~cond := #in~cond; {5041#false} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 79: Hoare triple {5041#false} assume ~cond == 0; {5041#false} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 80: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2018-11-14 16:52:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-14 16:52:19,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:19,153 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-14 16:52:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:19,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:19,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:19,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:19,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2018-11-14 16:52:19,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {5040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5040#true} is VALID [2018-11-14 16:52:19,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2018-11-14 16:52:19,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #78#return; {5040#true} is VALID [2018-11-14 16:52:19,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret2 := main(); {5040#true} is VALID [2018-11-14 16:52:19,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {5040#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5071#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {5071#(<= main_~i~0 0)} assume true; {5071#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {5071#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5043#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {5043#(<= main_~i~0 1)} assume true; {5043#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {5043#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5044#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {5044#(<= main_~i~0 2)} assume true; {5044#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {5044#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5045#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {5045#(<= main_~i~0 3)} assume true; {5045#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {5045#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5046#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {5046#(<= main_~i~0 4)} assume true; {5046#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {5046#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5047#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {5047#(<= main_~i~0 5)} assume true; {5047#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {5047#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5048#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {5048#(<= main_~i~0 6)} assume true; {5048#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {5048#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5049#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {5049#(<= main_~i~0 7)} assume true; {5049#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {5049#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5050#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {5050#(<= main_~i~0 8)} assume true; {5050#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {5050#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5051#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {5051#(<= main_~i~0 9)} assume true; {5051#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {5051#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5052#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {5052#(<= main_~i~0 10)} assume true; {5052#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {5052#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,399 INFO L273 TraceCheckUtils]: 33: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,399 INFO L273 TraceCheckUtils]: 34: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,401 INFO L273 TraceCheckUtils]: 43: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,402 INFO L273 TraceCheckUtils]: 45: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,402 INFO L273 TraceCheckUtils]: 47: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,402 INFO L273 TraceCheckUtils]: 48: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,403 INFO L273 TraceCheckUtils]: 49: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,403 INFO L273 TraceCheckUtils]: 50: Hoare triple {5041#false} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,403 INFO L273 TraceCheckUtils]: 51: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,403 INFO L273 TraceCheckUtils]: 52: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,403 INFO L273 TraceCheckUtils]: 53: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 54: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 55: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 56: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 57: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 58: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,404 INFO L273 TraceCheckUtils]: 60: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 61: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 62: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 63: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 64: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 65: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,405 INFO L273 TraceCheckUtils]: 66: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 67: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 68: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 69: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 70: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 71: Hoare triple {5041#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 72: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,406 INFO L273 TraceCheckUtils]: 73: Hoare triple {5041#false} assume !(~i~0 < 100000); {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L273 TraceCheckUtils]: 74: Hoare triple {5041#false} havoc ~x~0;~x~0 := 0; {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L273 TraceCheckUtils]: 75: Hoare triple {5041#false} assume true; {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L273 TraceCheckUtils]: 76: Hoare triple {5041#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L256 TraceCheckUtils]: 77: Hoare triple {5041#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {5041#false} ~cond := #in~cond; {5041#false} is VALID [2018-11-14 16:52:19,407 INFO L273 TraceCheckUtils]: 79: Hoare triple {5041#false} assume ~cond == 0; {5041#false} is VALID [2018-11-14 16:52:19,408 INFO L273 TraceCheckUtils]: 80: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2018-11-14 16:52:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-14 16:52:19,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:52:19,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-14 16:52:19,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:19,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:52:19,480 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-14 16:52:19,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:52:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:52:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:52:19,481 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 14 states. [2018-11-14 16:52:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:19,988 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-14 16:52:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:52:19,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-14 16:52:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:52:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2018-11-14 16:52:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:52:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2018-11-14 16:52:19,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2018-11-14 16:52:20,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:20,099 INFO L225 Difference]: With dead ends: 150 [2018-11-14 16:52:20,099 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:52:20,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 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-14 16:52:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:52:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 16:52:20,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:20,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 16:52:20,148 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 16:52:20,148 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 16:52:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:20,150 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-14 16:52:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:52:20,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:20,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:20,151 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 16:52:20,151 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 16:52:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:20,153 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-14 16:52:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:52:20,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:20,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:20,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:20,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:52:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-14 16:52:20,156 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 81 [2018-11-14 16:52:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:20,156 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-14 16:52:20,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:52:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:52:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 16:52:20,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:20,157 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:20,158 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:20,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1135189668, now seen corresponding path program 11 times [2018-11-14 16:52:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:20,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:20,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {5833#true} call ULTIMATE.init(); {5833#true} is VALID [2018-11-14 16:52:20,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {5833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5833#true} is VALID [2018-11-14 16:52:20,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:20,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5833#true} {5833#true} #78#return; {5833#true} is VALID [2018-11-14 16:52:20,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {5833#true} call #t~ret2 := main(); {5833#true} is VALID [2018-11-14 16:52:20,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {5833#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5835#(= main_~i~0 0)} is VALID [2018-11-14 16:52:20,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {5835#(= main_~i~0 0)} assume true; {5835#(= main_~i~0 0)} is VALID [2018-11-14 16:52:20,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {5835#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5836#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {5836#(<= main_~i~0 1)} assume true; {5836#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {5836#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5837#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {5837#(<= main_~i~0 2)} assume true; {5837#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {5837#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5838#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {5838#(<= main_~i~0 3)} assume true; {5838#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {5838#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5839#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {5839#(<= main_~i~0 4)} assume true; {5839#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {5839#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5840#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {5840#(<= main_~i~0 5)} assume true; {5840#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {5840#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5841#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {5841#(<= main_~i~0 6)} assume true; {5841#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {5841#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5842#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {5842#(<= main_~i~0 7)} assume true; {5842#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {5842#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5843#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {5843#(<= main_~i~0 8)} assume true; {5843#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {5843#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5844#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:20,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {5844#(<= main_~i~0 9)} assume true; {5844#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:20,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {5844#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5845#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:20,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {5845#(<= main_~i~0 10)} assume true; {5845#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:20,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {5845#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5846#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:20,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {5846#(<= main_~i~0 11)} assume true; {5846#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:20,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {5846#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5834#false} is VALID [2018-11-14 16:52:20,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {5834#false} ~i~0 := 0; {5834#false} is VALID [2018-11-14 16:52:20,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 33: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 37: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 41: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 42: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,772 INFO L273 TraceCheckUtils]: 49: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {5834#false} assume !(~i~0 < 100000); {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 55: Hoare triple {5834#false} ~i~0 := 0; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 56: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,773 INFO L273 TraceCheckUtils]: 57: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 61: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 63: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 64: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,774 INFO L273 TraceCheckUtils]: 65: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 66: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 67: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 71: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 72: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,775 INFO L273 TraceCheckUtils]: 73: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 75: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 78: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,776 INFO L273 TraceCheckUtils]: 79: Hoare triple {5834#false} assume !(~i~0 < 100000); {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {5834#false} havoc ~x~0;~x~0 := 0; {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {5834#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L256 TraceCheckUtils]: 83: Hoare triple {5834#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L273 TraceCheckUtils]: 84: Hoare triple {5834#false} ~cond := #in~cond; {5834#false} is VALID [2018-11-14 16:52:20,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {5834#false} assume ~cond == 0; {5834#false} is VALID [2018-11-14 16:52:20,778 INFO L273 TraceCheckUtils]: 86: Hoare triple {5834#false} assume !false; {5834#false} is VALID [2018-11-14 16:52:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-14 16:52:20,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:20,781 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-14 16:52:20,791 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:52:39,451 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:52:39,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:39,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:39,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {5833#true} call ULTIMATE.init(); {5833#true} is VALID [2018-11-14 16:52:39,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {5833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5833#true} is VALID [2018-11-14 16:52:39,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5833#true} {5833#true} #78#return; {5833#true} is VALID [2018-11-14 16:52:39,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {5833#true} call #t~ret2 := main(); {5833#true} is VALID [2018-11-14 16:52:39,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {5833#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5833#true} is VALID [2018-11-14 16:52:39,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {5833#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {5833#true} assume true; {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {5833#true} assume !(~i~0 < 100000); {5833#true} is VALID [2018-11-14 16:52:39,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {5833#true} ~i~0 := 0; {5940#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:39,678 INFO L273 TraceCheckUtils]: 31: Hoare triple {5940#(<= main_~i~0 0)} assume true; {5940#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:39,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {5940#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5836#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:39,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {5836#(<= main_~i~0 1)} assume true; {5836#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:39,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {5836#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5837#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:39,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {5837#(<= main_~i~0 2)} assume true; {5837#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:39,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {5837#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5838#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:39,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {5838#(<= main_~i~0 3)} assume true; {5838#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:39,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {5838#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5839#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:39,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {5839#(<= main_~i~0 4)} assume true; {5839#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:39,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {5839#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5840#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:39,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {5840#(<= main_~i~0 5)} assume true; {5840#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:39,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {5840#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5841#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:39,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {5841#(<= main_~i~0 6)} assume true; {5841#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:39,685 INFO L273 TraceCheckUtils]: 44: Hoare triple {5841#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5842#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:39,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {5842#(<= main_~i~0 7)} assume true; {5842#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:39,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {5842#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5843#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:39,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {5843#(<= main_~i~0 8)} assume true; {5843#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:39,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {5843#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5844#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:39,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {5844#(<= main_~i~0 9)} assume true; {5844#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:39,689 INFO L273 TraceCheckUtils]: 50: Hoare triple {5844#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5845#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:39,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {5845#(<= main_~i~0 10)} assume true; {5845#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:39,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {5845#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5846#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:39,691 INFO L273 TraceCheckUtils]: 53: Hoare triple {5846#(<= main_~i~0 11)} assume true; {5846#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:39,692 INFO L273 TraceCheckUtils]: 54: Hoare triple {5846#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5834#false} is VALID [2018-11-14 16:52:39,692 INFO L273 TraceCheckUtils]: 55: Hoare triple {5834#false} ~i~0 := 0; {5834#false} is VALID [2018-11-14 16:52:39,692 INFO L273 TraceCheckUtils]: 56: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,692 INFO L273 TraceCheckUtils]: 57: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,693 INFO L273 TraceCheckUtils]: 58: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,693 INFO L273 TraceCheckUtils]: 59: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,693 INFO L273 TraceCheckUtils]: 60: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,693 INFO L273 TraceCheckUtils]: 61: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,693 INFO L273 TraceCheckUtils]: 62: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,694 INFO L273 TraceCheckUtils]: 65: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,694 INFO L273 TraceCheckUtils]: 66: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,694 INFO L273 TraceCheckUtils]: 67: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 69: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 71: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 72: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 73: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 74: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,695 INFO L273 TraceCheckUtils]: 75: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 76: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 77: Hoare triple {5834#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 78: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 79: Hoare triple {5834#false} assume !(~i~0 < 100000); {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 80: Hoare triple {5834#false} havoc ~x~0;~x~0 := 0; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 81: Hoare triple {5834#false} assume true; {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L273 TraceCheckUtils]: 82: Hoare triple {5834#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5834#false} is VALID [2018-11-14 16:52:39,696 INFO L256 TraceCheckUtils]: 83: Hoare triple {5834#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {5834#false} is VALID [2018-11-14 16:52:39,697 INFO L273 TraceCheckUtils]: 84: Hoare triple {5834#false} ~cond := #in~cond; {5834#false} is VALID [2018-11-14 16:52:39,697 INFO L273 TraceCheckUtils]: 85: Hoare triple {5834#false} assume ~cond == 0; {5834#false} is VALID [2018-11-14 16:52:39,697 INFO L273 TraceCheckUtils]: 86: Hoare triple {5834#false} assume !false; {5834#false} is VALID [2018-11-14 16:52:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-14 16:52:39,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:39,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:52:39,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-11-14 16:52:39,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:39,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:52:39,796 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-14 16:52:39,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:52:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:52:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:52:39,797 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 15 states. [2018-11-14 16:52:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:40,391 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-11-14 16:52:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:52:40,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-11-14 16:52:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 124 transitions. [2018-11-14 16:52:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 124 transitions. [2018-11-14 16:52:40,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 124 transitions. [2018-11-14 16:52:40,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:40,926 INFO L225 Difference]: With dead ends: 160 [2018-11-14 16:52:40,926 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 16:52:40,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:52:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 16:52:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-14 16:52:41,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:41,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2018-11-14 16:52:41,397 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-14 16:52:41,398 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-14 16:52:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:41,400 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-14 16:52:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 16:52:41,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:41,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:41,400 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-14 16:52:41,401 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-14 16:52:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:41,402 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-14 16:52:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 16:52:41,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:41,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:41,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:41,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:52:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-14 16:52:41,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 87 [2018-11-14 16:52:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:41,405 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-14 16:52:41,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:52:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 16:52:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 16:52:41,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:41,406 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:41,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:41,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 360971126, now seen corresponding path program 12 times [2018-11-14 16:52:41,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:41,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:41,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:42,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {6681#true} call ULTIMATE.init(); {6681#true} is VALID [2018-11-14 16:52:42,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {6681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6681#true} is VALID [2018-11-14 16:52:42,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:42,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6681#true} {6681#true} #78#return; {6681#true} is VALID [2018-11-14 16:52:42,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {6681#true} call #t~ret2 := main(); {6681#true} is VALID [2018-11-14 16:52:42,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {6681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6683#(= main_~i~0 0)} is VALID [2018-11-14 16:52:42,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {6683#(= main_~i~0 0)} assume true; {6683#(= main_~i~0 0)} is VALID [2018-11-14 16:52:42,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {6683#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6684#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:42,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {6684#(<= main_~i~0 1)} assume true; {6684#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:42,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {6684#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6685#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:42,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {6685#(<= main_~i~0 2)} assume true; {6685#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:42,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {6685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6686#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:42,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {6686#(<= main_~i~0 3)} assume true; {6686#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:42,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {6686#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6687#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:42,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {6687#(<= main_~i~0 4)} assume true; {6687#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:42,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {6687#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6688#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:42,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {6688#(<= main_~i~0 5)} assume true; {6688#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:42,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {6688#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6689#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:42,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {6689#(<= main_~i~0 6)} assume true; {6689#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:42,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {6689#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6690#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:42,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {6690#(<= main_~i~0 7)} assume true; {6690#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:42,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {6690#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6691#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:42,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {6691#(<= main_~i~0 8)} assume true; {6691#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:42,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {6691#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6692#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:42,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {6692#(<= main_~i~0 9)} assume true; {6692#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:42,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {6692#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6693#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:42,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {6693#(<= main_~i~0 10)} assume true; {6693#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:42,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {6693#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6694#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:42,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {6694#(<= main_~i~0 11)} assume true; {6694#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:42,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {6694#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6695#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:42,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {6695#(<= main_~i~0 12)} assume true; {6695#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:42,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {6695#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6682#false} is VALID [2018-11-14 16:52:42,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {6682#false} ~i~0 := 0; {6682#false} is VALID [2018-11-14 16:52:42,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,180 INFO L273 TraceCheckUtils]: 41: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,180 INFO L273 TraceCheckUtils]: 42: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 51: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 52: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 53: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 57: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {6682#false} assume !(~i~0 < 100000); {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {6682#false} ~i~0 := 0; {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,183 INFO L273 TraceCheckUtils]: 61: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 63: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 65: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,184 INFO L273 TraceCheckUtils]: 67: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 69: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 77: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 78: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,186 INFO L273 TraceCheckUtils]: 79: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 80: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 82: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 83: Hoare triple {6682#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {6682#false} assume !(~i~0 < 100000); {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {6682#false} havoc ~x~0;~x~0 := 0; {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L273 TraceCheckUtils]: 88: Hoare triple {6682#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L256 TraceCheckUtils]: 89: Hoare triple {6682#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L273 TraceCheckUtils]: 90: Hoare triple {6682#false} ~cond := #in~cond; {6682#false} is VALID [2018-11-14 16:52:42,188 INFO L273 TraceCheckUtils]: 91: Hoare triple {6682#false} assume ~cond == 0; {6682#false} is VALID [2018-11-14 16:52:42,189 INFO L273 TraceCheckUtils]: 92: Hoare triple {6682#false} assume !false; {6682#false} is VALID [2018-11-14 16:52:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-14 16:52:42,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:42,194 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-14 16:52:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:52:49,221 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 16:52:49,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:49,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:49,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {6681#true} call ULTIMATE.init(); {6681#true} is VALID [2018-11-14 16:52:49,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {6681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6681#true} is VALID [2018-11-14 16:52:49,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6681#true} {6681#true} #78#return; {6681#true} is VALID [2018-11-14 16:52:49,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {6681#true} call #t~ret2 := main(); {6681#true} is VALID [2018-11-14 16:52:49,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {6681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6681#true} is VALID [2018-11-14 16:52:49,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 31: Hoare triple {6681#true} assume !(~i~0 < 100000); {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {6681#true} ~i~0 := 0; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 36: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,463 INFO L273 TraceCheckUtils]: 37: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 38: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 41: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 42: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 43: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,466 INFO L273 TraceCheckUtils]: 56: Hoare triple {6681#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6681#true} is VALID [2018-11-14 16:52:49,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {6681#true} assume true; {6681#true} is VALID [2018-11-14 16:52:49,466 INFO L273 TraceCheckUtils]: 58: Hoare triple {6681#true} assume !(~i~0 < 100000); {6681#true} is VALID [2018-11-14 16:52:49,466 INFO L273 TraceCheckUtils]: 59: Hoare triple {6681#true} ~i~0 := 0; {6876#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:49,467 INFO L273 TraceCheckUtils]: 60: Hoare triple {6876#(<= main_~i~0 0)} assume true; {6876#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:49,467 INFO L273 TraceCheckUtils]: 61: Hoare triple {6876#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6684#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:49,468 INFO L273 TraceCheckUtils]: 62: Hoare triple {6684#(<= main_~i~0 1)} assume true; {6684#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:49,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {6684#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6685#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:49,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {6685#(<= main_~i~0 2)} assume true; {6685#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:49,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {6685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6686#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:49,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {6686#(<= main_~i~0 3)} assume true; {6686#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:49,470 INFO L273 TraceCheckUtils]: 67: Hoare triple {6686#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6687#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:49,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {6687#(<= main_~i~0 4)} assume true; {6687#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:49,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {6687#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6688#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:49,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {6688#(<= main_~i~0 5)} assume true; {6688#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:49,472 INFO L273 TraceCheckUtils]: 71: Hoare triple {6688#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6689#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:49,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {6689#(<= main_~i~0 6)} assume true; {6689#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:49,474 INFO L273 TraceCheckUtils]: 73: Hoare triple {6689#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6690#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:49,474 INFO L273 TraceCheckUtils]: 74: Hoare triple {6690#(<= main_~i~0 7)} assume true; {6690#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:49,475 INFO L273 TraceCheckUtils]: 75: Hoare triple {6690#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6691#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:49,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {6691#(<= main_~i~0 8)} assume true; {6691#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:49,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {6691#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6692#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:49,477 INFO L273 TraceCheckUtils]: 78: Hoare triple {6692#(<= main_~i~0 9)} assume true; {6692#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:49,478 INFO L273 TraceCheckUtils]: 79: Hoare triple {6692#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6693#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:49,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {6693#(<= main_~i~0 10)} assume true; {6693#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:49,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {6693#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6694#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:49,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {6694#(<= main_~i~0 11)} assume true; {6694#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:49,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {6694#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6695#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:49,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {6695#(<= main_~i~0 12)} assume true; {6695#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:49,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {6695#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6682#false} is VALID [2018-11-14 16:52:49,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {6682#false} havoc ~x~0;~x~0 := 0; {6682#false} is VALID [2018-11-14 16:52:49,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {6682#false} assume true; {6682#false} is VALID [2018-11-14 16:52:49,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {6682#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6682#false} is VALID [2018-11-14 16:52:49,483 INFO L256 TraceCheckUtils]: 89: Hoare triple {6682#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {6682#false} is VALID [2018-11-14 16:52:49,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {6682#false} ~cond := #in~cond; {6682#false} is VALID [2018-11-14 16:52:49,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {6682#false} assume ~cond == 0; {6682#false} is VALID [2018-11-14 16:52:49,484 INFO L273 TraceCheckUtils]: 92: Hoare triple {6682#false} assume !false; {6682#false} is VALID [2018-11-14 16:52:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-14 16:52:49,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:49,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 16:52:49,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-11-14 16:52:49,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:49,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:52:49,587 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-14 16:52:49,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:52:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:52:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:52:49,589 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 16 states. [2018-11-14 16:52:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:49,985 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-11-14 16:52:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:52:49,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-11-14 16:52:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:52:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2018-11-14 16:52:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:52:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2018-11-14 16:52:49,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 130 transitions. [2018-11-14 16:52:50,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:50,734 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:52:50,735 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 16:52:50,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 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-14 16:52:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 16:52:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-14 16:52:50,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:50,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2018-11-14 16:52:50,789 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-14 16:52:50,789 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-14 16:52:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:50,792 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-14 16:52:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-14 16:52:50,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:50,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:50,793 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-14 16:52:50,793 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-14 16:52:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:50,794 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-14 16:52:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-14 16:52:50,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:50,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:50,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:50,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:52:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-14 16:52:50,798 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 93 [2018-11-14 16:52:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:50,798 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-14 16:52:50,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:52:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-14 16:52:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 16:52:50,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:50,799 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:50,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:50,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash -612378096, now seen corresponding path program 13 times [2018-11-14 16:52:50,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:50,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:50,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:51,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {7584#true} call ULTIMATE.init(); {7584#true} is VALID [2018-11-14 16:52:51,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {7584#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7584#true} is VALID [2018-11-14 16:52:51,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {7584#true} assume true; {7584#true} is VALID [2018-11-14 16:52:51,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7584#true} {7584#true} #78#return; {7584#true} is VALID [2018-11-14 16:52:51,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {7584#true} call #t~ret2 := main(); {7584#true} is VALID [2018-11-14 16:52:51,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {7584#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7586#(= main_~i~0 0)} is VALID [2018-11-14 16:52:51,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {7586#(= main_~i~0 0)} assume true; {7586#(= main_~i~0 0)} is VALID [2018-11-14 16:52:51,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {7586#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7587#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:51,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {7587#(<= main_~i~0 1)} assume true; {7587#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:51,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {7587#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7588#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:51,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {7588#(<= main_~i~0 2)} assume true; {7588#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:51,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {7588#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7589#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:51,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {7589#(<= main_~i~0 3)} assume true; {7589#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:51,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {7589#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7590#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:51,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {7590#(<= main_~i~0 4)} assume true; {7590#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:51,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {7590#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7591#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:51,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {7591#(<= main_~i~0 5)} assume true; {7591#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:51,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {7591#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7592#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:51,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {7592#(<= main_~i~0 6)} assume true; {7592#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:51,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {7592#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7593#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:51,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {7593#(<= main_~i~0 7)} assume true; {7593#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:51,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {7593#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7594#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:51,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {7594#(<= main_~i~0 8)} assume true; {7594#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:51,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {7594#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7595#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:51,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {7595#(<= main_~i~0 9)} assume true; {7595#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:51,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {7595#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7596#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:51,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {7596#(<= main_~i~0 10)} assume true; {7596#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:51,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {7596#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7597#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:51,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {7597#(<= main_~i~0 11)} assume true; {7597#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:51,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {7597#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7598#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:51,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {7598#(<= main_~i~0 12)} assume true; {7598#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:51,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {7598#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7599#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:51,086 INFO L273 TraceCheckUtils]: 32: Hoare triple {7599#(<= main_~i~0 13)} assume true; {7599#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:51,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {7599#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,087 INFO L273 TraceCheckUtils]: 34: Hoare triple {7585#false} ~i~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,088 INFO L273 TraceCheckUtils]: 36: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,088 INFO L273 TraceCheckUtils]: 38: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,088 INFO L273 TraceCheckUtils]: 39: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,088 INFO L273 TraceCheckUtils]: 40: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,089 INFO L273 TraceCheckUtils]: 41: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,089 INFO L273 TraceCheckUtils]: 42: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,089 INFO L273 TraceCheckUtils]: 43: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,089 INFO L273 TraceCheckUtils]: 44: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,090 INFO L273 TraceCheckUtils]: 47: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,090 INFO L273 TraceCheckUtils]: 48: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 51: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 52: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 53: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,091 INFO L273 TraceCheckUtils]: 54: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,092 INFO L273 TraceCheckUtils]: 55: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,092 INFO L273 TraceCheckUtils]: 56: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 62: Hoare triple {7585#false} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 63: Hoare triple {7585#false} ~i~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 64: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,093 INFO L273 TraceCheckUtils]: 65: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,094 INFO L273 TraceCheckUtils]: 67: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,094 INFO L273 TraceCheckUtils]: 68: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,094 INFO L273 TraceCheckUtils]: 69: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,094 INFO L273 TraceCheckUtils]: 70: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 71: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 72: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 73: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 74: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 75: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,095 INFO L273 TraceCheckUtils]: 76: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,096 INFO L273 TraceCheckUtils]: 77: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,096 INFO L273 TraceCheckUtils]: 78: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,096 INFO L273 TraceCheckUtils]: 79: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,096 INFO L273 TraceCheckUtils]: 80: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 82: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 84: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 85: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 86: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 87: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,097 INFO L273 TraceCheckUtils]: 88: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,098 INFO L273 TraceCheckUtils]: 89: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,098 INFO L273 TraceCheckUtils]: 90: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {7585#false} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {7585#false} havoc ~x~0;~x~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,098 INFO L273 TraceCheckUtils]: 93: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,099 INFO L273 TraceCheckUtils]: 94: Hoare triple {7585#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7585#false} is VALID [2018-11-14 16:52:51,099 INFO L256 TraceCheckUtils]: 95: Hoare triple {7585#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {7585#false} is VALID [2018-11-14 16:52:51,099 INFO L273 TraceCheckUtils]: 96: Hoare triple {7585#false} ~cond := #in~cond; {7585#false} is VALID [2018-11-14 16:52:51,099 INFO L273 TraceCheckUtils]: 97: Hoare triple {7585#false} assume ~cond == 0; {7585#false} is VALID [2018-11-14 16:52:51,099 INFO L273 TraceCheckUtils]: 98: Hoare triple {7585#false} assume !false; {7585#false} is VALID [2018-11-14 16:52:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-14 16:52:51,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:51,106 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-14 16:52:51,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:51,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:51,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {7584#true} call ULTIMATE.init(); {7584#true} is VALID [2018-11-14 16:52:51,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {7584#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7584#true} is VALID [2018-11-14 16:52:51,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {7584#true} assume true; {7584#true} is VALID [2018-11-14 16:52:51,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7584#true} {7584#true} #78#return; {7584#true} is VALID [2018-11-14 16:52:51,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {7584#true} call #t~ret2 := main(); {7584#true} is VALID [2018-11-14 16:52:51,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {7584#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7618#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:51,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {7618#(<= main_~i~0 0)} assume true; {7618#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:51,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {7618#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7587#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:51,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {7587#(<= main_~i~0 1)} assume true; {7587#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:51,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {7587#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7588#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:51,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {7588#(<= main_~i~0 2)} assume true; {7588#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:51,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {7588#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7589#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:51,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {7589#(<= main_~i~0 3)} assume true; {7589#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:51,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {7589#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7590#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:51,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {7590#(<= main_~i~0 4)} assume true; {7590#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:51,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {7590#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7591#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:51,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {7591#(<= main_~i~0 5)} assume true; {7591#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:51,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {7591#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7592#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:51,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {7592#(<= main_~i~0 6)} assume true; {7592#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:51,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {7592#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7593#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:51,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {7593#(<= main_~i~0 7)} assume true; {7593#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:51,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {7593#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7594#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:51,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {7594#(<= main_~i~0 8)} assume true; {7594#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:51,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {7594#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7595#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:51,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {7595#(<= main_~i~0 9)} assume true; {7595#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:51,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {7595#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7596#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:51,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {7596#(<= main_~i~0 10)} assume true; {7596#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:51,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {7596#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7597#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:51,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {7597#(<= main_~i~0 11)} assume true; {7597#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:51,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {7597#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7598#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:51,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {7598#(<= main_~i~0 12)} assume true; {7598#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:51,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {7598#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7599#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:51,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {7599#(<= main_~i~0 13)} assume true; {7599#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:51,643 INFO L273 TraceCheckUtils]: 33: Hoare triple {7599#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {7585#false} ~i~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 60: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,647 INFO L273 TraceCheckUtils]: 62: Hoare triple {7585#false} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {7585#false} ~i~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 66: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 67: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 69: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,648 INFO L273 TraceCheckUtils]: 70: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 73: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,649 INFO L273 TraceCheckUtils]: 79: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 81: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 82: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 83: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 84: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 85: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,650 INFO L273 TraceCheckUtils]: 88: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {7585#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 90: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {7585#false} assume !(~i~0 < 100000); {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {7585#false} havoc ~x~0;~x~0 := 0; {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 93: Hoare triple {7585#false} assume true; {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 94: Hoare triple {7585#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L256 TraceCheckUtils]: 95: Hoare triple {7585#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {7585#false} is VALID [2018-11-14 16:52:51,651 INFO L273 TraceCheckUtils]: 96: Hoare triple {7585#false} ~cond := #in~cond; {7585#false} is VALID [2018-11-14 16:52:51,652 INFO L273 TraceCheckUtils]: 97: Hoare triple {7585#false} assume ~cond == 0; {7585#false} is VALID [2018-11-14 16:52:51,652 INFO L273 TraceCheckUtils]: 98: Hoare triple {7585#false} assume !false; {7585#false} is VALID [2018-11-14 16:52:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-14 16:52:51,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:51,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:52:51,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-11-14 16:52:51,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:51,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:52:51,723 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-14 16:52:51,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:52:51,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:52:51,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:52:51,725 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 17 states. [2018-11-14 16:52:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:52,718 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 16:52:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:52:52,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-11-14 16:52:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:52:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 136 transitions. [2018-11-14 16:52:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:52:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 136 transitions. [2018-11-14 16:52:52,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 136 transitions. [2018-11-14 16:52:53,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:53,352 INFO L225 Difference]: With dead ends: 180 [2018-11-14 16:52:53,352 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 16:52:53,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:52:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 16:52:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-14 16:52:53,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:53,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-14 16:52:53,408 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 16:52:53,408 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 16:52:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:53,411 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-11-14 16:52:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-14 16:52:53,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:53,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:53,412 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 16:52:53,412 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 16:52:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:53,414 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-11-14 16:52:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-14 16:52:53,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:53,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:53,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:53,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 16:52:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-11-14 16:52:53,417 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 99 [2018-11-14 16:52:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-11-14 16:52:53,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:52:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-14 16:52:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 16:52:53,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:53,419 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:53,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:53,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1552736982, now seen corresponding path program 14 times [2018-11-14 16:52:53,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:53,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:54,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {8542#true} call ULTIMATE.init(); {8542#true} is VALID [2018-11-14 16:52:54,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {8542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8542#true} is VALID [2018-11-14 16:52:54,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {8542#true} assume true; {8542#true} is VALID [2018-11-14 16:52:54,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8542#true} {8542#true} #78#return; {8542#true} is VALID [2018-11-14 16:52:54,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {8542#true} call #t~ret2 := main(); {8542#true} is VALID [2018-11-14 16:52:54,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {8542#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8544#(= main_~i~0 0)} is VALID [2018-11-14 16:52:54,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {8544#(= main_~i~0 0)} assume true; {8544#(= main_~i~0 0)} is VALID [2018-11-14 16:52:54,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {8544#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8545#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:54,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {8545#(<= main_~i~0 1)} assume true; {8545#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:54,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {8545#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8546#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:54,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {8546#(<= main_~i~0 2)} assume true; {8546#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:54,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {8546#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8547#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:54,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {8547#(<= main_~i~0 3)} assume true; {8547#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:54,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {8547#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8548#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:54,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {8548#(<= main_~i~0 4)} assume true; {8548#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:54,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {8548#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8549#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:54,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {8549#(<= main_~i~0 5)} assume true; {8549#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:54,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {8549#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8550#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:54,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {8550#(<= main_~i~0 6)} assume true; {8550#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:54,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {8550#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8551#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:54,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {8551#(<= main_~i~0 7)} assume true; {8551#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:54,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {8551#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8552#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:54,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {8552#(<= main_~i~0 8)} assume true; {8552#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:54,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {8552#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8553#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:54,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {8553#(<= main_~i~0 9)} assume true; {8553#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:54,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {8553#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8554#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:54,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {8554#(<= main_~i~0 10)} assume true; {8554#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:54,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {8554#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8555#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:54,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {8555#(<= main_~i~0 11)} assume true; {8555#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:54,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {8555#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8556#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:54,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {8556#(<= main_~i~0 12)} assume true; {8556#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:54,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {8556#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8557#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:54,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {8557#(<= main_~i~0 13)} assume true; {8557#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:54,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8558#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:54,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {8558#(<= main_~i~0 14)} assume true; {8558#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:54,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {8558#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {8543#false} ~i~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,533 INFO L273 TraceCheckUtils]: 38: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,534 INFO L273 TraceCheckUtils]: 41: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,534 INFO L273 TraceCheckUtils]: 42: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,535 INFO L273 TraceCheckUtils]: 43: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,535 INFO L273 TraceCheckUtils]: 44: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,535 INFO L273 TraceCheckUtils]: 45: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,535 INFO L273 TraceCheckUtils]: 46: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,536 INFO L273 TraceCheckUtils]: 47: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,536 INFO L273 TraceCheckUtils]: 48: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,536 INFO L273 TraceCheckUtils]: 49: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,536 INFO L273 TraceCheckUtils]: 50: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 51: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 55: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 62: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 63: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,538 INFO L273 TraceCheckUtils]: 64: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 65: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 66: Hoare triple {8543#false} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 67: Hoare triple {8543#false} ~i~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 68: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 69: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,539 INFO L273 TraceCheckUtils]: 70: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 71: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 72: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 73: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 74: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 75: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 76: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,540 INFO L273 TraceCheckUtils]: 77: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 78: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 79: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 80: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 82: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 83: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,541 INFO L273 TraceCheckUtils]: 84: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 85: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 86: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 87: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 88: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 89: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,542 INFO L273 TraceCheckUtils]: 90: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 91: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 92: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 93: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 94: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 95: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 96: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {8543#false} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 98: Hoare triple {8543#false} havoc ~x~0;~x~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 99: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 100: Hoare triple {8543#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L256 TraceCheckUtils]: 101: Hoare triple {8543#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {8543#false} ~cond := #in~cond; {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 103: Hoare triple {8543#false} assume ~cond == 0; {8543#false} is VALID [2018-11-14 16:52:54,544 INFO L273 TraceCheckUtils]: 104: Hoare triple {8543#false} assume !false; {8543#false} is VALID [2018-11-14 16:52:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-14 16:52:54,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:54,570 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-14 16:52:54,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:54,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:54,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:54,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:54,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {8542#true} call ULTIMATE.init(); {8542#true} is VALID [2018-11-14 16:52:54,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {8542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8542#true} is VALID [2018-11-14 16:52:54,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {8542#true} assume true; {8542#true} is VALID [2018-11-14 16:52:54,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8542#true} {8542#true} #78#return; {8542#true} is VALID [2018-11-14 16:52:54,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {8542#true} call #t~ret2 := main(); {8542#true} is VALID [2018-11-14 16:52:54,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {8542#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8577#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:54,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {8577#(<= main_~i~0 0)} assume true; {8577#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:54,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {8577#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8545#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:54,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {8545#(<= main_~i~0 1)} assume true; {8545#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:54,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {8545#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8546#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:54,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {8546#(<= main_~i~0 2)} assume true; {8546#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:54,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {8546#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8547#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:54,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {8547#(<= main_~i~0 3)} assume true; {8547#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:54,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {8547#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8548#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:54,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {8548#(<= main_~i~0 4)} assume true; {8548#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:54,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {8548#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8549#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:54,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {8549#(<= main_~i~0 5)} assume true; {8549#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:54,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {8549#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8550#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:54,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {8550#(<= main_~i~0 6)} assume true; {8550#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:54,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {8550#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8551#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:54,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {8551#(<= main_~i~0 7)} assume true; {8551#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:54,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {8551#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8552#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:54,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {8552#(<= main_~i~0 8)} assume true; {8552#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:54,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {8552#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8553#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:54,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {8553#(<= main_~i~0 9)} assume true; {8553#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:54,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {8553#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8554#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:54,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {8554#(<= main_~i~0 10)} assume true; {8554#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:54,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {8554#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8555#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:54,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {8555#(<= main_~i~0 11)} assume true; {8555#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:54,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {8555#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8556#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:54,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {8556#(<= main_~i~0 12)} assume true; {8556#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:54,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {8556#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8557#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:54,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {8557#(<= main_~i~0 13)} assume true; {8557#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:54,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8558#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:54,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {8558#(<= main_~i~0 14)} assume true; {8558#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:54,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {8558#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {8543#false} ~i~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,816 INFO L273 TraceCheckUtils]: 39: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 43: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 44: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 45: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 50: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 57: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,818 INFO L273 TraceCheckUtils]: 58: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 60: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 61: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 62: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 63: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 64: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,819 INFO L273 TraceCheckUtils]: 66: Hoare triple {8543#false} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 67: Hoare triple {8543#false} ~i~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 68: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 71: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 72: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 73: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 74: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,820 INFO L273 TraceCheckUtils]: 75: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 77: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 78: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 79: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 80: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 81: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 82: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,821 INFO L273 TraceCheckUtils]: 83: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 84: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 85: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 86: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 87: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,822 INFO L273 TraceCheckUtils]: 92: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 94: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 95: Hoare triple {8543#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 96: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 97: Hoare triple {8543#false} assume !(~i~0 < 100000); {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 98: Hoare triple {8543#false} havoc ~x~0;~x~0 := 0; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {8543#false} assume true; {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {8543#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8543#false} is VALID [2018-11-14 16:52:54,823 INFO L256 TraceCheckUtils]: 101: Hoare triple {8543#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {8543#false} is VALID [2018-11-14 16:52:54,824 INFO L273 TraceCheckUtils]: 102: Hoare triple {8543#false} ~cond := #in~cond; {8543#false} is VALID [2018-11-14 16:52:54,824 INFO L273 TraceCheckUtils]: 103: Hoare triple {8543#false} assume ~cond == 0; {8543#false} is VALID [2018-11-14 16:52:54,824 INFO L273 TraceCheckUtils]: 104: Hoare triple {8543#false} assume !false; {8543#false} is VALID [2018-11-14 16:52:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-14 16:52:54,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:52:54,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-11-14 16:52:54,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:54,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:52:54,902 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-14 16:52:54,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:52:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:52:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:52:54,903 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 18 states. [2018-11-14 16:52:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:55,432 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2018-11-14 16:52:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:52:55,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-11-14 16:52:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:52:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 142 transitions. [2018-11-14 16:52:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:52:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 142 transitions. [2018-11-14 16:52:55,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 142 transitions. [2018-11-14 16:52:55,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:55,570 INFO L225 Difference]: With dead ends: 190 [2018-11-14 16:52:55,570 INFO L226 Difference]: Without dead ends: 116 [2018-11-14 16:52:55,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:52:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-14 16:52:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-14 16:52:55,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:55,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 116 states. [2018-11-14 16:52:55,689 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2018-11-14 16:52:55,690 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2018-11-14 16:52:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:55,692 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-11-14 16:52:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-14 16:52:55,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:55,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:55,693 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2018-11-14 16:52:55,693 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2018-11-14 16:52:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:55,695 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-11-14 16:52:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-14 16:52:55,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:55,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:55,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:55,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-14 16:52:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-11-14 16:52:55,698 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 105 [2018-11-14 16:52:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:55,699 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-11-14 16:52:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:52:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-14 16:52:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-14 16:52:55,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:55,700 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:55,700 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:55,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1974541116, now seen corresponding path program 15 times [2018-11-14 16:52:55,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:55,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:55,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:56,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2018-11-14 16:52:56,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9555#true} is VALID [2018-11-14 16:52:56,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2018-11-14 16:52:56,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #78#return; {9555#true} is VALID [2018-11-14 16:52:56,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret2 := main(); {9555#true} is VALID [2018-11-14 16:52:56,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {9555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9557#(= main_~i~0 0)} is VALID [2018-11-14 16:52:56,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {9557#(= main_~i~0 0)} assume true; {9557#(= main_~i~0 0)} is VALID [2018-11-14 16:52:56,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {9557#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9558#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:56,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {9558#(<= main_~i~0 1)} assume true; {9558#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:56,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {9558#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9559#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:56,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {9559#(<= main_~i~0 2)} assume true; {9559#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:56,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {9559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9560#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:56,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {9560#(<= main_~i~0 3)} assume true; {9560#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:56,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {9560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9561#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:56,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {9561#(<= main_~i~0 4)} assume true; {9561#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:56,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {9561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9562#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:56,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {9562#(<= main_~i~0 5)} assume true; {9562#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:56,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {9562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9563#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:56,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {9563#(<= main_~i~0 6)} assume true; {9563#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:56,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {9563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9564#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:56,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {9564#(<= main_~i~0 7)} assume true; {9564#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:56,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {9564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9565#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:56,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {9565#(<= main_~i~0 8)} assume true; {9565#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:56,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {9565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9566#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:56,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {9566#(<= main_~i~0 9)} assume true; {9566#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:56,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {9566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9567#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:56,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {9567#(<= main_~i~0 10)} assume true; {9567#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:56,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {9567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9568#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:56,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {9568#(<= main_~i~0 11)} assume true; {9568#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:56,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {9568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9569#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:56,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {9569#(<= main_~i~0 12)} assume true; {9569#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:56,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {9569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9570#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:56,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {9570#(<= main_~i~0 13)} assume true; {9570#(<= main_~i~0 13)} is VALID [2018-11-14 16:52:56,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {9570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9571#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:56,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {9571#(<= main_~i~0 14)} assume true; {9571#(<= main_~i~0 14)} is VALID [2018-11-14 16:52:56,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {9571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9572#(<= main_~i~0 15)} is VALID [2018-11-14 16:52:56,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {9572#(<= main_~i~0 15)} assume true; {9572#(<= main_~i~0 15)} is VALID [2018-11-14 16:52:56,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {9572#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:52:56,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {9556#false} ~i~0 := 0; {9556#false} is VALID [2018-11-14 16:52:56,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,692 INFO L273 TraceCheckUtils]: 47: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 56: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,694 INFO L273 TraceCheckUtils]: 65: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 69: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {9556#false} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 71: Hoare triple {9556#false} ~i~0 := 0; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 72: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 73: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,695 INFO L273 TraceCheckUtils]: 74: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 76: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 77: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 78: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 79: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 80: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 81: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,696 INFO L273 TraceCheckUtils]: 82: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 83: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 84: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 85: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 86: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 87: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 88: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 89: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 90: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,697 INFO L273 TraceCheckUtils]: 91: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 92: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 93: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 94: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 95: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 96: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 97: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 98: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 99: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,698 INFO L273 TraceCheckUtils]: 100: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 101: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 102: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 103: Hoare triple {9556#false} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 104: Hoare triple {9556#false} havoc ~x~0;~x~0 := 0; {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 105: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 106: Hoare triple {9556#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L256 TraceCheckUtils]: 107: Hoare triple {9556#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {9556#false} is VALID [2018-11-14 16:52:56,699 INFO L273 TraceCheckUtils]: 108: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2018-11-14 16:52:56,700 INFO L273 TraceCheckUtils]: 109: Hoare triple {9556#false} assume ~cond == 0; {9556#false} is VALID [2018-11-14 16:52:56,700 INFO L273 TraceCheckUtils]: 110: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2018-11-14 16:52:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-14 16:52:56,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:56,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 16:52:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:53:13,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 16:53:13,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:13,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:13,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2018-11-14 16:53:13,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9555#true} is VALID [2018-11-14 16:53:13,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2018-11-14 16:53:13,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #78#return; {9555#true} is VALID [2018-11-14 16:53:13,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret2 := main(); {9555#true} is VALID [2018-11-14 16:53:13,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {9555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9591#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:13,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {9591#(<= main_~i~0 0)} assume true; {9591#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:13,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {9591#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9558#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:13,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {9558#(<= main_~i~0 1)} assume true; {9558#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:13,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {9558#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9559#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:13,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {9559#(<= main_~i~0 2)} assume true; {9559#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:13,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {9559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9560#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:13,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {9560#(<= main_~i~0 3)} assume true; {9560#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:13,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {9560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9561#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:13,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {9561#(<= main_~i~0 4)} assume true; {9561#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:13,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {9561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9562#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:13,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {9562#(<= main_~i~0 5)} assume true; {9562#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:13,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {9562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9563#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:13,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {9563#(<= main_~i~0 6)} assume true; {9563#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:13,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {9563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9564#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:13,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {9564#(<= main_~i~0 7)} assume true; {9564#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:13,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {9564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9565#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:13,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {9565#(<= main_~i~0 8)} assume true; {9565#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:13,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {9565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9566#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:13,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {9566#(<= main_~i~0 9)} assume true; {9566#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:13,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {9566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9567#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:13,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {9567#(<= main_~i~0 10)} assume true; {9567#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:13,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {9567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9568#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:13,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {9568#(<= main_~i~0 11)} assume true; {9568#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:13,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {9568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9569#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:13,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {9569#(<= main_~i~0 12)} assume true; {9569#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:13,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {9569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9570#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:13,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {9570#(<= main_~i~0 13)} assume true; {9570#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:13,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {9570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9571#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:13,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {9571#(<= main_~i~0 14)} assume true; {9571#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:13,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {9571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9572#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:13,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {9572#(<= main_~i~0 15)} assume true; {9572#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:13,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {9572#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:53:13,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {9556#false} ~i~0 := 0; {9556#false} is VALID [2018-11-14 16:53:13,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 46: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,962 INFO L273 TraceCheckUtils]: 47: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 51: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 53: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 54: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,963 INFO L273 TraceCheckUtils]: 55: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 56: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 58: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 59: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 60: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,964 INFO L273 TraceCheckUtils]: 61: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 63: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 66: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,965 INFO L273 TraceCheckUtils]: 67: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 68: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 69: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 70: Hoare triple {9556#false} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 71: Hoare triple {9556#false} ~i~0 := 0; {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 72: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,966 INFO L273 TraceCheckUtils]: 73: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,967 INFO L273 TraceCheckUtils]: 74: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,967 INFO L273 TraceCheckUtils]: 75: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,967 INFO L273 TraceCheckUtils]: 76: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,967 INFO L273 TraceCheckUtils]: 77: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,967 INFO L273 TraceCheckUtils]: 78: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 79: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 80: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 81: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,968 INFO L273 TraceCheckUtils]: 84: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 85: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 86: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 87: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 88: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 89: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,969 INFO L273 TraceCheckUtils]: 90: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 91: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 92: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 93: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 94: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 95: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 96: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,970 INFO L273 TraceCheckUtils]: 97: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 98: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 99: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 101: Hoare triple {9556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 102: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,971 INFO L273 TraceCheckUtils]: 103: Hoare triple {9556#false} assume !(~i~0 < 100000); {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L273 TraceCheckUtils]: 104: Hoare triple {9556#false} havoc ~x~0;~x~0 := 0; {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L273 TraceCheckUtils]: 105: Hoare triple {9556#false} assume true; {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L273 TraceCheckUtils]: 106: Hoare triple {9556#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L256 TraceCheckUtils]: 107: Hoare triple {9556#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L273 TraceCheckUtils]: 108: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2018-11-14 16:53:13,972 INFO L273 TraceCheckUtils]: 109: Hoare triple {9556#false} assume ~cond == 0; {9556#false} is VALID [2018-11-14 16:53:13,973 INFO L273 TraceCheckUtils]: 110: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2018-11-14 16:53:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-14 16:53:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 16:53:14,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 111 [2018-11-14 16:53:14,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:14,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:53:14,067 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-14 16:53:14,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:53:14,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:53:14,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:53:14,068 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 19 states. [2018-11-14 16:53:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:14,936 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2018-11-14 16:53:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:53:14,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 111 [2018-11-14 16:53:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:53:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 148 transitions. [2018-11-14 16:53:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:53:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 148 transitions. [2018-11-14 16:53:14,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 148 transitions. [2018-11-14 16:53:15,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:15,079 INFO L225 Difference]: With dead ends: 200 [2018-11-14 16:53:15,079 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:53:15,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 111 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-14 16:53:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:53:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-14 16:53:15,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:15,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 122 states. [2018-11-14 16:53:15,130 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:53:15,130 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:53:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:15,133 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-11-14 16:53:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:53:15,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:15,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:15,134 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:53:15,134 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:53:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:15,136 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-11-14 16:53:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:53:15,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:15,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:15,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:15,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:53:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-11-14 16:53:15,138 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 111 [2018-11-14 16:53:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:15,138 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-11-14 16:53:15,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:53:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:53:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:53:15,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:15,139 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:15,140 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:15,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1764994850, now seen corresponding path program 16 times [2018-11-14 16:53:15,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:15,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:15,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:15,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {10623#true} call ULTIMATE.init(); {10623#true} is VALID [2018-11-14 16:53:15,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {10623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10623#true} is VALID [2018-11-14 16:53:15,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {10623#true} assume true; {10623#true} is VALID [2018-11-14 16:53:15,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10623#true} {10623#true} #78#return; {10623#true} is VALID [2018-11-14 16:53:15,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {10623#true} call #t~ret2 := main(); {10623#true} is VALID [2018-11-14 16:53:15,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {10623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10625#(= main_~i~0 0)} is VALID [2018-11-14 16:53:15,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {10625#(= main_~i~0 0)} assume true; {10625#(= main_~i~0 0)} is VALID [2018-11-14 16:53:15,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {10625#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10626#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {10626#(<= main_~i~0 1)} assume true; {10626#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {10626#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10627#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {10627#(<= main_~i~0 2)} assume true; {10627#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {10627#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10628#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {10628#(<= main_~i~0 3)} assume true; {10628#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {10628#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10629#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {10629#(<= main_~i~0 4)} assume true; {10629#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {10629#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10630#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {10630#(<= main_~i~0 5)} assume true; {10630#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {10630#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10631#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {10631#(<= main_~i~0 6)} assume true; {10631#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {10631#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10632#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {10632#(<= main_~i~0 7)} assume true; {10632#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {10632#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10633#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {10633#(<= main_~i~0 8)} assume true; {10633#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {10633#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10634#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {10634#(<= main_~i~0 9)} assume true; {10634#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {10634#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10635#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {10635#(<= main_~i~0 10)} assume true; {10635#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {10635#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10636#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {10636#(<= main_~i~0 11)} assume true; {10636#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {10636#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10637#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:15,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {10637#(<= main_~i~0 12)} assume true; {10637#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:15,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {10637#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10638#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:15,768 INFO L273 TraceCheckUtils]: 32: Hoare triple {10638#(<= main_~i~0 13)} assume true; {10638#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:15,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {10638#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10639#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:15,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {10639#(<= main_~i~0 14)} assume true; {10639#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:15,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {10639#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10640#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:15,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {10640#(<= main_~i~0 15)} assume true; {10640#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:15,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {10640#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10641#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:15,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {10641#(<= main_~i~0 16)} assume true; {10641#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:15,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {10641#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:15,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-14 16:53:15,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 51: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 52: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 54: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,775 INFO L273 TraceCheckUtils]: 55: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 56: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 57: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 58: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 60: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 61: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 62: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 65: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 66: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 68: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 69: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 70: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 71: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 73: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 74: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 75: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 76: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 77: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 78: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 79: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 82: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 83: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 84: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 85: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 86: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 87: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 88: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 91: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 93: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 94: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 95: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 96: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 97: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 98: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 100: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 101: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 102: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 103: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 104: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 105: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 106: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 107: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:15,781 INFO L273 TraceCheckUtils]: 108: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 109: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 110: Hoare triple {10624#false} havoc ~x~0;~x~0 := 0; {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 111: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 112: Hoare triple {10624#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L256 TraceCheckUtils]: 113: Hoare triple {10624#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 114: Hoare triple {10624#false} ~cond := #in~cond; {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 115: Hoare triple {10624#false} assume ~cond == 0; {10624#false} is VALID [2018-11-14 16:53:15,782 INFO L273 TraceCheckUtils]: 116: Hoare triple {10624#false} assume !false; {10624#false} is VALID [2018-11-14 16:53:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-14 16:53:15,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:15,789 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-14 16:53:15,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:53:15,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:53:15,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:15,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:16,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {10623#true} call ULTIMATE.init(); {10623#true} is VALID [2018-11-14 16:53:16,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {10623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10623#true} is VALID [2018-11-14 16:53:16,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {10623#true} assume true; {10623#true} is VALID [2018-11-14 16:53:16,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10623#true} {10623#true} #78#return; {10623#true} is VALID [2018-11-14 16:53:16,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {10623#true} call #t~ret2 := main(); {10623#true} is VALID [2018-11-14 16:53:16,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {10623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10660#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:16,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {10660#(<= main_~i~0 0)} assume true; {10660#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:16,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {10660#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10626#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:16,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {10626#(<= main_~i~0 1)} assume true; {10626#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:16,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {10626#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10627#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:16,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {10627#(<= main_~i~0 2)} assume true; {10627#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:16,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {10627#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10628#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:16,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {10628#(<= main_~i~0 3)} assume true; {10628#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:16,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {10628#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10629#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:16,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {10629#(<= main_~i~0 4)} assume true; {10629#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:16,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {10629#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10630#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:16,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {10630#(<= main_~i~0 5)} assume true; {10630#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:16,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {10630#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10631#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:16,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {10631#(<= main_~i~0 6)} assume true; {10631#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:16,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {10631#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10632#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:16,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {10632#(<= main_~i~0 7)} assume true; {10632#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:16,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {10632#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10633#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:16,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {10633#(<= main_~i~0 8)} assume true; {10633#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:16,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {10633#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10634#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:16,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {10634#(<= main_~i~0 9)} assume true; {10634#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:16,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {10634#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10635#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:16,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {10635#(<= main_~i~0 10)} assume true; {10635#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:16,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {10635#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10636#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:16,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {10636#(<= main_~i~0 11)} assume true; {10636#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:16,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {10636#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10637#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:16,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {10637#(<= main_~i~0 12)} assume true; {10637#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:16,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {10637#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10638#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:16,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {10638#(<= main_~i~0 13)} assume true; {10638#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:16,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {10638#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10639#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:16,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {10639#(<= main_~i~0 14)} assume true; {10639#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:16,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {10639#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10640#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:16,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {10640#(<= main_~i~0 15)} assume true; {10640#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:16,118 INFO L273 TraceCheckUtils]: 37: Hoare triple {10640#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10641#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:16,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {10641#(<= main_~i~0 16)} assume true; {10641#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:16,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {10641#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:16,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-14 16:53:16,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,120 INFO L273 TraceCheckUtils]: 42: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,120 INFO L273 TraceCheckUtils]: 43: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,121 INFO L273 TraceCheckUtils]: 44: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,121 INFO L273 TraceCheckUtils]: 45: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,123 INFO L273 TraceCheckUtils]: 58: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 62: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 63: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,124 INFO L273 TraceCheckUtils]: 64: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 65: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 66: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 67: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 71: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 72: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,125 INFO L273 TraceCheckUtils]: 73: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 75: Hoare triple {10624#false} ~i~0 := 0; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 78: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 80: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 81: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,126 INFO L273 TraceCheckUtils]: 82: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 83: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 84: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 85: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 86: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 87: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 88: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 89: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,127 INFO L273 TraceCheckUtils]: 90: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 91: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 92: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 93: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 94: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 95: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 96: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 97: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 98: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,128 INFO L273 TraceCheckUtils]: 99: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 100: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 101: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 102: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 103: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 104: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 105: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 106: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 107: Hoare triple {10624#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10624#false} is VALID [2018-11-14 16:53:16,129 INFO L273 TraceCheckUtils]: 108: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 109: Hoare triple {10624#false} assume !(~i~0 < 100000); {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 110: Hoare triple {10624#false} havoc ~x~0;~x~0 := 0; {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 111: Hoare triple {10624#false} assume true; {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 112: Hoare triple {10624#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L256 TraceCheckUtils]: 113: Hoare triple {10624#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 114: Hoare triple {10624#false} ~cond := #in~cond; {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 115: Hoare triple {10624#false} assume ~cond == 0; {10624#false} is VALID [2018-11-14 16:53:16,130 INFO L273 TraceCheckUtils]: 116: Hoare triple {10624#false} assume !false; {10624#false} is VALID [2018-11-14 16:53:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-14 16:53:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 16:53:16,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2018-11-14 16:53:16,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:16,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:53:16,209 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-14 16:53:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:53:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:53:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:53:16,210 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 20 states. [2018-11-14 16:53:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:16,909 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-14 16:53:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:53:16,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2018-11-14 16:53:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:53:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 154 transitions. [2018-11-14 16:53:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:53:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 154 transitions. [2018-11-14 16:53:16,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 154 transitions. [2018-11-14 16:53:17,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:17,127 INFO L225 Difference]: With dead ends: 210 [2018-11-14 16:53:17,128 INFO L226 Difference]: Without dead ends: 128 [2018-11-14 16:53:17,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:53:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-14 16:53:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-14 16:53:17,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:17,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 128 states. [2018-11-14 16:53:17,185 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-14 16:53:17,185 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-14 16:53:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:17,188 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-11-14 16:53:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-11-14 16:53:17,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:17,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:17,188 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-14 16:53:17,189 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-14 16:53:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:17,191 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-11-14 16:53:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-11-14 16:53:17,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:17,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:17,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:17,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 16:53:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-11-14 16:53:17,194 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 117 [2018-11-14 16:53:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:17,195 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-11-14 16:53:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:53:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-11-14 16:53:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-14 16:53:17,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:17,196 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:17,197 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:17,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1687387784, now seen corresponding path program 17 times [2018-11-14 16:53:17,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:17,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:17,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:17,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:17,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:17,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {11746#true} call ULTIMATE.init(); {11746#true} is VALID [2018-11-14 16:53:17,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {11746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11746#true} is VALID [2018-11-14 16:53:17,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {11746#true} assume true; {11746#true} is VALID [2018-11-14 16:53:17,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11746#true} {11746#true} #78#return; {11746#true} is VALID [2018-11-14 16:53:17,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {11746#true} call #t~ret2 := main(); {11746#true} is VALID [2018-11-14 16:53:17,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {11746#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11748#(= main_~i~0 0)} is VALID [2018-11-14 16:53:17,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {11748#(= main_~i~0 0)} assume true; {11748#(= main_~i~0 0)} is VALID [2018-11-14 16:53:18,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {11748#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11749#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:18,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {11749#(<= main_~i~0 1)} assume true; {11749#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:18,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {11749#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11750#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:18,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {11750#(<= main_~i~0 2)} assume true; {11750#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:18,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {11750#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11751#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:18,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {11751#(<= main_~i~0 3)} assume true; {11751#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:18,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {11751#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11752#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:18,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {11752#(<= main_~i~0 4)} assume true; {11752#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:18,018 INFO L273 TraceCheckUtils]: 15: Hoare triple {11752#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11753#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:18,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {11753#(<= main_~i~0 5)} assume true; {11753#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:18,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {11753#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11754#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:18,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {11754#(<= main_~i~0 6)} assume true; {11754#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:18,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {11754#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11755#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:18,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {11755#(<= main_~i~0 7)} assume true; {11755#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:18,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {11755#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11756#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:18,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {11756#(<= main_~i~0 8)} assume true; {11756#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:18,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {11756#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11757#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:18,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {11757#(<= main_~i~0 9)} assume true; {11757#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:18,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {11757#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11758#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:18,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {11758#(<= main_~i~0 10)} assume true; {11758#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:18,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {11758#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11759#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:18,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {11759#(<= main_~i~0 11)} assume true; {11759#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:18,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {11759#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11760#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:18,027 INFO L273 TraceCheckUtils]: 30: Hoare triple {11760#(<= main_~i~0 12)} assume true; {11760#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:18,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {11760#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11761#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:18,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {11761#(<= main_~i~0 13)} assume true; {11761#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:18,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {11761#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11762#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:18,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {11762#(<= main_~i~0 14)} assume true; {11762#(<= main_~i~0 14)} is VALID [2018-11-14 16:53:18,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {11762#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11763#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:18,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {11763#(<= main_~i~0 15)} assume true; {11763#(<= main_~i~0 15)} is VALID [2018-11-14 16:53:18,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {11763#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11764#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:18,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {11764#(<= main_~i~0 16)} assume true; {11764#(<= main_~i~0 16)} is VALID [2018-11-14 16:53:18,034 INFO L273 TraceCheckUtils]: 39: Hoare triple {11764#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11765#(<= main_~i~0 17)} is VALID [2018-11-14 16:53:18,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {11765#(<= main_~i~0 17)} assume true; {11765#(<= main_~i~0 17)} is VALID [2018-11-14 16:53:18,035 INFO L273 TraceCheckUtils]: 41: Hoare triple {11765#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11747#false} is VALID [2018-11-14 16:53:18,035 INFO L273 TraceCheckUtils]: 42: Hoare triple {11747#false} ~i~0 := 0; {11747#false} is VALID [2018-11-14 16:53:18,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,036 INFO L273 TraceCheckUtils]: 44: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,037 INFO L273 TraceCheckUtils]: 52: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 54: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 55: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 56: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 57: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 58: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,038 INFO L273 TraceCheckUtils]: 59: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 60: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 61: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 62: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 63: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 64: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 66: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 67: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,039 INFO L273 TraceCheckUtils]: 68: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 69: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 70: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 71: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 72: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 74: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 75: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {11747#false} assume !(~i~0 < 100000); {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {11747#false} ~i~0 := 0; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 80: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 81: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 82: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 83: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 84: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,041 INFO L273 TraceCheckUtils]: 85: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 86: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 87: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 90: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 92: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 93: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,042 INFO L273 TraceCheckUtils]: 94: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 95: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 96: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 97: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 98: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 99: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 101: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 102: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,043 INFO L273 TraceCheckUtils]: 103: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 104: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 105: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 106: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 108: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 109: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,044 INFO L273 TraceCheckUtils]: 111: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 112: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 113: Hoare triple {11747#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 114: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 115: Hoare triple {11747#false} assume !(~i~0 < 100000); {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 116: Hoare triple {11747#false} havoc ~x~0;~x~0 := 0; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 117: Hoare triple {11747#false} assume true; {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 118: Hoare triple {11747#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L256 TraceCheckUtils]: 119: Hoare triple {11747#false} call __VERIFIER_assert((if #t~mem1 == 43 then 1 else 0)); {11747#false} is VALID [2018-11-14 16:53:18,045 INFO L273 TraceCheckUtils]: 120: Hoare triple {11747#false} ~cond := #in~cond; {11747#false} is VALID [2018-11-14 16:53:18,046 INFO L273 TraceCheckUtils]: 121: Hoare triple {11747#false} assume ~cond == 0; {11747#false} is VALID [2018-11-14 16:53:18,046 INFO L273 TraceCheckUtils]: 122: Hoare triple {11747#false} assume !false; {11747#false} is VALID [2018-11-14 16:53:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-14 16:53:18,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:18,053 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-14 16:53:18,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1