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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:39:39,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:39:39,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:39:39,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:39:39,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:39:39,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:39:39,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:39:39,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:39:39,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:39:39,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:39:39,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:39:39,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:39:39,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:39:39,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:39:39,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:39:39,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:39:39,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:39:39,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:39:39,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:39:39,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:39:39,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:39:39,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:39:39,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:39:39,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:39:39,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:39:39,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:39:39,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:39:39,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:39:39,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:39:39,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:39:39,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:39:39,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:39:39,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:39:39,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:39:39,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:39:39,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:39:39,526 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:39:39,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:39:39,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:39:39,550 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:39:39,551 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:39:39,551 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:39:39,551 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:39:39,552 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:39:39,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:39:39,552 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:39:39,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:39:39,552 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:39:39,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:39:39,553 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:39:39,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:39:39,553 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:39:39,553 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:39:39,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:39:39,554 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:39:39,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:39:39,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:39:39,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:39:39,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:39:39,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:39:39,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:39:39,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:39:39,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:39:39,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:39:39,556 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:39:39,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:39:39,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:39:39,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:39:39,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:39:39,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:39:39,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:39:39,617 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:39:39,618 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:39:39,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-14 18:39:39,679 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92dd4607c/e0344927a42b4ea8875f38f27e9e9a7e/FLAG6d692cf81 [2018-11-14 18:39:40,180 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:39:40,180 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-14 18:39:40,186 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92dd4607c/e0344927a42b4ea8875f38f27e9e9a7e/FLAG6d692cf81 [2018-11-14 18:39:40,201 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92dd4607c/e0344927a42b4ea8875f38f27e9e9a7e [2018-11-14 18:39:40,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:39:40,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:39:40,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:40,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:39:40,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:39:40,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc1479d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40, skipping insertion in model container [2018-11-14 18:39:40,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:39:40,256 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:39:40,496 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:40,501 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:39:40,530 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:40,561 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:39:40,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40 WrapperNode [2018-11-14 18:39:40,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:40,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:39:40,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:39:40,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:39:40,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... [2018-11-14 18:39:40,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:39:40,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:39:40,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:39:40,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:39:40,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:39:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:39:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:39:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:39:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:39:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:39:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:39:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:39:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:39:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:39:41,301 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:39:41,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:39:41 BoogieIcfgContainer [2018-11-14 18:39:41,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:39:41,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:39:41,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:39:41,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:39:41,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:39:40" (1/3) ... [2018-11-14 18:39:41,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79886603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:39:41, skipping insertion in model container [2018-11-14 18:39:41,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:40" (2/3) ... [2018-11-14 18:39:41,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79886603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:39:41, skipping insertion in model container [2018-11-14 18:39:41,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:39:41" (3/3) ... [2018-11-14 18:39:41,310 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_false-unreach-call_ground.i [2018-11-14 18:39:41,320 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:39:41,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:39:41,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:39:41,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:39:41,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:39:41,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:39:41,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:39:41,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:39:41,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:39:41,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:39:41,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:39:41,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:39:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-14 18:39:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:39:41,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:41,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:41,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:41,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash 339384385, now seen corresponding path program 1 times [2018-11-14 18:39:41,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:41,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-14 18:39:41,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-14 18:39:41,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-14 18:39:41,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #64#return; {31#true} is VALID [2018-11-14 18:39:41,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-14 18:39:41,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {31#true} is VALID [2018-11-14 18:39:41,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-14 18:39:41,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2018-11-14 18:39:41,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2018-11-14 18:39:41,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} havoc ~x~0;~x~0 := 0; {32#false} is VALID [2018-11-14 18:39:41,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-14 18:39:41,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {32#false} is VALID [2018-11-14 18:39:41,605 INFO L256 TraceCheckUtils]: 12: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {32#false} is VALID [2018-11-14 18:39:41,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-14 18:39:41,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} assume ~cond == 0; {32#false} is VALID [2018-11-14 18:39:41,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-14 18:39:41,610 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 18:39:41,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:39:41,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:39:41,619 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:39:41,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:41,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:39:41,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:41,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:39:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:39:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:39:41,710 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-14 18:39:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:41,902 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-14 18:39:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:39:41,902 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:39:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:39:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-14 18:39:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:39:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-14 18:39:41,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 59 transitions. [2018-11-14 18:39:42,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:42,210 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:39:42,210 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 18:39:42,216 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 18:39:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 18:39:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 18:39:42,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:42,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 18:39:42,260 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 18:39:42,260 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 18:39:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:42,265 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 18:39:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:39:42,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:42,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:42,266 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 18:39:42,266 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 18:39:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:42,270 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 18:39:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:39:42,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:42,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:42,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:42,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:39:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-14 18:39:42,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-14 18:39:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:42,276 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-14 18:39:42,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:39:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:39:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:39:42,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:42,278 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 18:39:42,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:42,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash -665726485, now seen corresponding path program 1 times [2018-11-14 18:39:42,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:42,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:42,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:42,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:42,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:42,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-14 18:39:42,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {174#true} is VALID [2018-11-14 18:39:42,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-14 18:39:42,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #64#return; {174#true} is VALID [2018-11-14 18:39:42,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret2 := main(); {174#true} is VALID [2018-11-14 18:39:42,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {174#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {176#(= main_~i~0 0)} is VALID [2018-11-14 18:39:42,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#(= main_~i~0 0)} assume true; {176#(= main_~i~0 0)} is VALID [2018-11-14 18:39:42,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#(= main_~i~0 0)} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-14 18:39:42,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {175#false} ~i~0 := 0; {175#false} is VALID [2018-11-14 18:39:42,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-14 18:39:42,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {175#false} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-14 18:39:42,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {175#false} havoc ~x~0;~x~0 := 0; {175#false} is VALID [2018-11-14 18:39:42,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-14 18:39:42,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {175#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {175#false} is VALID [2018-11-14 18:39:42,487 INFO L256 TraceCheckUtils]: 14: Hoare triple {175#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {175#false} is VALID [2018-11-14 18:39:42,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2018-11-14 18:39:42,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {175#false} assume ~cond == 0; {175#false} is VALID [2018-11-14 18:39:42,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-14 18:39:42,490 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 18:39:42,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:39:42,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:39:42,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:39:42,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:42,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:39:42,547 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 18:39:42,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:39:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:39:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:39:42,548 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-14 18:39:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:42,714 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 18:39:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:39:42,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:39:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 18:39:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 18:39:42,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-14 18:39:43,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:43,041 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:39:43,041 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:39:43,042 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 18:39:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:39:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:39:43,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:43,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:39:43,157 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:39:43,157 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:39:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,160 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 18:39:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 18:39:43,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:43,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:43,161 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:39:43,161 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:39:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,163 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 18:39:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 18:39:43,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:43,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:43,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:43,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:39:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 18:39:43,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-14 18:39:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:43,168 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 18:39:43,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:39:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 18:39:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:39:43,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:43,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:43,169 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1817372075, now seen corresponding path program 1 times [2018-11-14 18:39:43,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:43,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:43,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-14 18:39:43,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-14 18:39:43,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-14 18:39:43,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-14 18:39:43,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-14 18:39:43,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {328#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {330#(= main_~i~0 0)} is VALID [2018-11-14 18:39:43,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(= main_~i~0 0)} assume true; {330#(= main_~i~0 0)} is VALID [2018-11-14 18:39:43,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#(= 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; {331#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:43,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:43,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-14 18:39:43,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-14 18:39:43,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {329#false} is VALID [2018-11-14 18:39:43,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-14 18:39:43,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-14 18:39:43,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {329#false} is VALID [2018-11-14 18:39:43,290 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {329#false} is VALID [2018-11-14 18:39:43,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-14 18:39:43,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume ~cond == 0; {329#false} is VALID [2018-11-14 18:39:43,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-14 18:39:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:39:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:43,293 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 18:39:43,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:43,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:43,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-14 18:39:43,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-14 18:39:43,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-14 18:39:43,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-14 18:39:43,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-14 18:39:43,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {328#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {350#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:43,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {350#(<= main_~i~0 0)} assume true; {350#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:43,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(<= 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; {331#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:43,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:43,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-14 18:39:43,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-14 18:39:43,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {329#false} is VALID [2018-11-14 18:39:43,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-14 18:39:43,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-14 18:39:43,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-14 18:39:43,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {329#false} is VALID [2018-11-14 18:39:43,473 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {329#false} is VALID [2018-11-14 18:39:43,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-14 18:39:43,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume ~cond == 0; {329#false} is VALID [2018-11-14 18:39:43,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-14 18:39:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:39:43,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:43,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:39:43,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:39:43,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:43,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:39:43,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:43,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:39:43,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:39:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:39:43,625 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-11-14 18:39:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,993 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:39:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:39:43,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:39:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:39:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:39:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:39:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:39:44,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-14 18:39:44,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:44,085 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:39:44,085 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:39:44,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 18:39:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:39:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 18:39:44,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:44,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 18:39:44,143 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:39:44,143 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:39:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:44,146 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 18:39:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:39:44,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:44,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:44,147 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:39:44,147 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:39:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:44,149 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 18:39:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:39:44,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:44,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:44,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:44,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:39:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-14 18:39:44,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-14 18:39:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:44,153 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-14 18:39:44,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:39:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:39:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:39:44,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:44,155 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:44,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:44,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1737156203, now seen corresponding path program 2 times [2018-11-14 18:39:44,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:44,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-14 18:39:44,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-14 18:39:44,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-14 18:39:44,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-14 18:39:44,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-14 18:39:44,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {572#(= main_~i~0 0)} is VALID [2018-11-14 18:39:44,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(= main_~i~0 0)} assume true; {572#(= main_~i~0 0)} is VALID [2018-11-14 18:39:44,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {572#(= 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; {573#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {573#(<= 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; {574#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:44,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:44,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-14 18:39:44,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-14 18:39:44,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {571#false} is VALID [2018-11-14 18:39:44,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {571#false} is VALID [2018-11-14 18:39:44,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-14 18:39:44,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-14 18:39:44,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {571#false} is VALID [2018-11-14 18:39:44,391 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {571#false} is VALID [2018-11-14 18:39:44,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-14 18:39:44,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume ~cond == 0; {571#false} is VALID [2018-11-14 18:39:44,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-14 18:39:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 18:39:44,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:44,393 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 18:39:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:39:44,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:39:44,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:44,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:44,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-14 18:39:44,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-14 18:39:44,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-14 18:39:44,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-14 18:39:44,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-14 18:39:44,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {593#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:44,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {593#(<= main_~i~0 0)} assume true; {593#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:44,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {593#(<= 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; {573#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {573#(<= 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; {574#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:44,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:44,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-14 18:39:44,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-14 18:39:44,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {571#false} is VALID [2018-11-14 18:39:44,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {571#false} is VALID [2018-11-14 18:39:44,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-14 18:39:44,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-14 18:39:44,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-14 18:39:44,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {571#false} is VALID [2018-11-14 18:39:44,654 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {571#false} is VALID [2018-11-14 18:39:44,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-14 18:39:44,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume ~cond == 0; {571#false} is VALID [2018-11-14 18:39:44,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-14 18:39:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 18:39:44,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:44,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:39:44,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:39:44,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:44,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:39:44,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:44,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:39:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:39:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:39:44,724 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2018-11-14 18:39:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:44,905 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 18:39:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:39:44,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:39:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:39:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-14 18:39:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:39:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-14 18:39:44,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-14 18:39:44,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:44,992 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:39:44,992 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 18:39:44,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:39:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 18:39:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 18:39:45,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:45,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 18:39:45,018 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:39:45,018 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:39:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,022 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-14 18:39:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 18:39:45,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:45,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:45,023 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:39:45,023 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:39:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,025 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-14 18:39:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 18:39:45,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:45,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:45,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:45,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:39:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-14 18:39:45,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2018-11-14 18:39:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:45,031 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-14 18:39:45,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:39:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 18:39:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:39:45,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:45,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:45,035 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:45,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1942219733, now seen corresponding path program 3 times [2018-11-14 18:39:45,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:45,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:45,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:45,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-14 18:39:45,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-14 18:39:45,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-14 18:39:45,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-14 18:39:45,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {848#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {850#(= main_~i~0 0)} is VALID [2018-11-14 18:39:45,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(= main_~i~0 0)} assume true; {850#(= main_~i~0 0)} is VALID [2018-11-14 18:39:45,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {850#(= 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; {851#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:45,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:45,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {851#(<= 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; {852#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:45,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:45,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {852#(<= 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; {853#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:45,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:45,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-14 18:39:45,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {849#false} ~i~0 := 0; {849#false} is VALID [2018-11-14 18:39:45,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {849#false} is VALID [2018-11-14 18:39:45,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {849#false} is VALID [2018-11-14 18:39:45,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {849#false} is VALID [2018-11-14 18:39:45,188 INFO L273 TraceCheckUtils]: 21: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {849#false} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-14 18:39:45,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-14 18:39:45,188 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {849#false} is VALID [2018-11-14 18:39:45,189 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {849#false} is VALID [2018-11-14 18:39:45,189 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-14 18:39:45,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume ~cond == 0; {849#false} is VALID [2018-11-14 18:39:45,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-14 18:39:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:39:45,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:45,191 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 18:39:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:39:45,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:39:45,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:45,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:45,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-14 18:39:45,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-14 18:39:45,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-14 18:39:45,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-14 18:39:45,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {848#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {848#true} is VALID [2018-11-14 18:39:45,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {848#true} is VALID [2018-11-14 18:39:45,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {848#true} is VALID [2018-11-14 18:39:45,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {848#true} is VALID [2018-11-14 18:39:45,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-14 18:39:45,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {848#true} assume !(~i~0 < 100000); {848#true} is VALID [2018-11-14 18:39:45,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {848#true} ~i~0 := 0; {899#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:45,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#(<= main_~i~0 0)} assume true; {899#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:45,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#(<= 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; {851#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:45,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:45,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {851#(<= 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; {852#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:45,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:45,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {852#(<= 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; {853#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:45,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:45,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-14 18:39:45,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-14 18:39:45,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-14 18:39:45,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {849#false} is VALID [2018-11-14 18:39:45,409 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {849#false} is VALID [2018-11-14 18:39:45,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-14 18:39:45,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume ~cond == 0; {849#false} is VALID [2018-11-14 18:39:45,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-14 18:39:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:39:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:39:45,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-14 18:39:45,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:45,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:39:45,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:45,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:39:45,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:39:45,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:39:45,479 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-14 18:39:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,659 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-14 18:39:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:39:45,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-14 18:39:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:39:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-14 18:39:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:39:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-14 18:39:45,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2018-11-14 18:39:45,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:45,863 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:39:45,863 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:39:45,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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 18:39:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:39:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 18:39:45,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:45,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 18:39:45,891 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 18:39:45,891 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 18:39:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,893 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 18:39:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 18:39:45,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:45,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:45,894 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 18:39:45,895 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 18:39:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,897 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 18:39:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 18:39:45,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:45,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:45,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:45,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:39:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-14 18:39:45,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 30 [2018-11-14 18:39:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:45,901 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-14 18:39:45,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:39:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 18:39:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:39:45,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:45,903 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:45,903 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:45,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash -732385557, now seen corresponding path program 4 times [2018-11-14 18:39:45,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:45,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:45,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:46,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-14 18:39:46,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-14 18:39:46,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-14 18:39:46,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-14 18:39:46,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-14 18:39:46,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1164#(= main_~i~0 0)} is VALID [2018-11-14 18:39:46,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {1164#(= main_~i~0 0)} assume true; {1164#(= main_~i~0 0)} is VALID [2018-11-14 18:39:46,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {1164#(= 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; {1165#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(<= 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; {1166#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(<= 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; {1167#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:46,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:46,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#(<= 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; {1168#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:46,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:46,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-14 18:39:46,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-14 18:39:46,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-14 18:39:46,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-14 18:39:46,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1163#false} is VALID [2018-11-14 18:39:46,108 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1163#false} is VALID [2018-11-14 18:39:46,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-14 18:39:46,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume ~cond == 0; {1163#false} is VALID [2018-11-14 18:39:46,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-14 18:39:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:39:46,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:46,111 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 18:39:46,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:39:46,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:39:46,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:46,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:46,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-14 18:39:46,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-14 18:39:46,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-14 18:39:46,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-14 18:39:46,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-14 18:39:46,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1187#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:46,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {1187#(<= main_~i~0 0)} assume true; {1187#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:46,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {1187#(<= 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; {1165#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(<= 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; {1166#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(<= 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; {1167#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:46,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:46,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#(<= 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; {1168#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:46,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:46,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-14 18:39:46,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-14 18:39:46,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1163#false} is VALID [2018-11-14 18:39:46,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-14 18:39:46,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-14 18:39:46,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-14 18:39:46,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1163#false} is VALID [2018-11-14 18:39:46,382 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1163#false} is VALID [2018-11-14 18:39:46,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-14 18:39:46,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume ~cond == 0; {1163#false} is VALID [2018-11-14 18:39:46,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-14 18:39:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:39:46,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:46,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:39:46,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-14 18:39:46,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:46,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:39:46,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:46,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:39:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:39:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:39:46,456 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 8 states. [2018-11-14 18:39:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:46,629 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-14 18:39:46,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:39:46,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-14 18:39:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:39:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 18:39:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:39:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 18:39:46,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-14 18:39:46,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:46,750 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:39:46,751 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 18:39:46,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:39:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 18:39:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 18:39:46,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:46,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 18:39:46,842 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:39:46,842 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:39:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:46,844 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-14 18:39:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-14 18:39:46,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:46,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:46,844 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 18:39:46,845 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 18:39:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:46,847 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-14 18:39:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-14 18:39:46,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:46,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:46,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:46,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 18:39:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-14 18:39:46,851 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-11-14 18:39:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:46,852 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-14 18:39:46,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:39:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-14 18:39:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:39:46,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:46,853 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:46,853 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:46,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1518143829, now seen corresponding path program 5 times [2018-11-14 18:39:46,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:46,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:46,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:47,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-14 18:39:47,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-14 18:39:47,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-14 18:39:47,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-14 18:39:47,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {1512#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1514#(= main_~i~0 0)} is VALID [2018-11-14 18:39:47,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {1514#(= main_~i~0 0)} assume true; {1514#(= main_~i~0 0)} is VALID [2018-11-14 18:39:47,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {1514#(= 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; {1515#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:47,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:47,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {1515#(<= 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; {1516#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:47,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:47,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1516#(<= 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; {1517#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:47,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:47,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {1517#(<= 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; {1518#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:47,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:47,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {1518#(<= 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; {1519#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:47,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:47,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-14 18:39:47,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {1513#false} ~i~0 := 0; {1513#false} is VALID [2018-11-14 18:39:47,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1513#false} is VALID [2018-11-14 18:39:47,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1513#false} is VALID [2018-11-14 18:39:47,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1513#false} is VALID [2018-11-14 18:39:47,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1513#false} is VALID [2018-11-14 18:39:47,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1513#false} is VALID [2018-11-14 18:39:47,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {1513#false} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-14 18:39:47,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-14 18:39:47,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1513#false} is VALID [2018-11-14 18:39:47,175 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1513#false} is VALID [2018-11-14 18:39:47,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-14 18:39:47,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume ~cond == 0; {1513#false} is VALID [2018-11-14 18:39:47,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-14 18:39:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:39:47,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:47,178 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 18:39:47,188 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:39:47,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:39:47,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:47,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:47,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-14 18:39:47,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-14 18:39:47,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-14 18:39:47,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-14 18:39:47,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1512#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1512#true} is VALID [2018-11-14 18:39:47,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1512#true} is VALID [2018-11-14 18:39:47,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1512#true} is VALID [2018-11-14 18:39:47,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1512#true} is VALID [2018-11-14 18:39:47,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1512#true} is VALID [2018-11-14 18:39:47,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1512#true} is VALID [2018-11-14 18:39:47,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-14 18:39:47,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#true} assume !(~i~0 < 100000); {1512#true} is VALID [2018-11-14 18:39:47,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#true} ~i~0 := 0; {1577#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:47,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {1577#(<= main_~i~0 0)} assume true; {1577#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:47,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {1577#(<= 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; {1515#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:47,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:47,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {1515#(<= 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; {1516#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:47,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:47,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {1516#(<= 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; {1517#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:47,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:47,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {1517#(<= 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; {1518#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:47,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:47,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {1518#(<= 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; {1519#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:47,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:47,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-14 18:39:47,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-14 18:39:47,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-14 18:39:47,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1513#false} is VALID [2018-11-14 18:39:47,407 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1513#false} is VALID [2018-11-14 18:39:47,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-14 18:39:47,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume ~cond == 0; {1513#false} is VALID [2018-11-14 18:39:47,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-14 18:39:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:39:47,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:47,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:39:47,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-14 18:39:47,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:47,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:39:47,494 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 18:39:47,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:39:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:39:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:39:47,495 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2018-11-14 18:39:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:47,702 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-14 18:39:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:39:47,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-14 18:39:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:39:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-14 18:39:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:39:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-14 18:39:47,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-14 18:39:47,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:47,787 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:39:47,787 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:39:47,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:39:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:39:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 18:39:47,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:47,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 18:39:47,814 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:39:47,815 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:39:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:47,817 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-14 18:39:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:39:47,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:47,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:47,817 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:39:47,818 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:39:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:47,820 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-14 18:39:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:39:47,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:47,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:47,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:47,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:39:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-14 18:39:47,823 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-11-14 18:39:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:47,823 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-14 18:39:47,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:39:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:39:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:39:47,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:47,825 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:47,825 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:47,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash 84749163, now seen corresponding path program 6 times [2018-11-14 18:39:47,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:47,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:48,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-14 18:39:48,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-14 18:39:48,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-14 18:39:48,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-14 18:39:48,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1900#(= main_~i~0 0)} is VALID [2018-11-14 18:39:48,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(= main_~i~0 0)} assume true; {1900#(= main_~i~0 0)} is VALID [2018-11-14 18:39:48,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {1900#(= 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; {1901#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:48,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:48,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {1901#(<= 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; {1902#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:48,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:48,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {1902#(<= 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; {1903#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:48,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:48,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {1903#(<= 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; {1904#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:48,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:48,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {1904#(<= 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; {1905#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:48,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:48,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {1905#(<= 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; {1906#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:48,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:48,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-14 18:39:48,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#false} ~i~0 := 0; {1899#false} is VALID [2018-11-14 18:39:48,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1899#false} is VALID [2018-11-14 18:39:48,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#false} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-14 18:39:48,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-14 18:39:48,031 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1899#false} is VALID [2018-11-14 18:39:48,032 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1899#false} is VALID [2018-11-14 18:39:48,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-14 18:39:48,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume ~cond == 0; {1899#false} is VALID [2018-11-14 18:39:48,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-14 18:39:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-14 18:39:48,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:48,035 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 18:39:48,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:39:48,093 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:39:48,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:48,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:48,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-14 18:39:48,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-14 18:39:48,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-14 18:39:48,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-14 18:39:48,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1898#true} is VALID [2018-11-14 18:39:48,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1898#true} is VALID [2018-11-14 18:39:48,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1898#true} is VALID [2018-11-14 18:39:48,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1898#true} is VALID [2018-11-14 18:39:48,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1898#true} is VALID [2018-11-14 18:39:48,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1898#true} is VALID [2018-11-14 18:39:48,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 18:39:48,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1961#(<= main_~i~0 100000)} is VALID [2018-11-14 18:39:48,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {1961#(<= main_~i~0 100000)} assume true; {1961#(<= main_~i~0 100000)} is VALID [2018-11-14 18:39:48,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {1961#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {1898#true} is VALID [2018-11-14 18:39:48,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {1898#true} ~i~0 := 0; {1971#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:48,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {1971#(<= main_~i~0 0)} assume true; {1971#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:48,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {1971#(<= 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; {1901#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:48,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:48,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {1901#(<= 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; {1902#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:48,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:48,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {1902#(<= 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; {1903#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:48,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:48,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {1903#(<= 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; {1904#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:48,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:48,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {1904#(<= 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; {1905#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:48,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:48,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {1905#(<= 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; {1906#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:48,373 INFO L273 TraceCheckUtils]: 33: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:48,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-14 18:39:48,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-14 18:39:48,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-14 18:39:48,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1899#false} is VALID [2018-11-14 18:39:48,375 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1899#false} is VALID [2018-11-14 18:39:48,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-14 18:39:48,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume ~cond == 0; {1899#false} is VALID [2018-11-14 18:39:48,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-14 18:39:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:39:48,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:48,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-14 18:39:48,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-14 18:39:48,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:48,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:39:48,453 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 18:39:48,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:39:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:39:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:39:48,455 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 11 states. [2018-11-14 18:39:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:48,869 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-14 18:39:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:39:48,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-14 18:39:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:39:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-14 18:39:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:39:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-14 18:39:48,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2018-11-14 18:39:49,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:49,034 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:39:49,034 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:39:49,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:39:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:39:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-14 18:39:49,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:49,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-14 18:39:49,072 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 18:39:49,072 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 18:39:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:49,075 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-14 18:39:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-14 18:39:49,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:49,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:49,076 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 18:39:49,076 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 18:39:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:49,078 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-14 18:39:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-14 18:39:49,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:49,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:49,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:49,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 18:39:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-14 18:39:49,081 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 42 [2018-11-14 18:39:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:49,081 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-14 18:39:49,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:39:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-14 18:39:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:39:49,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:49,083 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:49,083 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:49,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -872837845, now seen corresponding path program 7 times [2018-11-14 18:39:49,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:49,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:49,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:49,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:49,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:49,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-14 18:39:49,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-14 18:39:49,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-14 18:39:49,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-14 18:39:49,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-14 18:39:49,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {2321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2323#(= main_~i~0 0)} is VALID [2018-11-14 18:39:49,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(= main_~i~0 0)} assume true; {2323#(= main_~i~0 0)} is VALID [2018-11-14 18:39:49,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {2323#(= 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; {2324#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:49,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:49,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {2324#(<= 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; {2325#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:49,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:49,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(<= 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; {2326#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:49,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:49,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(<= 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; {2327#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:49,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:49,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {2327#(<= 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; {2328#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:49,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:49,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {2328#(<= 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; {2329#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:49,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:49,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#(<= 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; {2330#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:49,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:49,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-14 18:39:49,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-14 18:39:49,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume ~cond == 0; {2322#false} is VALID [2018-11-14 18:39:49,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-14 18:39:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:39:49,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:49,316 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 18:39:49,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:49,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:49,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-14 18:39:49,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-14 18:39:49,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-14 18:39:49,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-14 18:39:49,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-14 18:39:49,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {2321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2349#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:49,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {2349#(<= main_~i~0 0)} assume true; {2349#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:49,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {2349#(<= 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; {2324#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:49,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:49,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {2324#(<= 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; {2325#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:49,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:49,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(<= 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; {2326#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:49,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:49,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(<= 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; {2327#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:49,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:49,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {2327#(<= 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; {2328#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:49,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:49,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {2328#(<= 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; {2329#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:49,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:49,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#(<= 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; {2330#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:49,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:49,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-14 18:39:49,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-14 18:39:49,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume ~cond == 0; {2322#false} is VALID [2018-11-14 18:39:49,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-14 18:39:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:39:49,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:49,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:39:49,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-14 18:39:49,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:49,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:39:49,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:49,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:39:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:39:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:39:49,703 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 11 states. [2018-11-14 18:39:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:50,026 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 18:39:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:39:50,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-14 18:39:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:39:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-14 18:39:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:39:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-14 18:39:50,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2018-11-14 18:39:50,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:50,128 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:39:50,129 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 18:39:50,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 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 18:39:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 18:39:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-14 18:39:50,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:50,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-14 18:39:50,159 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 18:39:50,159 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 18:39:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:50,162 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-14 18:39:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 18:39:50,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:50,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:50,163 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 18:39:50,163 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 18:39:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:50,165 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-14 18:39:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 18:39:50,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:50,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:50,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:50,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 18:39:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-14 18:39:50,167 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 46 [2018-11-14 18:39:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:50,167 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-14 18:39:50,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:39:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 18:39:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 18:39:50,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:50,168 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:50,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:50,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash -621126677, now seen corresponding path program 8 times [2018-11-14 18:39:50,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:50,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:50,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:50,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-14 18:39:50,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-14 18:39:50,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-14 18:39:50,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-14 18:39:50,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-14 18:39:50,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2781#(= main_~i~0 0)} is VALID [2018-11-14 18:39:50,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {2781#(= main_~i~0 0)} assume true; {2781#(= main_~i~0 0)} is VALID [2018-11-14 18:39:50,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {2781#(= 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; {2782#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:50,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:50,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:50,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:50,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {2783#(<= 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; {2784#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:50,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:50,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {2784#(<= 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; {2785#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:50,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:50,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {2785#(<= 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; {2786#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:50,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:50,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= 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; {2787#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:50,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:50,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= 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; {2788#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:50,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:50,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(<= 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; {2789#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:50,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:50,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-14 18:39:50,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-14 18:39:50,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2780#false} is VALID [2018-11-14 18:39:50,395 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2780#false} is VALID [2018-11-14 18:39:50,395 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-14 18:39:50,395 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume ~cond == 0; {2780#false} is VALID [2018-11-14 18:39:50,395 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-14 18:39:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:39:50,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:50,397 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 18:39:50,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:39:50,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:39:50,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:50,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:50,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-14 18:39:50,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-14 18:39:50,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-14 18:39:50,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-14 18:39:50,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-14 18:39:50,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2808#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:50,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {2808#(<= main_~i~0 0)} assume true; {2808#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:50,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {2808#(<= 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; {2782#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:50,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:50,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:50,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:50,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {2783#(<= 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; {2784#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:50,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:50,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {2784#(<= 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; {2785#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:50,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:50,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {2785#(<= 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; {2786#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:50,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:50,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= 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; {2787#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:50,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:50,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= 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; {2788#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:50,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:50,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(<= 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; {2789#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:50,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:50,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-14 18:39:50,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-14 18:39:50,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,880 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume ~cond == 0; {2780#false} is VALID [2018-11-14 18:39:50,882 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-14 18:39:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:39:50,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:50,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:39:50,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-14 18:39:50,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:50,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:39:50,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:50,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:39:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:39:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:39:50,940 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-11-14 18:39:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:51,742 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-11-14 18:39:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:39:51,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-14 18:39:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:39:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-14 18:39:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:39:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-14 18:39:51,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 79 transitions. [2018-11-14 18:39:51,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:51,816 INFO L225 Difference]: With dead ends: 90 [2018-11-14 18:39:51,816 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:39:51,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 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 18:39:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:39:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-14 18:39:51,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:51,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-14 18:39:51,857 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:39:51,857 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:39:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:51,860 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 18:39:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:39:51,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:51,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:51,861 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:39:51,861 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:39:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:51,862 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 18:39:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:39:51,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:51,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:51,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:51,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:39:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-14 18:39:51,864 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 50 [2018-11-14 18:39:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-14 18:39:51,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:39:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:39:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:39:51,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:51,865 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:51,866 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:51,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1316083627, now seen corresponding path program 9 times [2018-11-14 18:39:51,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:51,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:51,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:52,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-14 18:39:52,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-14 18:39:52,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-14 18:39:52,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-14 18:39:52,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {3273#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3275#(= main_~i~0 0)} is VALID [2018-11-14 18:39:52,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {3275#(= main_~i~0 0)} assume true; {3275#(= main_~i~0 0)} is VALID [2018-11-14 18:39:52,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {3275#(= 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; {3276#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:52,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:52,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {3276#(<= 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; {3277#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:52,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:52,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {3277#(<= 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; {3278#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:52,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:52,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3278#(<= 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; {3279#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:52,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:52,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {3279#(<= 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; {3280#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:52,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:52,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {3280#(<= 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; {3281#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:52,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:52,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {3281#(<= 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; {3282#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:52,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:52,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {3282#(<= 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; {3283#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:52,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:52,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {3283#(<= 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; {3284#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:52,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:52,163 INFO L273 TraceCheckUtils]: 25: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-14 18:39:52,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {3274#false} ~i~0 := 0; {3274#false} is VALID [2018-11-14 18:39:52,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,166 INFO L273 TraceCheckUtils]: 34: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#false} is VALID [2018-11-14 18:39:52,168 INFO L273 TraceCheckUtils]: 45: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {3274#false} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-14 18:39:52,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-14 18:39:52,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,169 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3274#false} is VALID [2018-11-14 18:39:52,169 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3274#false} is VALID [2018-11-14 18:39:52,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-14 18:39:52,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume ~cond == 0; {3274#false} is VALID [2018-11-14 18:39:52,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-14 18:39:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 18:39:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:52,172 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 18:39:52,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:39:52,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:39:52,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:52,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:52,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-14 18:39:52,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-14 18:39:52,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {3273#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-14 18:39:52,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {3273#true} assume !(~i~0 < 100000); {3273#true} is VALID [2018-11-14 18:39:52,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {3273#true} ~i~0 := 0; {3366#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:52,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {3366#(<= main_~i~0 0)} assume true; {3366#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:52,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {3366#(<= 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; {3276#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:52,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:52,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#(<= 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; {3277#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:52,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:52,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {3277#(<= 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; {3278#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:52,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:52,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {3278#(<= 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; {3279#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:52,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:52,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {3279#(<= 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; {3280#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:52,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:52,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {3280#(<= 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; {3281#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:52,706 INFO L273 TraceCheckUtils]: 39: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:52,707 INFO L273 TraceCheckUtils]: 40: Hoare triple {3281#(<= 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; {3282#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:52,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:52,708 INFO L273 TraceCheckUtils]: 42: Hoare triple {3282#(<= 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; {3283#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:52,709 INFO L273 TraceCheckUtils]: 43: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:52,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {3283#(<= 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; {3284#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:52,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:52,711 INFO L273 TraceCheckUtils]: 46: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-14 18:39:52,711 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-14 18:39:52,711 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-14 18:39:52,711 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3274#false} is VALID [2018-11-14 18:39:52,712 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3274#false} is VALID [2018-11-14 18:39:52,712 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-14 18:39:52,712 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume ~cond == 0; {3274#false} is VALID [2018-11-14 18:39:52,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-14 18:39:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 18:39:52,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:52,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:39:52,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-14 18:39:52,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:52,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:39:52,799 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 18:39:52,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:39:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:39:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:39:52,801 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-11-14 18:39:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:53,029 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-14 18:39:53,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:39:53,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-14 18:39:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:39:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-14 18:39:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:39:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-14 18:39:53,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 83 transitions. [2018-11-14 18:39:53,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:53,107 INFO L225 Difference]: With dead ends: 96 [2018-11-14 18:39:53,107 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:39:53,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 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 18:39:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:39:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-14 18:39:53,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:53,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-14 18:39:53,136 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-14 18:39:53,136 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-14 18:39:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:53,137 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-14 18:39:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 18:39:53,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:53,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:53,138 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-14 18:39:53,138 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-14 18:39:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:53,139 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-14 18:39:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 18:39:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:53,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:53,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 18:39:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-14 18:39:53,141 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 54 [2018-11-14 18:39:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:53,142 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-14 18:39:53,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:39:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 18:39:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:39:53,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:53,143 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:53,143 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:53,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1301135253, now seen corresponding path program 10 times [2018-11-14 18:39:53,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:53,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:53,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:53,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:53,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:53,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-14 18:39:53,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-14 18:39:53,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-14 18:39:53,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-14 18:39:53,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-14 18:39:53,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {3803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3805#(= main_~i~0 0)} is VALID [2018-11-14 18:39:53,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {3805#(= main_~i~0 0)} assume true; {3805#(= main_~i~0 0)} is VALID [2018-11-14 18:39:53,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {3805#(= 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; {3806#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:53,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:53,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {3806#(<= 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; {3807#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:53,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:53,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {3807#(<= 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; {3808#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:53,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:53,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {3808#(<= 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; {3809#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:53,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:53,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#(<= 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; {3810#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:53,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:53,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#(<= 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; {3811#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:53,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:53,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {3811#(<= 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; {3812#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:53,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:53,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {3812#(<= 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; {3813#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:53,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:53,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {3813#(<= 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; {3814#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:53,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:53,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {3814#(<= 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; {3815#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:53,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:53,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-14 18:39:53,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-14 18:39:53,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,365 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,365 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,366 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-14 18:39:53,367 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume ~cond == 0; {3804#false} is VALID [2018-11-14 18:39:53,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-14 18:39:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:39:53,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:53,372 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 18:39:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:39:53,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:39:53,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:53,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:53,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-14 18:39:53,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-14 18:39:53,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-14 18:39:53,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-14 18:39:53,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-14 18:39:53,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {3803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3834#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:53,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {3834#(<= main_~i~0 0)} assume true; {3834#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:53,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {3834#(<= 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; {3806#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:53,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:53,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {3806#(<= 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; {3807#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:53,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:53,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {3807#(<= 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; {3808#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:53,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:53,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {3808#(<= 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; {3809#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:53,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:53,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#(<= 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; {3810#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:53,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:53,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#(<= 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; {3811#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:53,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:53,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {3811#(<= 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; {3812#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:53,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:53,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {3812#(<= 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; {3813#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:53,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:53,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {3813#(<= 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; {3814#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:53,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:53,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {3814#(<= 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; {3815#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:53,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:53,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-14 18:39:53,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-14 18:39:53,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-14 18:39:53,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-14 18:39:53,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3804#false} is VALID [2018-11-14 18:39:53,686 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3804#false} is VALID [2018-11-14 18:39:53,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-14 18:39:53,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume ~cond == 0; {3804#false} is VALID [2018-11-14 18:39:53,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-14 18:39:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:39:53,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:53,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:39:53,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-14 18:39:53,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:53,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:39:53,744 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 18:39:53,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:39:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:39:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:39:53,745 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 14 states. [2018-11-14 18:39:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:54,076 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 18:39:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:39:54,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-14 18:39:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:39:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-14 18:39:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:39:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-14 18:39:54,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 87 transitions. [2018-11-14 18:39:54,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:54,200 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:39:54,200 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 18:39:54,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 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 18:39:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 18:39:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-14 18:39:54,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:54,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-14 18:39:54,252 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 18:39:54,253 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 18:39:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:54,254 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-14 18:39:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-14 18:39:54,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:54,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:54,254 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 18:39:54,255 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 18:39:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:54,256 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-14 18:39:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-14 18:39:54,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:54,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:54,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:54,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 18:39:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-14 18:39:54,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 58 [2018-11-14 18:39:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:54,259 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-14 18:39:54,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:39:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-14 18:39:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 18:39:54,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:54,260 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:54,260 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 918410795, now seen corresponding path program 11 times [2018-11-14 18:39:54,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:54,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:54,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:54,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-14 18:39:54,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-14 18:39:54,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:54,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-14 18:39:54,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-14 18:39:54,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {4369#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4371#(= main_~i~0 0)} is VALID [2018-11-14 18:39:54,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {4371#(= main_~i~0 0)} assume true; {4371#(= main_~i~0 0)} is VALID [2018-11-14 18:39:54,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {4371#(= 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; {4372#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:54,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:54,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {4372#(<= 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; {4373#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:54,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:54,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {4373#(<= 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; {4374#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:54,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:54,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {4374#(<= 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; {4375#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:54,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:54,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {4375#(<= 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; {4376#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:54,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:54,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {4376#(<= 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; {4377#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:54,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:54,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {4377#(<= 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; {4378#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:54,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:54,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {4378#(<= 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; {4379#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:54,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:54,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= 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; {4380#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:54,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:54,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= 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; {4381#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:54,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:54,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {4381#(<= 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; {4382#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:54,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#false} ~i~0 := 0; {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 41: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {4370#false} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-14 18:39:54,505 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume ~cond == 0; {4370#false} is VALID [2018-11-14 18:39:54,506 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-14 18:39:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-14 18:39:54,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:54,509 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 18:39:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:39:55,334 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:39:55,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:55,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:55,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-14 18:39:55,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-14 18:39:55,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-14 18:39:55,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-14 18:39:55,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {4369#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4369#true} is VALID [2018-11-14 18:39:55,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4369#true} is VALID [2018-11-14 18:39:55,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-14 18:39:55,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#true} assume !(~i~0 < 100000); {4369#true} is VALID [2018-11-14 18:39:55,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {4369#true} ~i~0 := 0; {4476#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:55,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {4476#(<= main_~i~0 0)} assume true; {4476#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:55,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {4476#(<= 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; {4372#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:55,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:55,540 INFO L273 TraceCheckUtils]: 34: Hoare triple {4372#(<= 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; {4373#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:55,541 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:55,542 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#(<= 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; {4374#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:55,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:55,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {4374#(<= 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; {4375#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:55,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:55,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {4375#(<= 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; {4376#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:55,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:55,547 INFO L273 TraceCheckUtils]: 42: Hoare triple {4376#(<= 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; {4377#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:55,548 INFO L273 TraceCheckUtils]: 43: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:55,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {4377#(<= 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; {4378#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:55,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:55,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {4378#(<= 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; {4379#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:55,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:55,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {4379#(<= 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; {4380#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:55,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:55,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {4380#(<= 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; {4381#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:55,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:55,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {4381#(<= 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; {4382#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:55,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:55,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-14 18:39:55,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-14 18:39:55,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-14 18:39:55,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4370#false} is VALID [2018-11-14 18:39:55,558 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4370#false} is VALID [2018-11-14 18:39:55,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-14 18:39:55,559 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume ~cond == 0; {4370#false} is VALID [2018-11-14 18:39:55,559 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-14 18:39:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-14 18:39:55,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:39:55,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-14 18:39:55,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:55,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:39:55,659 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 18:39:55,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:39:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:39:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:39:55,660 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 15 states. [2018-11-14 18:39:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:56,026 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-14 18:39:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:39:56,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-14 18:39:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:39:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-14 18:39:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:39:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-14 18:39:56,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2018-11-14 18:39:56,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:56,163 INFO L225 Difference]: With dead ends: 108 [2018-11-14 18:39:56,164 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 18:39:56,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:39:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 18:39:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-14 18:39:56,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:56,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-14 18:39:56,800 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 18:39:56,801 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 18:39:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:56,802 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-14 18:39:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-14 18:39:56,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:56,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:56,805 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 18:39:56,805 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 18:39:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:56,807 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-14 18:39:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-14 18:39:56,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:56,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:56,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:56,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 18:39:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-14 18:39:56,811 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 62 [2018-11-14 18:39:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:56,811 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-14 18:39:56,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:39:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-14 18:39:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 18:39:56,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:56,812 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:56,813 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:56,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -490284821, now seen corresponding path program 12 times [2018-11-14 18:39:56,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:56,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:57,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-14 18:39:57,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-14 18:39:57,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:57,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-14 18:39:57,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-14 18:39:57,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {4971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4973#(= main_~i~0 0)} is VALID [2018-11-14 18:39:57,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#(= main_~i~0 0)} assume true; {4973#(= main_~i~0 0)} is VALID [2018-11-14 18:39:57,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#(= 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; {4974#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:57,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:57,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:57,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:57,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:57,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:57,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {4976#(<= 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; {4977#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:57,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:57,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {4977#(<= 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; {4978#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:57,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:57,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {4978#(<= 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; {4979#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:57,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:57,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {4979#(<= 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; {4980#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:57,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:57,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {4980#(<= 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; {4981#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:57,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:57,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {4981#(<= 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; {4982#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:57,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:57,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {4982#(<= 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; {4983#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:57,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:57,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {4983#(<= 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; {4984#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:57,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:57,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {4984#(<= 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; {4985#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:57,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:57,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-14 18:39:57,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {4972#false} ~i~0 := 0; {4972#false} is VALID [2018-11-14 18:39:57,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,455 INFO L273 TraceCheckUtils]: 51: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,455 INFO L273 TraceCheckUtils]: 52: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 55: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 58: Hoare triple {4972#false} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:57,456 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4972#false} is VALID [2018-11-14 18:39:57,457 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4972#false} is VALID [2018-11-14 18:39:57,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-14 18:39:57,457 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume ~cond == 0; {4972#false} is VALID [2018-11-14 18:39:57,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-14 18:39:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-14 18:39:57,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:57,460 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 18:39:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:39:57,992 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:39:57,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:58,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:58,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-14 18:39:58,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-14 18:39:58,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-14 18:39:58,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-14 18:39:58,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {4971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4971#true} is VALID [2018-11-14 18:39:58,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4971#true} is VALID [2018-11-14 18:39:58,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-14 18:39:58,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5076#(<= main_~i~0 100000)} is VALID [2018-11-14 18:39:58,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {5076#(<= main_~i~0 100000)} assume true; {5076#(<= main_~i~0 100000)} is VALID [2018-11-14 18:39:58,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {5076#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4971#true} is VALID [2018-11-14 18:39:58,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {4971#true} ~i~0 := 0; {5086#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:58,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {5086#(<= main_~i~0 0)} assume true; {5086#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:58,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {5086#(<= 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; {4974#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:58,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:58,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:58,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:58,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:58,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:58,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {4976#(<= 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; {4977#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:58,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:58,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {4977#(<= 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; {4978#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:58,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:58,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {4978#(<= 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; {4979#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:58,301 INFO L273 TraceCheckUtils]: 45: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:58,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {4979#(<= 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; {4980#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:58,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:58,303 INFO L273 TraceCheckUtils]: 48: Hoare triple {4980#(<= 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; {4981#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:58,304 INFO L273 TraceCheckUtils]: 49: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:58,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {4981#(<= 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; {4982#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:58,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:58,306 INFO L273 TraceCheckUtils]: 52: Hoare triple {4982#(<= 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; {4983#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:58,307 INFO L273 TraceCheckUtils]: 53: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:58,308 INFO L273 TraceCheckUtils]: 54: Hoare triple {4983#(<= 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; {4984#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:58,308 INFO L273 TraceCheckUtils]: 55: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:58,309 INFO L273 TraceCheckUtils]: 56: Hoare triple {4984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4985#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:58,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:58,310 INFO L273 TraceCheckUtils]: 58: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-14 18:39:58,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-14 18:39:58,311 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-14 18:39:58,311 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4972#false} is VALID [2018-11-14 18:39:58,311 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4972#false} is VALID [2018-11-14 18:39:58,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-14 18:39:58,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume ~cond == 0; {4972#false} is VALID [2018-11-14 18:39:58,312 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-14 18:39:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-14 18:39:58,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:58,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-14 18:39:58,337 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-14 18:39:58,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:58,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:39:58,405 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 18:39:58,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:39:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:39:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:39:58,407 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2018-11-14 18:39:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:58,852 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-14 18:39:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:39:58,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-14 18:39:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:39:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-14 18:39:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:39:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-14 18:39:58,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2018-11-14 18:39:59,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:59,404 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:39:59,405 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 18:39:59,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:39:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 18:39:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-14 18:39:59,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:59,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-14 18:39:59,440 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 18:39:59,440 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 18:39:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:59,443 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-14 18:39:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-14 18:39:59,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:59,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:59,444 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 18:39:59,444 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 18:39:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:59,446 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-14 18:39:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-14 18:39:59,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:59,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:59,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:59,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 18:39:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-14 18:39:59,449 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 66 [2018-11-14 18:39:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:59,449 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-14 18:39:59,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:39:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-14 18:39:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 18:39:59,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:59,450 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:59,450 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:59,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:59,451 INFO L82 PathProgramCache]: Analyzing trace with hash -911243093, now seen corresponding path program 13 times [2018-11-14 18:39:59,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:00,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-14 18:40:00,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-14 18:40:00,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-14 18:40:00,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-14 18:40:00,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-14 18:40:00,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {5610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5612#(= main_~i~0 0)} is VALID [2018-11-14 18:40:00,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {5612#(= main_~i~0 0)} assume true; {5612#(= main_~i~0 0)} is VALID [2018-11-14 18:40:00,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {5612#(= 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; {5613#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:00,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:00,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {5613#(<= 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; {5614#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:00,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:00,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {5614#(<= 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; {5615#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:00,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:00,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {5615#(<= 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; {5616#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:00,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:00,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {5616#(<= 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; {5617#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:00,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:00,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {5617#(<= 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; {5618#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:00,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:00,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {5618#(<= 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; {5619#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:00,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:00,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {5619#(<= 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; {5620#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:00,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:00,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {5620#(<= 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; {5621#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:00,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:00,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {5621#(<= 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; {5622#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:00,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:00,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#(<= 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; {5623#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:00,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:00,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {5623#(<= 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; {5624#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:00,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:00,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {5624#(<= 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; {5625#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:00,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:00,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-14 18:40:00,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-14 18:40:00,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,048 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,048 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,048 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,049 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,049 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,049 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,049 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,050 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,050 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,050 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,051 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,051 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,051 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-14 18:40:00,052 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume ~cond == 0; {5611#false} is VALID [2018-11-14 18:40:00,053 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-14 18:40:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 18:40:00,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:00,056 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 18:40:00,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:00,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:00,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-14 18:40:00,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-14 18:40:00,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-14 18:40:00,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-14 18:40:00,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-14 18:40:00,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {5610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5644#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:00,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#(<= main_~i~0 0)} assume true; {5644#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:00,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {5644#(<= 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; {5613#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:00,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:00,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {5613#(<= 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; {5614#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:00,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:00,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {5614#(<= 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; {5615#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:00,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:00,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {5615#(<= 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; {5616#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:00,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:00,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {5616#(<= 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; {5617#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:00,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:00,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {5617#(<= 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; {5618#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:00,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:00,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {5618#(<= 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; {5619#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:00,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:00,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {5619#(<= 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; {5620#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:00,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:00,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {5620#(<= 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; {5621#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:00,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:00,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {5621#(<= 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; {5622#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:00,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:00,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#(<= 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; {5623#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:00,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:00,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {5623#(<= 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; {5624#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:00,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:00,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {5624#(<= 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; {5625#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:00,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:00,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-14 18:40:00,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-14 18:40:00,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,263 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,263 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,263 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,263 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-14 18:40:00,264 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-14 18:40:00,265 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5611#false} is VALID [2018-11-14 18:40:00,265 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5611#false} is VALID [2018-11-14 18:40:00,265 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-14 18:40:00,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume ~cond == 0; {5611#false} is VALID [2018-11-14 18:40:00,265 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-14 18:40:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 18:40:00,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:00,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:40:00,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-14 18:40:00,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:00,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:40:00,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:00,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:40:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:40:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:40:00,333 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 17 states. [2018-11-14 18:40:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:00,916 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-14 18:40:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:40:00,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-14 18:40:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:40:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:40:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:40:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:40:00,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 18:40:01,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:01,442 INFO L225 Difference]: With dead ends: 120 [2018-11-14 18:40:01,442 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 18:40:01,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:40:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 18:40:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-14 18:40:01,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:01,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-14 18:40:01,489 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-14 18:40:01,489 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-14 18:40:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:01,491 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-14 18:40:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-14 18:40:01,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:01,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:01,491 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-14 18:40:01,491 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-14 18:40:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:01,492 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-14 18:40:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-14 18:40:01,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:01,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:01,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:01,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 18:40:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-14 18:40:01,494 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 70 [2018-11-14 18:40:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:01,494 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-14 18:40:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:40:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-14 18:40:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 18:40:01,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:01,495 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:01,496 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1045046635, now seen corresponding path program 14 times [2018-11-14 18:40:01,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:01,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-14 18:40:01,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-14 18:40:01,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-14 18:40:01,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-14 18:40:01,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-14 18:40:01,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {6284#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6286#(= main_~i~0 0)} is VALID [2018-11-14 18:40:01,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {6286#(= main_~i~0 0)} assume true; {6286#(= main_~i~0 0)} is VALID [2018-11-14 18:40:01,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {6286#(= 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; {6287#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:01,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:01,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {6287#(<= 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; {6288#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:01,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:01,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {6288#(<= 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; {6289#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:01,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:01,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {6289#(<= 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; {6290#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:01,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:01,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {6290#(<= 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; {6291#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:01,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:01,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {6291#(<= 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; {6292#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:01,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:01,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {6292#(<= 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; {6293#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:01,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:01,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {6293#(<= 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; {6294#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:01,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:01,739 INFO L273 TraceCheckUtils]: 23: Hoare triple {6294#(<= 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; {6295#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:01,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:01,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {6295#(<= 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; {6296#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:01,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:01,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {6296#(<= 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; {6297#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:01,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:01,744 INFO L273 TraceCheckUtils]: 29: Hoare triple {6297#(<= 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; {6298#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:01,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:01,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {6298#(<= 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; {6299#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:01,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:01,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {6299#(<= 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; {6300#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:01,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:01,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-14 18:40:01,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-14 18:40:01,749 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,750 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,751 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,753 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6285#false} is VALID [2018-11-14 18:40:01,754 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6285#false} is VALID [2018-11-14 18:40:01,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-14 18:40:01,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume ~cond == 0; {6285#false} is VALID [2018-11-14 18:40:01,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-14 18:40:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 18:40:01,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:01,757 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 18:40:01,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:01,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:01,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:01,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:01,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-14 18:40:01,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-14 18:40:01,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-14 18:40:01,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-14 18:40:01,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-14 18:40:01,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {6284#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6319#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:01,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {6319#(<= main_~i~0 0)} assume true; {6319#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:01,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {6319#(<= 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; {6287#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:01,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:01,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {6287#(<= 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; {6288#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:01,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:01,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {6288#(<= 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; {6289#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:01,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:01,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {6289#(<= 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; {6290#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:01,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:01,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {6290#(<= 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; {6291#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:01,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:01,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {6291#(<= 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; {6292#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:01,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:01,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {6292#(<= 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; {6293#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:01,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:01,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {6293#(<= 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; {6294#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:01,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:01,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {6294#(<= 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; {6295#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:01,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:01,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {6295#(<= 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; {6296#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:01,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:01,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {6296#(<= 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; {6297#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:01,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:01,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {6297#(<= 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; {6298#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:01,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:01,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {6298#(<= 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; {6299#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:01,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:01,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {6299#(<= 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; {6300#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:01,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:01,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-14 18:40:01,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-14 18:40:01,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,986 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#false} is VALID [2018-11-14 18:40:01,987 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6285#false} is VALID [2018-11-14 18:40:01,988 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-14 18:40:01,989 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume ~cond == 0; {6285#false} is VALID [2018-11-14 18:40:01,989 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-14 18:40:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 18:40:02,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:02,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:40:02,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-14 18:40:02,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:02,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:40:02,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:02,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:40:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:40:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:40:02,065 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 18 states. [2018-11-14 18:40:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,473 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-14 18:40:02,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:40:02,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-14 18:40:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:40:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-14 18:40:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:40:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-14 18:40:02,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 103 transitions. [2018-11-14 18:40:02,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:02,594 INFO L225 Difference]: With dead ends: 126 [2018-11-14 18:40:02,595 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 18:40:02,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:40:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 18:40:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-14 18:40:02,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:02,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-14 18:40:02,690 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 18:40:02,690 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 18:40:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,692 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-14 18:40:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 18:40:02,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:02,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:02,692 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 18:40:02,692 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 18:40:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,694 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-14 18:40:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 18:40:02,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:02,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:02,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:02,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:40:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-14 18:40:02,697 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 74 [2018-11-14 18:40:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:02,697 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-14 18:40:02,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:40:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 18:40:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 18:40:02,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:02,698 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:02,699 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash 119074603, now seen corresponding path program 15 times [2018-11-14 18:40:02,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:02,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:02,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:02,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:02,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:03,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-14 18:40:03,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-14 18:40:03,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-14 18:40:03,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-14 18:40:03,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-14 18:40:03,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {6994#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6996#(= main_~i~0 0)} is VALID [2018-11-14 18:40:03,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {6996#(= main_~i~0 0)} assume true; {6996#(= main_~i~0 0)} is VALID [2018-11-14 18:40:03,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {6996#(= 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; {6997#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:03,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:03,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {6997#(<= 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; {6998#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:03,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:03,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {6998#(<= 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; {6999#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:03,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:03,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {6999#(<= 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; {7000#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:03,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:03,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#(<= 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; {7001#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:03,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:03,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {7001#(<= 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; {7002#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:03,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:03,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {7002#(<= 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; {7003#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:03,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:03,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {7003#(<= 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; {7004#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:03,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:03,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {7004#(<= 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; {7005#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:03,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:03,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {7005#(<= 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; {7006#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:03,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:03,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {7006#(<= 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; {7007#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:03,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:03,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {7007#(<= 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; {7008#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:03,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:03,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {7008#(<= 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; {7009#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:03,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:03,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {7009#(<= 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; {7010#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:03,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:03,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {7010#(<= 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; {7011#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:03,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:03,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-14 18:40:03,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-14 18:40:03,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,301 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,302 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,302 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,303 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,303 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,303 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,303 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,305 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume ~cond == 0; {6995#false} is VALID [2018-11-14 18:40:03,306 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-14 18:40:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-14 18:40:03,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:03,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:03,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:03,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 18:40:03,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:03,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:04,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-14 18:40:04,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-14 18:40:04,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-14 18:40:04,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-14 18:40:04,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-14 18:40:04,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {6994#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7030#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:04,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {7030#(<= main_~i~0 0)} assume true; {7030#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:04,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {7030#(<= 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; {6997#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:04,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:04,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {6997#(<= 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; {6998#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:04,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:04,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {6998#(<= 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; {6999#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:04,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:04,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {6999#(<= 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; {7000#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:04,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:04,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#(<= 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; {7001#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:04,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:04,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {7001#(<= 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; {7002#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:04,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:04,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {7002#(<= 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; {7003#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:04,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:04,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {7003#(<= 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; {7004#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:04,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:04,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {7004#(<= 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; {7005#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:04,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:04,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {7005#(<= 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; {7006#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:04,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:04,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {7006#(<= 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; {7007#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:04,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:04,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {7007#(<= 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; {7008#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:04,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:04,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {7008#(<= 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; {7009#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:04,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:04,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {7009#(<= 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; {7010#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:04,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:04,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {7010#(<= 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; {7011#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:04,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:04,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-14 18:40:04,095 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-14 18:40:04,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,096 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,097 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,098 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,098 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,098 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,099 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,100 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6995#false} is VALID [2018-11-14 18:40:04,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-14 18:40:04,102 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume ~cond == 0; {6995#false} is VALID [2018-11-14 18:40:04,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-14 18:40:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-14 18:40:04,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 18:40:04,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-14 18:40:04,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:04,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:40:04,181 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 18:40:04,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:40:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:40:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:40:04,183 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 19 states. [2018-11-14 18:40:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:04,726 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-14 18:40:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:40:04,727 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-14 18:40:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:40:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-14 18:40:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:40:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-14 18:40:04,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 107 transitions. [2018-11-14 18:40:04,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:04,889 INFO L225 Difference]: With dead ends: 132 [2018-11-14 18:40:04,890 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:40:04,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:40:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:40:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-14 18:40:05,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:05,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2018-11-14 18:40:05,095 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-14 18:40:05,095 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-14 18:40:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:05,097 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-14 18:40:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-14 18:40:05,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:05,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:05,098 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-14 18:40:05,098 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-14 18:40:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:05,100 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-14 18:40:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-14 18:40:05,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:05,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:05,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:05,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-14 18:40:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-14 18:40:05,102 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 78 [2018-11-14 18:40:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:05,102 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-14 18:40:05,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:40:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-14 18:40:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:40:05,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:05,104 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:05,104 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:05,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1840372245, now seen corresponding path program 16 times [2018-11-14 18:40:05,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:05,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:05,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:05,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:05,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:06,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-14 18:40:06,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-14 18:40:06,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-14 18:40:06,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-14 18:40:06,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-14 18:40:06,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7742#(= main_~i~0 0)} is VALID [2018-11-14 18:40:06,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {7742#(= main_~i~0 0)} assume true; {7742#(= main_~i~0 0)} is VALID [2018-11-14 18:40:06,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {7742#(= 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; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:06,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:06,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {7743#(<= 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; {7744#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:06,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:06,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:06,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:06,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:06,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:06,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:06,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:06,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:06,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:06,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:06,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:06,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:06,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:06,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:06,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:06,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:06,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:06,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:06,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:06,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:06,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:06,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {7754#(<= 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; {7755#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:06,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:06,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {7755#(<= 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; {7756#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:06,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:06,126 INFO L273 TraceCheckUtils]: 35: Hoare triple {7756#(<= 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; {7757#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:06,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:06,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {7757#(<= 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; {7758#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:06,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:06,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-14 18:40:06,129 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-14 18:40:06,129 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,130 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,130 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,130 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,131 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,131 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,132 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,133 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,134 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume ~cond == 0; {7741#false} is VALID [2018-11-14 18:40:06,135 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-14 18:40:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-14 18:40:06,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:06,139 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 18:40:06,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:06,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:06,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:06,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:06,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-14 18:40:06,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-14 18:40:06,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-14 18:40:06,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-14 18:40:06,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-14 18:40:06,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7777#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:06,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {7777#(<= main_~i~0 0)} assume true; {7777#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:06,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {7777#(<= 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; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:06,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:06,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {7743#(<= 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; {7744#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:06,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:06,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:06,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:06,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:06,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:06,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:06,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:06,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:06,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:06,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:06,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:06,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:06,420 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:06,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:06,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:06,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:06,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:06,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:06,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:06,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:06,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:06,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {7754#(<= 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; {7755#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:06,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:06,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {7755#(<= 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; {7756#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:06,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:06,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {7756#(<= 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; {7757#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:06,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:06,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {7757#(<= 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; {7758#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:06,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:06,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-14 18:40:06,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-14 18:40:06,433 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,434 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,435 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,436 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,437 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,438 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-14 18:40:06,439 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-14 18:40:06,439 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-14 18:40:06,439 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7741#false} is VALID [2018-11-14 18:40:06,439 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7741#false} is VALID [2018-11-14 18:40:06,439 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-14 18:40:06,440 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume ~cond == 0; {7741#false} is VALID [2018-11-14 18:40:06,440 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-14 18:40:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-14 18:40:06,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:40:06,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-14 18:40:06,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:06,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:40:06,515 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 18:40:06,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:40:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:40:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:40:06,516 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 20 states. [2018-11-14 18:40:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:06,932 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-11-14 18:40:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:40:06,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-14 18:40:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:40:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-14 18:40:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:40:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-14 18:40:06,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2018-11-14 18:40:07,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:07,103 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:40:07,104 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 18:40:07,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:40:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 18:40:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-14 18:40:07,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:07,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-14 18:40:07,148 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 18:40:07,148 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 18:40:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:07,151 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-14 18:40:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-14 18:40:07,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:07,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:07,152 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 18:40:07,152 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 18:40:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:07,154 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-14 18:40:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-14 18:40:07,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:07,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:07,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:07,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-14 18:40:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-14 18:40:07,157 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 82 [2018-11-14 18:40:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:07,157 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-14 18:40:07,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:40:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-14 18:40:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-14 18:40:07,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:07,159 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:07,159 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:07,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 701237675, now seen corresponding path program 17 times [2018-11-14 18:40:07,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:07,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:07,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:07,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-14 18:40:07,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-14 18:40:07,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-14 18:40:07,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-14 18:40:07,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-14 18:40:07,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {8522#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8524#(= main_~i~0 0)} is VALID [2018-11-14 18:40:07,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {8524#(= main_~i~0 0)} assume true; {8524#(= main_~i~0 0)} is VALID [2018-11-14 18:40:07,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {8524#(= 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; {8525#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:07,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:07,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {8525#(<= 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; {8526#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:07,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:07,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {8526#(<= 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; {8527#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:07,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:07,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {8527#(<= 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; {8528#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:07,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:07,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#(<= 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; {8529#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:07,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:07,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {8529#(<= 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; {8530#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:07,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:07,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= 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; {8531#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:07,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:07,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:07,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:07,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:07,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:07,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:07,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:07,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:07,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:07,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:07,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:07,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:07,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:07,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:07,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:07,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:07,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:07,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:07,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:07,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:07,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:07,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-14 18:40:07,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-14 18:40:07,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-14 18:40:07,917 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:07,918 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8523#false} is VALID [2018-11-14 18:40:07,918 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8523#false} is VALID [2018-11-14 18:40:07,918 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-14 18:40:07,918 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume ~cond == 0; {8523#false} is VALID [2018-11-14 18:40:07,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-14 18:40:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-14 18:40:07,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:07,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:40:07,933 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:40:20,823 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:40:20,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:20,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:21,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-14 18:40:21,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-14 18:40:21,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-14 18:40:21,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-14 18:40:21,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-14 18:40:21,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {8522#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8560#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:21,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {8560#(<= main_~i~0 0)} assume true; {8560#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:21,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {8560#(<= 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; {8525#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:21,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:21,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {8525#(<= 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; {8526#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:21,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:21,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {8526#(<= 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; {8527#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:21,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:21,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {8527#(<= 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; {8528#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:21,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:21,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#(<= 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; {8529#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:21,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:21,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {8529#(<= 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; {8530#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:21,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:21,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= 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; {8531#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:21,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:21,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:21,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:21,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:21,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:21,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:21,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:21,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:21,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:21,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:21,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:21,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:21,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:21,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:21,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:21,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:21,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:21,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:21,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:21,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:21,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:21,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-14 18:40:21,072 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-14 18:40:21,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,072 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,073 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,074 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,074 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,074 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,075 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,076 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8523#false} is VALID [2018-11-14 18:40:21,077 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8523#false} is VALID [2018-11-14 18:40:21,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-14 18:40:21,078 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume ~cond == 0; {8523#false} is VALID [2018-11-14 18:40:21,078 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-14 18:40:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-14 18:40:21,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:21,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:40:21,108 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-14 18:40:21,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:21,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:40:21,159 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 18:40:21,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:40:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:40:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:40:21,160 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 21 states. [2018-11-14 18:40:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:21,640 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-11-14 18:40:21,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:40:21,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-14 18:40:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:40:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-14 18:40:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:40:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-14 18:40:21,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2018-11-14 18:40:21,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:21,756 INFO L225 Difference]: With dead ends: 144 [2018-11-14 18:40:21,756 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 18:40:21,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:40:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 18:40:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-14 18:40:21,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:21,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2018-11-14 18:40:21,800 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 18:40:21,800 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 18:40:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:21,802 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-14 18:40:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-14 18:40:21,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:21,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:21,803 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 18:40:21,803 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 18:40:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:21,804 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-14 18:40:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-14 18:40:21,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:21,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:21,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:21,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 18:40:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-14 18:40:21,807 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 86 [2018-11-14 18:40:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:21,807 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-14 18:40:21,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:40:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-14 18:40:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 18:40:21,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:21,809 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:21,809 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:21,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:21,809 INFO L82 PathProgramCache]: Analyzing trace with hash 656726635, now seen corresponding path program 18 times [2018-11-14 18:40:21,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:21,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:21,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:22,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-14 18:40:22,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-14 18:40:22,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-14 18:40:22,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-14 18:40:22,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-14 18:40:22,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {9340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9342#(= main_~i~0 0)} is VALID [2018-11-14 18:40:22,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {9342#(= main_~i~0 0)} assume true; {9342#(= main_~i~0 0)} is VALID [2018-11-14 18:40:22,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {9342#(= 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; {9343#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:22,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:22,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {9343#(<= 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; {9344#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:22,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:22,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {9344#(<= 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; {9345#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:22,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:22,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {9345#(<= 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; {9346#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:22,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:22,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {9346#(<= 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; {9347#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:22,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:22,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {9347#(<= 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; {9348#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:22,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:22,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {9348#(<= 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; {9349#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:22,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:22,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {9349#(<= 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; {9350#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:22,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:22,427 INFO L273 TraceCheckUtils]: 23: Hoare triple {9350#(<= 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; {9351#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:22,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:22,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {9351#(<= 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; {9352#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:22,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:22,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {9352#(<= 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; {9353#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:22,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:22,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {9353#(<= 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; {9354#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:22,432 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:22,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {9354#(<= 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; {9355#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:22,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:22,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {9355#(<= 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; {9356#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:22,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:22,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {9356#(<= 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; {9357#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:22,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:22,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {9357#(<= 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; {9358#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:22,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:22,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(<= 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; {9359#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:22,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:22,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {9359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9360#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:22,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:22,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-14 18:40:22,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-14 18:40:22,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,443 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,443 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,444 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,444 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,444 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,444 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,444 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,445 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-14 18:40:22,448 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume ~cond == 0; {9341#false} is VALID [2018-11-14 18:40:22,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-14 18:40:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 18:40:22,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:22,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:40:45,555 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 18:40:45,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:45,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:45,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-14 18:40:45,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-14 18:40:45,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-14 18:40:45,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-14 18:40:45,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-14 18:40:45,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {9340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9379#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:45,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {9379#(<= main_~i~0 0)} assume true; {9379#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:45,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {9379#(<= 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; {9343#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:45,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:45,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {9343#(<= 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; {9344#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:45,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:45,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {9344#(<= 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; {9345#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:45,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:45,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {9345#(<= 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; {9346#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:45,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:45,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {9346#(<= 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; {9347#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:45,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:45,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {9347#(<= 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; {9348#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:45,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:45,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {9348#(<= 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; {9349#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:45,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:45,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {9349#(<= 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; {9350#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:45,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:45,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {9350#(<= 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; {9351#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:45,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:45,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {9351#(<= 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; {9352#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:45,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:45,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {9352#(<= 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; {9353#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:45,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:45,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {9353#(<= 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; {9354#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:45,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:45,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {9354#(<= 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; {9355#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:45,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:45,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {9355#(<= 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; {9356#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:45,942 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:45,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {9356#(<= 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; {9357#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:45,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:45,945 INFO L273 TraceCheckUtils]: 37: Hoare triple {9357#(<= 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; {9358#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:45,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:45,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(<= 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; {9359#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:45,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:45,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {9359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9360#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:45,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:45,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-14 18:40:45,950 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-14 18:40:45,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,951 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,952 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,952 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,952 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,953 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,953 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,953 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,953 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,953 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,954 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,955 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-14 18:40:45,956 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume ~cond == 0; {9341#false} is VALID [2018-11-14 18:40:45,957 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-14 18:40:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 18:40:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:45,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 18:40:45,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-14 18:40:45,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:45,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:40:46,069 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 18:40:46,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:40:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:40:46,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:40:46,071 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 22 states. [2018-11-14 18:40:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:47,180 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-14 18:40:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:40:47,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-14 18:40:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:40:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-14 18:40:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:40:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-14 18:40:47,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 119 transitions. [2018-11-14 18:40:47,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:47,294 INFO L225 Difference]: With dead ends: 150 [2018-11-14 18:40:47,294 INFO L226 Difference]: Without dead ends: 99 [2018-11-14 18:40:47,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:40:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-14 18:40:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-14 18:40:47,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:47,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2018-11-14 18:40:47,366 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-14 18:40:47,367 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-14 18:40:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:47,369 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-14 18:40:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-14 18:40:47,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:47,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:47,369 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-14 18:40:47,369 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-14 18:40:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:47,371 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-14 18:40:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-14 18:40:47,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:47,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:47,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:47,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 18:40:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-14 18:40:47,372 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 90 [2018-11-14 18:40:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:47,373 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-14 18:40:47,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:40:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-14 18:40:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 18:40:47,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:47,374 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:47,374 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:47,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash 664459307, now seen corresponding path program 19 times [2018-11-14 18:40:47,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:47,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:47,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:47,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:47,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-14 18:40:47,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-14 18:40:47,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-14 18:40:47,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-14 18:40:47,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-14 18:40:47,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {10194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10196#(= main_~i~0 0)} is VALID [2018-11-14 18:40:47,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {10196#(= main_~i~0 0)} assume true; {10196#(= main_~i~0 0)} is VALID [2018-11-14 18:40:47,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {10196#(= 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; {10197#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:47,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:47,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= 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; {10198#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:47,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:47,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {10198#(<= 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; {10199#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:47,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:47,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {10199#(<= 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; {10200#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:47,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:47,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {10200#(<= 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; {10201#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:47,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:47,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {10201#(<= 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; {10202#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:47,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:47,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {10202#(<= 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; {10203#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:47,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:47,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {10203#(<= 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; {10204#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:47,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:47,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {10204#(<= 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; {10205#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:47,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:47,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {10205#(<= 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; {10206#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:47,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:47,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#(<= 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; {10207#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:47,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:47,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {10207#(<= 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; {10208#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:47,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:47,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:47,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:47,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:47,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:47,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:47,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:47,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:47,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:47,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:47,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:47,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {10213#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10214#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:47,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:47,817 INFO L273 TraceCheckUtils]: 43: Hoare triple {10214#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10215#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:47,818 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:47,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-14 18:40:47,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-14 18:40:47,819 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,819 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,820 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,820 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,820 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,820 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,821 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,821 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,821 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,822 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,823 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,824 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10195#false} is VALID [2018-11-14 18:40:47,825 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-14 18:40:47,826 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume ~cond == 0; {10195#false} is VALID [2018-11-14 18:40:47,826 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-14 18:40:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-14 18:40:47,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:47,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:47,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:48,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-14 18:40:48,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-14 18:40:48,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-14 18:40:48,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-14 18:40:48,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-14 18:40:48,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {10194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10234#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:48,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {10234#(<= main_~i~0 0)} assume true; {10234#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:48,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {10234#(<= 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; {10197#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:48,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:48,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= 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; {10198#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:48,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:48,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {10198#(<= 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; {10199#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:48,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:48,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {10199#(<= 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; {10200#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:48,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:48,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {10200#(<= 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; {10201#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:48,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:48,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {10201#(<= 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; {10202#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:48,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:48,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {10202#(<= 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; {10203#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:48,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:48,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {10203#(<= 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; {10204#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:48,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:48,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {10204#(<= 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; {10205#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:48,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:48,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {10205#(<= 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; {10206#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:48,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:48,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#(<= 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; {10207#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:48,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:48,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {10207#(<= 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; {10208#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:48,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:48,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:48,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:48,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:48,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:48,177 INFO L273 TraceCheckUtils]: 35: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:48,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:48,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:48,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:48,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:48,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:48,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {10213#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10214#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:48,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:48,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {10214#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10215#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:48,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:48,185 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-14 18:40:48,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-14 18:40:48,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,186 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,188 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,189 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-14 18:40:48,190 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume ~cond == 0; {10195#false} is VALID [2018-11-14 18:40:48,191 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-14 18:40:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-14 18:40:48,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:48,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:40:48,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-14 18:40:48,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:48,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:40:48,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:48,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:40:48,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:40:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:40:48,275 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 23 states. [2018-11-14 18:40:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:48,880 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-11-14 18:40:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:40:48,880 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-14 18:40:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:40:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-14 18:40:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:40:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-14 18:40:48,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2018-11-14 18:40:48,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:48,996 INFO L225 Difference]: With dead ends: 156 [2018-11-14 18:40:48,997 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:40:48,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:40:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:40:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-14 18:40:49,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:49,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-14 18:40:49,050 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 18:40:49,050 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 18:40:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:49,052 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-14 18:40:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-14 18:40:49,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:49,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:49,052 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 18:40:49,052 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 18:40:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:49,054 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-14 18:40:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-14 18:40:49,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:49,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:49,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:49,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 18:40:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-14 18:40:49,057 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 94 [2018-11-14 18:40:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:49,057 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-14 18:40:49,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:40:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-14 18:40:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-14 18:40:49,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:49,059 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:49,059 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:49,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1075856107, now seen corresponding path program 20 times [2018-11-14 18:40:49,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:49,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:49,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-14 18:40:49,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-14 18:40:49,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-14 18:40:49,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-14 18:40:49,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-14 18:40:49,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11086#(= main_~i~0 0)} is VALID [2018-11-14 18:40:49,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#(= main_~i~0 0)} assume true; {11086#(= main_~i~0 0)} is VALID [2018-11-14 18:40:49,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {11086#(= 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; {11087#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:49,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:49,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= 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; {11088#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:49,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:49,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= 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; {11089#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:49,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:49,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= 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; {11090#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:49,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:49,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= 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; {11091#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:49,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:49,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= 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; {11092#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:49,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:49,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= 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; {11093#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:49,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:49,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= 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; {11094#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:49,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:49,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= 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; {11095#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:49,638 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:49,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= 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; {11096#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:49,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:49,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= 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; {11097#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:49,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:49,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= 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; {11098#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:49,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:49,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= 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; {11099#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:49,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:49,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= 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; {11100#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:49,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:49,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= 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; {11101#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:49,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:49,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= 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; {11102#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:49,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:49,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= 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; {11103#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:49,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:49,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11104#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:49,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:49,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11105#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:49,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:49,653 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11106#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:49,654 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:49,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-14 18:40:49,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-14 18:40:49,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,656 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,656 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,657 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,657 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,657 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,657 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,658 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,659 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,660 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-14 18:40:49,661 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume ~cond == 0; {11085#false} is VALID [2018-11-14 18:40:49,662 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-14 18:40:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-14 18:40:49,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:49,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:49,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:49,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:49,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:49,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:49,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-14 18:40:49,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-14 18:40:49,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-14 18:40:49,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-14 18:40:49,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-14 18:40:49,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11125#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:49,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {11125#(<= main_~i~0 0)} assume true; {11125#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:49,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {11125#(<= 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; {11087#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:49,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:49,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= 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; {11088#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:49,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:49,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= 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; {11089#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:49,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:49,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= 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; {11090#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:49,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:49,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= 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; {11091#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:49,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:49,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= 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; {11092#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:49,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:49,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= 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; {11093#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:49,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:49,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= 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; {11094#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:49,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:49,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= 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; {11095#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:49,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:49,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= 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; {11096#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:49,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:49,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= 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; {11097#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:49,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:49,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= 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; {11098#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:49,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:49,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= 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; {11099#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:49,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:49,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= 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; {11100#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:49,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:49,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= 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; {11101#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:49,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:49,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= 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; {11102#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:49,934 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:49,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= 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; {11103#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:49,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:49,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11104#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:49,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:49,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11105#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:49,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:49,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11106#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:49,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:49,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-14 18:40:49,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-14 18:40:49,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,942 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,942 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,942 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,943 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,943 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,943 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,943 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,945 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,946 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-14 18:40:49,948 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume ~cond == 0; {11085#false} is VALID [2018-11-14 18:40:49,949 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-14 18:40:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-14 18:40:49,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:49,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:40:49,981 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-14 18:40:49,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:49,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:40:50,045 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 18:40:50,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:40:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:40:50,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:40:50,046 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 24 states. [2018-11-14 18:40:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:50,427 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2018-11-14 18:40:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:40:50,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-14 18:40:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:40:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-14 18:40:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:40:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-14 18:40:50,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 127 transitions. [2018-11-14 18:40:50,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:50,546 INFO L225 Difference]: With dead ends: 162 [2018-11-14 18:40:50,546 INFO L226 Difference]: Without dead ends: 107 [2018-11-14 18:40:50,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:40:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-14 18:40:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-14 18:40:50,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:50,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2018-11-14 18:40:50,599 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-14 18:40:50,600 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-14 18:40:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:50,601 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-14 18:40:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-14 18:40:50,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:50,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:50,601 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-14 18:40:50,602 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-14 18:40:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:50,603 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-14 18:40:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-14 18:40:50,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:50,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:50,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:50,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:40:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-11-14 18:40:50,605 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 98 [2018-11-14 18:40:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:50,606 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-11-14 18:40:50,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:40:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-14 18:40:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 18:40:50,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:50,607 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:50,607 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:50,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash 827808427, now seen corresponding path program 21 times [2018-11-14 18:40:50,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:50,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:50,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:51,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-14 18:40:51,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-14 18:40:51,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:51,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-14 18:40:51,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-14 18:40:51,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12012#(= main_~i~0 0)} is VALID [2018-11-14 18:40:51,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {12012#(= main_~i~0 0)} assume true; {12012#(= main_~i~0 0)} is VALID [2018-11-14 18:40:51,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {12012#(= 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; {12013#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:51,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:51,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {12013#(<= 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; {12014#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:51,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:51,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {12014#(<= 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; {12015#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:51,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:51,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {12015#(<= 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; {12016#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:51,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:51,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {12016#(<= 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; {12017#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:51,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:51,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {12017#(<= 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; {12018#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:51,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:51,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {12018#(<= 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; {12019#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:51,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:51,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {12019#(<= 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; {12020#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:51,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:51,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {12020#(<= 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; {12021#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:51,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:51,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {12021#(<= 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; {12022#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:51,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:51,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {12022#(<= 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; {12023#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:51,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:51,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {12023#(<= 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; {12024#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:51,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:51,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {12024#(<= 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; {12025#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:51,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:51,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {12025#(<= 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; {12026#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:51,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:51,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {12026#(<= 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; {12027#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:51,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:51,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {12027#(<= 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; {12028#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:51,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:51,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {12028#(<= 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; {12029#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:51,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:51,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12030#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:51,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:51,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12031#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:51,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:51,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12032#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:51,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:51,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12033#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:51,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:51,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-14 18:40:51,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {12011#false} ~i~0 := 0; {12011#false} is VALID [2018-11-14 18:40:51,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,249 INFO L273 TraceCheckUtils]: 55: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,250 INFO L273 TraceCheckUtils]: 60: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 62: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 63: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 65: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 66: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 67: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 69: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 70: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 71: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 74: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 75: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 77: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 79: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 82: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 83: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 84: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,253 INFO L273 TraceCheckUtils]: 85: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 87: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 88: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 89: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 90: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 91: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 92: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 93: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,254 INFO L273 TraceCheckUtils]: 94: Hoare triple {12011#false} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume ~cond == 0; {12011#false} is VALID [2018-11-14 18:40:51,255 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-14 18:40:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-14 18:40:51,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:51,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:54,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 18:40:54,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:54,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:54,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-14 18:40:54,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-14 18:40:54,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12010#true} is VALID [2018-11-14 18:40:54,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-14 18:40:54,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#true} assume !(~i~0 < 100000); {12010#true} is VALID [2018-11-14 18:40:54,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#true} ~i~0 := 0; {12187#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:54,281 INFO L273 TraceCheckUtils]: 51: Hoare triple {12187#(<= main_~i~0 0)} assume true; {12187#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:54,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {12187#(<= 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; {12013#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:54,282 INFO L273 TraceCheckUtils]: 53: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:54,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {12013#(<= 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; {12014#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:54,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:54,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {12014#(<= 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; {12015#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:54,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:54,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {12015#(<= 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; {12016#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:54,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:54,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {12016#(<= 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; {12017#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:54,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:54,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {12017#(<= 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; {12018#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:54,287 INFO L273 TraceCheckUtils]: 63: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:54,288 INFO L273 TraceCheckUtils]: 64: Hoare triple {12018#(<= 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; {12019#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:54,288 INFO L273 TraceCheckUtils]: 65: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:54,289 INFO L273 TraceCheckUtils]: 66: Hoare triple {12019#(<= 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; {12020#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:54,290 INFO L273 TraceCheckUtils]: 67: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:54,291 INFO L273 TraceCheckUtils]: 68: Hoare triple {12020#(<= 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; {12021#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:54,291 INFO L273 TraceCheckUtils]: 69: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:54,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {12021#(<= 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; {12022#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:54,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:54,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {12022#(<= 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; {12023#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:54,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:54,295 INFO L273 TraceCheckUtils]: 74: Hoare triple {12023#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12024#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:54,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:54,297 INFO L273 TraceCheckUtils]: 76: Hoare triple {12024#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12025#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:54,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:54,298 INFO L273 TraceCheckUtils]: 78: Hoare triple {12025#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12026#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:54,299 INFO L273 TraceCheckUtils]: 79: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:54,300 INFO L273 TraceCheckUtils]: 80: Hoare triple {12026#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12027#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:54,300 INFO L273 TraceCheckUtils]: 81: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:54,301 INFO L273 TraceCheckUtils]: 82: Hoare triple {12027#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12028#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:54,302 INFO L273 TraceCheckUtils]: 83: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:54,302 INFO L273 TraceCheckUtils]: 84: Hoare triple {12028#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12029#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:54,303 INFO L273 TraceCheckUtils]: 85: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:54,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12030#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:54,304 INFO L273 TraceCheckUtils]: 87: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:54,305 INFO L273 TraceCheckUtils]: 88: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12031#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:54,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:54,307 INFO L273 TraceCheckUtils]: 90: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12032#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:54,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:54,308 INFO L273 TraceCheckUtils]: 92: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12033#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:54,309 INFO L273 TraceCheckUtils]: 93: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:54,309 INFO L273 TraceCheckUtils]: 94: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-14 18:40:54,310 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-14 18:40:54,310 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-14 18:40:54,310 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12011#false} is VALID [2018-11-14 18:40:54,310 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12011#false} is VALID [2018-11-14 18:40:54,311 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-14 18:40:54,311 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume ~cond == 0; {12011#false} is VALID [2018-11-14 18:40:54,311 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-14 18:40:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-14 18:40:54,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:54,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 18:40:54,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-14 18:40:54,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:54,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:40:54,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:54,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:40:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:40:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:40:54,447 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 25 states. [2018-11-14 18:40:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:54,760 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-14 18:40:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:40:54,760 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-14 18:40:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:40:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 131 transitions. [2018-11-14 18:40:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:40:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 131 transitions. [2018-11-14 18:40:54,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 131 transitions. [2018-11-14 18:40:54,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:54,884 INFO L225 Difference]: With dead ends: 168 [2018-11-14 18:40:54,884 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 18:40:54,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:40:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 18:40:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-14 18:40:54,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:54,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-14 18:40:54,933 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 18:40:54,933 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 18:40:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:54,935 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-14 18:40:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 18:40:54,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:54,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:54,935 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 18:40:54,935 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 18:40:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:54,937 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-14 18:40:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 18:40:54,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:54,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:54,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:54,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 18:40:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-11-14 18:40:54,940 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 102 [2018-11-14 18:40:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:54,940 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-14 18:40:54,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:40:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 18:40:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 18:40:54,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:54,942 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:54,942 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:54,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1684906133, now seen corresponding path program 22 times [2018-11-14 18:40:54,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:54,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:54,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:55,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-14 18:40:55,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-14 18:40:55,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-14 18:40:55,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #64#return; {12972#true} is VALID [2018-11-14 18:40:55,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret2 := main(); {12972#true} is VALID [2018-11-14 18:40:55,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12974#(= main_~i~0 0)} is VALID [2018-11-14 18:40:55,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {12974#(= main_~i~0 0)} assume true; {12974#(= main_~i~0 0)} is VALID [2018-11-14 18:40:55,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {12974#(= 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; {12975#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:55,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {12975#(<= main_~i~0 1)} assume true; {12975#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:55,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {12975#(<= 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; {12976#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:55,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {12976#(<= main_~i~0 2)} assume true; {12976#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:55,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {12976#(<= 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; {12977#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:55,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {12977#(<= main_~i~0 3)} assume true; {12977#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:55,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {12977#(<= 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; {12978#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:55,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {12978#(<= main_~i~0 4)} assume true; {12978#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:55,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {12978#(<= 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; {12979#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:55,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {12979#(<= main_~i~0 5)} assume true; {12979#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:55,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {12979#(<= 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; {12980#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:55,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {12980#(<= main_~i~0 6)} assume true; {12980#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:55,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {12980#(<= 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; {12981#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:55,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {12981#(<= main_~i~0 7)} assume true; {12981#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:55,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {12981#(<= 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; {12982#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:55,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {12982#(<= main_~i~0 8)} assume true; {12982#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:55,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {12982#(<= 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; {12983#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:55,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {12983#(<= main_~i~0 9)} assume true; {12983#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:55,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {12983#(<= 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; {12984#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:55,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#(<= main_~i~0 10)} assume true; {12984#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:55,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#(<= 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; {12985#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:55,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {12985#(<= main_~i~0 11)} assume true; {12985#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:55,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {12985#(<= 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; {12986#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:55,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {12986#(<= main_~i~0 12)} assume true; {12986#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:55,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {12986#(<= 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; {12987#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:55,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {12987#(<= main_~i~0 13)} assume true; {12987#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:55,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {12987#(<= 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; {12988#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:55,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {12988#(<= main_~i~0 14)} assume true; {12988#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:55,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {12988#(<= 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; {12989#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:55,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {12989#(<= main_~i~0 15)} assume true; {12989#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:55,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {12989#(<= 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; {12990#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:55,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {12990#(<= main_~i~0 16)} assume true; {12990#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:55,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {12990#(<= 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; {12991#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:55,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {12991#(<= main_~i~0 17)} assume true; {12991#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:55,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {12991#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12992#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:55,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#(<= main_~i~0 18)} assume true; {12992#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:55,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12993#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:55,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#(<= main_~i~0 19)} assume true; {12993#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:55,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12994#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:55,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {12994#(<= main_~i~0 20)} assume true; {12994#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:55,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {12994#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12995#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:55,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {12995#(<= main_~i~0 21)} assume true; {12995#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:55,517 INFO L273 TraceCheckUtils]: 49: Hoare triple {12995#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12996#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:55,517 INFO L273 TraceCheckUtils]: 50: Hoare triple {12996#(<= main_~i~0 22)} assume true; {12996#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:55,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {12996#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-14 18:40:55,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {12973#false} ~i~0 := 0; {12973#false} is VALID [2018-11-14 18:40:55,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,519 INFO L273 TraceCheckUtils]: 58: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,520 INFO L273 TraceCheckUtils]: 60: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,520 INFO L273 TraceCheckUtils]: 62: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 64: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 65: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 66: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 67: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 68: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 69: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,521 INFO L273 TraceCheckUtils]: 72: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 73: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 74: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 75: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 76: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 77: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 79: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 80: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,522 INFO L273 TraceCheckUtils]: 81: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 82: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 83: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 84: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 85: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 86: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 87: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 88: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,523 INFO L273 TraceCheckUtils]: 89: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 92: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 93: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 94: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 95: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 96: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 97: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,524 INFO L273 TraceCheckUtils]: 98: Hoare triple {12973#false} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 99: Hoare triple {12973#false} havoc ~x~0;~x~0 := 0; {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 100: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 101: Hoare triple {12973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L256 TraceCheckUtils]: 102: Hoare triple {12973#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 103: Hoare triple {12973#false} ~cond := #in~cond; {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 104: Hoare triple {12973#false} assume ~cond == 0; {12973#false} is VALID [2018-11-14 18:40:55,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-14 18:40:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 18:40:55,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:55,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:55,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:55,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:55,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:55,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:55,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-14 18:40:55,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-14 18:40:55,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-14 18:40:55,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #64#return; {12972#true} is VALID [2018-11-14 18:40:55,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret2 := main(); {12972#true} is VALID [2018-11-14 18:40:55,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13015#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:55,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {13015#(<= main_~i~0 0)} assume true; {13015#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:55,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {13015#(<= 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; {12975#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:55,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {12975#(<= main_~i~0 1)} assume true; {12975#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:55,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {12975#(<= 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; {12976#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:55,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {12976#(<= main_~i~0 2)} assume true; {12976#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:55,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {12976#(<= 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; {12977#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:55,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {12977#(<= main_~i~0 3)} assume true; {12977#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:55,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {12977#(<= 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; {12978#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:55,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {12978#(<= main_~i~0 4)} assume true; {12978#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:55,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {12978#(<= 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; {12979#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:55,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {12979#(<= main_~i~0 5)} assume true; {12979#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:55,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {12979#(<= 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; {12980#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:55,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {12980#(<= main_~i~0 6)} assume true; {12980#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:55,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {12980#(<= 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; {12981#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:55,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {12981#(<= main_~i~0 7)} assume true; {12981#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:55,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {12981#(<= 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; {12982#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:55,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {12982#(<= main_~i~0 8)} assume true; {12982#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:55,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {12982#(<= 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; {12983#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:55,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {12983#(<= main_~i~0 9)} assume true; {12983#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:55,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {12983#(<= 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; {12984#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:55,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#(<= main_~i~0 10)} assume true; {12984#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:55,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#(<= 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; {12985#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:55,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {12985#(<= main_~i~0 11)} assume true; {12985#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:55,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {12985#(<= 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; {12986#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:55,985 INFO L273 TraceCheckUtils]: 30: Hoare triple {12986#(<= main_~i~0 12)} assume true; {12986#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:55,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {12986#(<= 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; {12987#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:55,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {12987#(<= main_~i~0 13)} assume true; {12987#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:55,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {12987#(<= 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; {12988#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:55,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {12988#(<= main_~i~0 14)} assume true; {12988#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:55,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {12988#(<= 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; {12989#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:55,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {12989#(<= main_~i~0 15)} assume true; {12989#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:55,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {12989#(<= 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; {12990#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:55,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {12990#(<= main_~i~0 16)} assume true; {12990#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:55,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {12990#(<= 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; {12991#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:55,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {12991#(<= main_~i~0 17)} assume true; {12991#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:55,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {12991#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12992#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:55,998 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#(<= main_~i~0 18)} assume true; {12992#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:56,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12993#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:56,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#(<= main_~i~0 19)} assume true; {12993#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:56,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12994#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:56,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {12994#(<= main_~i~0 20)} assume true; {12994#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:56,008 INFO L273 TraceCheckUtils]: 47: Hoare triple {12994#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12995#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:56,008 INFO L273 TraceCheckUtils]: 48: Hoare triple {12995#(<= main_~i~0 21)} assume true; {12995#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:56,010 INFO L273 TraceCheckUtils]: 49: Hoare triple {12995#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12996#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:56,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {12996#(<= main_~i~0 22)} assume true; {12996#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {12996#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {12973#false} ~i~0 := 0; {12973#false} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 63: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 67: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 68: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 73: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 74: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 75: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,015 INFO L273 TraceCheckUtils]: 76: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 77: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 78: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 79: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 80: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 81: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 82: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,016 INFO L273 TraceCheckUtils]: 83: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 84: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 87: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 88: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 92: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 94: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 95: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,018 INFO L273 TraceCheckUtils]: 96: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 97: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 98: Hoare triple {12973#false} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 99: Hoare triple {12973#false} havoc ~x~0;~x~0 := 0; {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 100: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {12973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L256 TraceCheckUtils]: 102: Hoare triple {12973#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12973#false} is VALID [2018-11-14 18:40:56,019 INFO L273 TraceCheckUtils]: 103: Hoare triple {12973#false} ~cond := #in~cond; {12973#false} is VALID [2018-11-14 18:40:56,020 INFO L273 TraceCheckUtils]: 104: Hoare triple {12973#false} assume ~cond == 0; {12973#false} is VALID [2018-11-14 18:40:56,020 INFO L273 TraceCheckUtils]: 105: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-14 18:40:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 18:40:56,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:56,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 18:40:56,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-14 18:40:56,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:56,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:40:56,165 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 18:40:56,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:40:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:40:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:40:56,166 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 26 states. [2018-11-14 18:40:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:57,239 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-11-14 18:40:57,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:40:57,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-14 18:40:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:40:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-14 18:40:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:40:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-14 18:40:57,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 135 transitions. [2018-11-14 18:40:57,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:57,367 INFO L225 Difference]: With dead ends: 174 [2018-11-14 18:40:57,367 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 18:40:57,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:40:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 18:40:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-14 18:40:57,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:57,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-14 18:40:57,438 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-14 18:40:57,438 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-14 18:40:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:57,440 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-14 18:40:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-14 18:40:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:57,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:57,441 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-14 18:40:57,441 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-14 18:40:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:57,443 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-14 18:40:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-14 18:40:57,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:57,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:57,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:57,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 18:40:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-11-14 18:40:57,446 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 106 [2018-11-14 18:40:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:57,446 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-11-14 18:40:57,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:40:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-14 18:40:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-14 18:40:57,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:57,447 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:57,447 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:57,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash 852726059, now seen corresponding path program 23 times [2018-11-14 18:40:57,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:57,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:57,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:57,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:57,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:57,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2018-11-14 18:40:57,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {13970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13970#true} is VALID [2018-11-14 18:40:57,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2018-11-14 18:40:57,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #64#return; {13970#true} is VALID [2018-11-14 18:40:57,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret2 := main(); {13970#true} is VALID [2018-11-14 18:40:57,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {13970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13972#(= main_~i~0 0)} is VALID [2018-11-14 18:40:57,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {13972#(= main_~i~0 0)} assume true; {13972#(= main_~i~0 0)} is VALID [2018-11-14 18:40:57,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {13972#(= 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; {13973#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:57,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {13973#(<= main_~i~0 1)} assume true; {13973#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:57,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {13973#(<= 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; {13974#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:57,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {13974#(<= main_~i~0 2)} assume true; {13974#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:57,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {13974#(<= 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; {13975#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:57,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {13975#(<= main_~i~0 3)} assume true; {13975#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:57,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {13975#(<= 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; {13976#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:57,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {13976#(<= main_~i~0 4)} assume true; {13976#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:57,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {13976#(<= 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; {13977#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:57,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {13977#(<= main_~i~0 5)} assume true; {13977#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:57,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {13977#(<= 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; {13978#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:57,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {13978#(<= main_~i~0 6)} assume true; {13978#(<= main_~i~0 6)} is VALID [2018-11-14 18:40:57,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {13978#(<= 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; {13979#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:57,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 7)} assume true; {13979#(<= main_~i~0 7)} is VALID [2018-11-14 18:40:57,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= 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; {13980#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:57,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 8)} assume true; {13980#(<= main_~i~0 8)} is VALID [2018-11-14 18:40:57,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= 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; {13981#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:57,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {13981#(<= main_~i~0 9)} assume true; {13981#(<= main_~i~0 9)} is VALID [2018-11-14 18:40:57,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {13981#(<= 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; {13982#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:57,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {13982#(<= main_~i~0 10)} assume true; {13982#(<= main_~i~0 10)} is VALID [2018-11-14 18:40:57,918 INFO L273 TraceCheckUtils]: 27: Hoare triple {13982#(<= 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; {13983#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:57,919 INFO L273 TraceCheckUtils]: 28: Hoare triple {13983#(<= main_~i~0 11)} assume true; {13983#(<= main_~i~0 11)} is VALID [2018-11-14 18:40:57,920 INFO L273 TraceCheckUtils]: 29: Hoare triple {13983#(<= 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; {13984#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:57,920 INFO L273 TraceCheckUtils]: 30: Hoare triple {13984#(<= main_~i~0 12)} assume true; {13984#(<= main_~i~0 12)} is VALID [2018-11-14 18:40:57,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {13984#(<= 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; {13985#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:57,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {13985#(<= main_~i~0 13)} assume true; {13985#(<= main_~i~0 13)} is VALID [2018-11-14 18:40:57,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {13985#(<= 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; {13986#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:57,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {13986#(<= main_~i~0 14)} assume true; {13986#(<= main_~i~0 14)} is VALID [2018-11-14 18:40:57,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {13986#(<= 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; {13987#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:57,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {13987#(<= main_~i~0 15)} assume true; {13987#(<= main_~i~0 15)} is VALID [2018-11-14 18:40:57,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {13987#(<= 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; {13988#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:57,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {13988#(<= main_~i~0 16)} assume true; {13988#(<= main_~i~0 16)} is VALID [2018-11-14 18:40:57,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {13988#(<= 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; {13989#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:57,927 INFO L273 TraceCheckUtils]: 40: Hoare triple {13989#(<= main_~i~0 17)} assume true; {13989#(<= main_~i~0 17)} is VALID [2018-11-14 18:40:57,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {13989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13990#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:57,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {13990#(<= main_~i~0 18)} assume true; {13990#(<= main_~i~0 18)} is VALID [2018-11-14 18:40:57,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {13990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13991#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:57,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {13991#(<= main_~i~0 19)} assume true; {13991#(<= main_~i~0 19)} is VALID [2018-11-14 18:40:57,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {13991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13992#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:57,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {13992#(<= main_~i~0 20)} assume true; {13992#(<= main_~i~0 20)} is VALID [2018-11-14 18:40:57,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {13992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13993#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:57,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {13993#(<= main_~i~0 21)} assume true; {13993#(<= main_~i~0 21)} is VALID [2018-11-14 18:40:57,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {13993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13994#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:57,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {13994#(<= main_~i~0 22)} assume true; {13994#(<= main_~i~0 22)} is VALID [2018-11-14 18:40:57,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {13994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13995#(<= main_~i~0 23)} is VALID [2018-11-14 18:40:57,936 INFO L273 TraceCheckUtils]: 52: Hoare triple {13995#(<= main_~i~0 23)} assume true; {13995#(<= main_~i~0 23)} is VALID [2018-11-14 18:40:57,937 INFO L273 TraceCheckUtils]: 53: Hoare triple {13995#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-14 18:40:57,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {13971#false} ~i~0 := 0; {13971#false} is VALID [2018-11-14 18:40:57,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,937 INFO L273 TraceCheckUtils]: 56: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,938 INFO L273 TraceCheckUtils]: 57: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,938 INFO L273 TraceCheckUtils]: 58: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,938 INFO L273 TraceCheckUtils]: 59: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,938 INFO L273 TraceCheckUtils]: 60: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,938 INFO L273 TraceCheckUtils]: 61: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 62: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 63: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 64: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 65: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 66: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 67: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,939 INFO L273 TraceCheckUtils]: 68: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 69: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 70: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 72: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 73: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 74: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 75: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 76: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,940 INFO L273 TraceCheckUtils]: 77: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 78: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 79: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 80: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 81: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 82: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 83: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 84: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,941 INFO L273 TraceCheckUtils]: 85: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 86: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 87: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 88: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 89: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 90: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 91: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 92: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,942 INFO L273 TraceCheckUtils]: 94: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 95: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 96: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 97: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 98: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 99: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 100: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 101: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 102: Hoare triple {13971#false} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-14 18:40:57,943 INFO L273 TraceCheckUtils]: 103: Hoare triple {13971#false} havoc ~x~0;~x~0 := 0; {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L273 TraceCheckUtils]: 104: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L273 TraceCheckUtils]: 105: Hoare triple {13971#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L256 TraceCheckUtils]: 106: Hoare triple {13971#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L273 TraceCheckUtils]: 107: Hoare triple {13971#false} ~cond := #in~cond; {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L273 TraceCheckUtils]: 108: Hoare triple {13971#false} assume ~cond == 0; {13971#false} is VALID [2018-11-14 18:40:57,944 INFO L273 TraceCheckUtils]: 109: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2018-11-14 18:40:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-11-14 18:40:57,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:57,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:40:57,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1