java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:53:44,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:53:44,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:53:44,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:53:44,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:53:44,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:53:44,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:53:44,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:53:44,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:53:44,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:53:44,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:53:44,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:53:44,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:53:44,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:53:44,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:53:44,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:53:44,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:53:44,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:53:44,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:53:44,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:53:44,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:53:44,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:53:44,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:53:44,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:53:44,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:53:44,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:53:44,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:53:44,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:53:44,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:53:44,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:53:44,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:53:44,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:53:44,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:53:44,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:53:44,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:53:44,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:53:44,348 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:53:44,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:53:44,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:53:44,369 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:53:44,369 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:53:44,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:53:44,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:53:44,370 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:53:44,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:53:44,371 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:53:44,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:53:44,371 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:53:44,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:53:44,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:53:44,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:53:44,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:53:44,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:53:44,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:53:44,372 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:53:44,373 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:53:44,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:53:44,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:53:44,373 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:53:44,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:53:44,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:53:44,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:53:44,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:53:44,374 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:53:44,374 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:53:44,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:53:44,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:53:44,375 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:53:44,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:53:44,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:53:44,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:53:44,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:53:44,449 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:53:44,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_true-unreach-call_ground.i [2018-11-18 22:53:44,513 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43fe1d5bd/25b4d423267f4f14b8b4939c334179a9/FLAG948eea15c [2018-11-18 22:53:44,990 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:53:44,991 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_true-unreach-call_ground.i [2018-11-18 22:53:44,998 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43fe1d5bd/25b4d423267f4f14b8b4939c334179a9/FLAG948eea15c [2018-11-18 22:53:45,351 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43fe1d5bd/25b4d423267f4f14b8b4939c334179a9 [2018-11-18 22:53:45,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:53:45,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:53:45,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:45,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:53:45,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:53:45,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7439ee7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45, skipping insertion in model container [2018-11-18 22:53:45,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:53:45,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:53:45,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:45,621 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:53:45,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:45,669 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:53:45,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45 WrapperNode [2018-11-18 22:53:45,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:45,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:53:45,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:53:45,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:53:45,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (1/1) ... [2018-11-18 22:53:45,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:53:45,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:53:45,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:53:45,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:53:45,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (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-18 22:53:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:53:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:53:45,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:53:45,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:53:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:53:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:53:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:53:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:53:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:53:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:53:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:53:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:53:45,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:53:45,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:53:46,442 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:53:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:46 BoogieIcfgContainer [2018-11-18 22:53:46,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:53:46,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:53:46,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:53:46,448 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:53:46,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:53:45" (1/3) ... [2018-11-18 22:53:46,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce9b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:46, skipping insertion in model container [2018-11-18 22:53:46,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:45" (2/3) ... [2018-11-18 22:53:46,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce9b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:46, skipping insertion in model container [2018-11-18 22:53:46,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:46" (3/3) ... [2018-11-18 22:53:46,452 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_true-unreach-call_ground.i [2018-11-18 22:53:46,461 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:53:46,470 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:53:46,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:53:46,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:53:46,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:53:46,520 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:53:46,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:53:46,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:53:46,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:53:46,521 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:53:46,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:53:46,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:53:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-18 22:53:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:53:46,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:46,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:46,551 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:46,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash 339384385, now seen corresponding path program 1 times [2018-11-18 22:53:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:46,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:46,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:46,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-18 22:53:46,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-18 22:53:46,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-18 22:53:46,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #64#return; {31#true} is VALID [2018-11-18 22:53:46,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-18 22:53:46,713 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-18 22:53:46,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-18 22:53:46,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2018-11-18 22:53:46,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2018-11-18 22:53:46,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} havoc ~x~0;~x~0 := 0; {32#false} is VALID [2018-11-18 22:53:46,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-18 22:53:46,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32#false} is VALID [2018-11-18 22:53:46,717 INFO L256 TraceCheckUtils]: 12: Hoare triple {32#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {32#false} is VALID [2018-11-18 22:53:46,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-18 22:53:46,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-18 22:53:46,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-18 22:53:46,721 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-18 22:53:46,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:46,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:53:46,728 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:53:46,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:46,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:53:46,793 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-18 22:53:46,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:53:46,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:53:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:53:46,807 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-18 22:53:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:46,970 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-18 22:53:46,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:53:46,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:53:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-18 22:53:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-18 22:53:46,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 59 transitions. [2018-11-18 22:53:47,380 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-18 22:53:47,393 INFO L225 Difference]: With dead ends: 48 [2018-11-18 22:53:47,393 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 22:53:47,397 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-18 22:53:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 22:53:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 22:53:47,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:47,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-18 22:53:47,446 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 22:53:47,446 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 22:53:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:47,450 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 22:53:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:53:47,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:47,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:47,451 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 22:53:47,451 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 22:53:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:47,456 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 22:53:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:53:47,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:47,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:47,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:47,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:53:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 22:53:47,462 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-18 22:53:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:47,462 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 22:53:47,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:53:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:53:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:53:47,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:47,464 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-18 22:53:47,464 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:47,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -665726485, now seen corresponding path program 1 times [2018-11-18 22:53:47,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:47,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:47,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:47,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:47,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:47,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-18 22:53:47,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {174#true} is VALID [2018-11-18 22:53:47,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-18 22:53:47,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #64#return; {174#true} is VALID [2018-11-18 22:53:47,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret2 := main(); {174#true} is VALID [2018-11-18 22:53:47,637 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-18 22:53:47,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#(= main_~i~0 0)} assume true; {176#(= main_~i~0 0)} is VALID [2018-11-18 22:53:47,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#(= main_~i~0 0)} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-18 22:53:47,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {175#false} ~i~0 := 0; {175#false} is VALID [2018-11-18 22:53:47,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-18 22:53:47,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {175#false} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-18 22:53:47,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {175#false} havoc ~x~0;~x~0 := 0; {175#false} is VALID [2018-11-18 22:53:47,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-18 22:53:47,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {175#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {175#false} is VALID [2018-11-18 22:53:47,641 INFO L256 TraceCheckUtils]: 14: Hoare triple {175#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {175#false} is VALID [2018-11-18 22:53:47,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2018-11-18 22:53:47,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2018-11-18 22:53:47,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-18 22:53:47,643 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-18 22:53:47,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:47,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:53:47,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:53:47,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:47,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:53:47,699 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-18 22:53:47,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:53:47,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:53:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:53:47,700 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-18 22:53:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:47,859 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-18 22:53:47,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:53:47,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:53:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-18 22:53:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-18 22:53:47,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-18 22:53:48,128 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-18 22:53:48,130 INFO L225 Difference]: With dead ends: 42 [2018-11-18 22:53:48,130 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 22:53:48,132 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-18 22:53:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 22:53:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 22:53:48,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:48,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-18 22:53:48,270 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:53:48,270 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:53:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:48,272 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 22:53:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:53:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:48,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:48,273 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:53:48,273 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:53:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:48,276 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 22:53:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:53:48,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:48,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:48,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:48,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:53:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-18 22:53:48,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-18 22:53:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 22:53:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:53:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:53:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 22:53:48,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:48,282 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-18 22:53:48,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:48,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1817372075, now seen corresponding path program 1 times [2018-11-18 22:53:48,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:48,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-18 22:53:48,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-18 22:53:48,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-18 22:53:48,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-18 22:53:48,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-18 22:53:48,426 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-18 22:53:48,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(= main_~i~0 0)} assume true; {330#(= main_~i~0 0)} is VALID [2018-11-18 22:53:48,453 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:48,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:48,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:53:48,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-18 22:53:48,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {329#false} is VALID [2018-11-18 22:53:48,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:53:48,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-18 22:53:48,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {329#false} is VALID [2018-11-18 22:53:48,460 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {329#false} is VALID [2018-11-18 22:53:48,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-18 22:53:48,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume 0 == ~cond; {329#false} is VALID [2018-11-18 22:53:48,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-18 22:53:48,463 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-18 22:53:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:48,463 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-18 22:53:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:48,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:48,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-18 22:53:48,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-18 22:53:48,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-18 22:53:48,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-18 22:53:48,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-18 22:53:48,641 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-18 22:53:48,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {350#(<= main_~i~0 0)} assume true; {350#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:48,644 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:48,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:48,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:53:48,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-18 22:53:48,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {329#false} is VALID [2018-11-18 22:53:48,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:53:48,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-18 22:53:48,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:53:48,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {329#false} is VALID [2018-11-18 22:53:48,652 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {329#false} is VALID [2018-11-18 22:53:48,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-18 22:53:48,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume 0 == ~cond; {329#false} is VALID [2018-11-18 22:53:48,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-18 22:53:48,654 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-18 22:53:48,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:53:48,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 22:53:48,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:48,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:53:48,790 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-18 22:53:48,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:53:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:53:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:53:48,791 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-11-18 22:53:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:49,161 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 22:53:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:53:49,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 22:53:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:53:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:53:49,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-18 22:53:49,255 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-18 22:53:49,257 INFO L225 Difference]: With dead ends: 48 [2018-11-18 22:53:49,257 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 22:53:49,257 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-18 22:53:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 22:53:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 22:53:49,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:49,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 22:53:49,278 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 22:53:49,278 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 22:53:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:49,281 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 22:53:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:53:49,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:49,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:49,282 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 22:53:49,283 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 22:53:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:49,285 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 22:53:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:53:49,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:49,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:49,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:49,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:53:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-18 22:53:49,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-18 22:53:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:49,289 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 22:53:49,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:53:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:53:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 22:53:49,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:49,290 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-18 22:53:49,291 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:49,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1737156203, now seen corresponding path program 2 times [2018-11-18 22:53:49,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:49,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:49,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-18 22:53:49,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-18 22:53:49,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-18 22:53:49,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-18 22:53:49,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-18 22:53:49,455 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-18 22:53:49,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(= main_~i~0 0)} assume true; {572#(= main_~i~0 0)} is VALID [2018-11-18 22:53:49,473 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:49,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:49,490 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:49,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:49,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:53:49,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-18 22:53:49,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:53:49,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:53:49,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:53:49,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-18 22:53:49,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {571#false} is VALID [2018-11-18 22:53:49,497 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {571#false} is VALID [2018-11-18 22:53:49,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-18 22:53:49,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume 0 == ~cond; {571#false} is VALID [2018-11-18 22:53:49,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-18 22:53:49,499 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-18 22:53:49,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:49,500 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-18 22:53:49,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:49,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:49,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:49,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:49,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-18 22:53:49,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-18 22:53:49,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-18 22:53:49,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-18 22:53:49,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-18 22:53:49,683 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-18 22:53:49,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {593#(<= main_~i~0 0)} assume true; {593#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:49,685 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:49,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:49,688 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:49,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:49,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:53:49,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-18 22:53:49,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:53:49,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:53:49,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:53:49,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-18 22:53:49,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:53:49,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {571#false} is VALID [2018-11-18 22:53:49,694 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {571#false} is VALID [2018-11-18 22:53:49,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-18 22:53:49,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume 0 == ~cond; {571#false} is VALID [2018-11-18 22:53:49,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-18 22:53:49,697 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-18 22:53:49,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:49,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:53:49,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 22:53:49,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:49,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:53:49,776 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-18 22:53:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:53:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:53:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:49,777 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2018-11-18 22:53:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:49,925 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-18 22:53:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:53:49,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 22:53:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 22:53:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 22:53:49,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-18 22:53:50,026 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-18 22:53:50,028 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:53:50,028 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 22:53:50,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 22:53:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 22:53:50,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:50,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-18 22:53:50,059 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 22:53:50,059 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 22:53:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:50,062 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 22:53:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:53:50,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:50,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:50,063 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 22:53:50,063 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 22:53:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:50,067 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 22:53:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:53:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:50,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:50,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:50,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:53:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-18 22:53:50,071 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2018-11-18 22:53:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:50,071 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 22:53:50,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:53:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:53:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:53:50,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:50,072 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-18 22:53:50,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:50,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1942219733, now seen corresponding path program 3 times [2018-11-18 22:53:50,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:50,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:50,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:50,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-18 22:53:50,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-18 22:53:50,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-18 22:53:50,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-18 22:53:50,202 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-18 22:53:50,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(= main_~i~0 0)} assume true; {850#(= main_~i~0 0)} is VALID [2018-11-18 22:53:50,204 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:50,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:50,206 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:50,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:50,208 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:50,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:50,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:53:50,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {849#false} ~i~0 := 0; {849#false} is VALID [2018-11-18 22:53:50,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:53:50,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:53:50,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:53:50,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,213 INFO L273 TraceCheckUtils]: 22: Hoare triple {849#false} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:53:50,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-18 22:53:50,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {849#false} is VALID [2018-11-18 22:53:50,214 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {849#false} is VALID [2018-11-18 22:53:50,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-18 22:53:50,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume 0 == ~cond; {849#false} is VALID [2018-11-18 22:53:50,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-18 22:53:50,216 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-18 22:53:50,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:50,216 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-18 22:53:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:50,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:53:50,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:50,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:50,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-18 22:53:50,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-18 22:53:50,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-18 22:53:50,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-18 22:53:50,416 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-18 22:53:50,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:53:50,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:53:50,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:53:50,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:53:50,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {848#true} assume !(~i~0 < 100000); {848#true} is VALID [2018-11-18 22:53:50,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {848#true} ~i~0 := 0; {899#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:50,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#(<= main_~i~0 0)} assume true; {899#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:50,421 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:50,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:50,436 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:50,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:50,438 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:50,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:50,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:53:50,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-18 22:53:50,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:53:50,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {849#false} is VALID [2018-11-18 22:53:50,440 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {849#false} is VALID [2018-11-18 22:53:50,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-18 22:53:50,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume 0 == ~cond; {849#false} is VALID [2018-11-18 22:53:50,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-18 22:53:50,443 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-18 22:53:50,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:50,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:53:50,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-18 22:53:50,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:50,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:53:50,509 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-18 22:53:50,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:53:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:53:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:53:50,510 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-18 22:53:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:50,705 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-18 22:53:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:53:50,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-18 22:53:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-18 22:53:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-18 22:53:50,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2018-11-18 22:53:50,881 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-18 22:53:50,883 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:53:50,883 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:53:50,884 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-18 22:53:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:53:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 22:53:50,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:50,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-18 22:53:50,901 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:53:50,901 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:53:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:50,904 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 22:53:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:53:50,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:50,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:50,905 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:53:50,905 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:53:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:50,907 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 22:53:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:53:50,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:50,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:50,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:50,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:53:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-18 22:53:50,911 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 30 [2018-11-18 22:53:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:50,911 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 22:53:50,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:53:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:53:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:53:50,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:50,913 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-18 22:53:50,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:50,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash -732385557, now seen corresponding path program 4 times [2018-11-18 22:53:50,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:50,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:50,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:50,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:50,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:51,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-18 22:53:51,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-18 22:53:51,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-18 22:53:51,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-18 22:53:51,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-18 22:53:51,066 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-18 22:53:51,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {1164#(= main_~i~0 0)} assume true; {1164#(= main_~i~0 0)} is VALID [2018-11-18 22:53:51,069 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:51,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:51,070 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:51,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:51,071 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:51,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:51,102 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:51,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:51,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:53:51,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-18 22:53:51,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:53:51,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-18 22:53:51,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1163#false} is VALID [2018-11-18 22:53:51,130 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1163#false} is VALID [2018-11-18 22:53:51,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-18 22:53:51,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2018-11-18 22:53:51,131 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-18 22:53:51,133 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-18 22:53:51,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:51,133 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-18 22:53:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:51,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:51,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:51,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:51,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-18 22:53:51,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-18 22:53:51,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-18 22:53:51,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-18 22:53:51,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-18 22:53:51,404 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-18 22:53:51,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {1187#(<= main_~i~0 0)} assume true; {1187#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:51,405 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:51,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:51,406 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:51,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:51,409 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:51,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:51,411 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:51,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:51,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:53:51,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-18 22:53:51,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:53:51,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:53:51,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-18 22:53:51,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:53:51,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1163#false} is VALID [2018-11-18 22:53:51,417 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1163#false} is VALID [2018-11-18 22:53:51,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-18 22:53:51,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2018-11-18 22:53:51,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-18 22:53:51,420 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-18 22:53:51,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:51,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:53:51,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 22:53:51,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:51,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:53:51,502 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-18 22:53:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:53:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:53:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:53:51,503 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 8 states. [2018-11-18 22:53:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:51,631 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-18 22:53:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:53:51,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 22:53:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-18 22:53:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-18 22:53:51,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-18 22:53:51,757 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-18 22:53:51,761 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:53:51,761 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 22:53:51,762 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-18 22:53:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 22:53:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 22:53:51,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:51,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-18 22:53:51,876 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:53:51,876 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:53:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:51,878 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 22:53:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:53:51,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:51,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:51,879 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:53:51,879 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:53:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:51,881 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 22:53:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:53:51,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:51,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:51,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:51,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:53:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-18 22:53:51,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-11-18 22:53:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:51,885 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-18 22:53:51,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:53:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:53:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:53:51,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:51,886 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-18 22:53:51,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:51,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1518143829, now seen corresponding path program 5 times [2018-11-18 22:53:51,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:51,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:52,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-18 22:53:52,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-18 22:53:52,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-18 22:53:52,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-18 22:53:52,049 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-18 22:53:52,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {1514#(= main_~i~0 0)} assume true; {1514#(= main_~i~0 0)} is VALID [2018-11-18 22:53:52,050 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:52,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:52,051 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:52,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:52,052 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:52,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:52,054 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:52,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:52,056 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:52,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:52,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:53:52,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {1513#false} ~i~0 := 0; {1513#false} is VALID [2018-11-18 22:53:52,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:53:52,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:53:52,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:53:52,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:53:52,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:53:52,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {1513#false} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:53:52,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-18 22:53:52,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1513#false} is VALID [2018-11-18 22:53:52,063 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1513#false} is VALID [2018-11-18 22:53:52,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-18 22:53:52,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume 0 == ~cond; {1513#false} is VALID [2018-11-18 22:53:52,064 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-18 22:53:52,066 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-18 22:53:52,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:52,067 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-18 22:53:52,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:53:52,143 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:53:52,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:52,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:52,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-18 22:53:52,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-18 22:53:52,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-18 22:53:52,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-18 22:53:52,280 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-18 22:53:52,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:53:52,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:53:52,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:53:52,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:53:52,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:53:52,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:53:52,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#true} assume !(~i~0 < 100000); {1512#true} is VALID [2018-11-18 22:53:52,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#true} ~i~0 := 0; {1577#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:52,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {1577#(<= main_~i~0 0)} assume true; {1577#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:52,289 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:52,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:52,291 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:52,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:52,292 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:52,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:52,297 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:52,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:52,299 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:52,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:52,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:53:52,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-18 22:53:52,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:53:52,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1513#false} is VALID [2018-11-18 22:53:52,301 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1513#false} is VALID [2018-11-18 22:53:52,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-18 22:53:52,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume 0 == ~cond; {1513#false} is VALID [2018-11-18 22:53:52,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-18 22:53:52,305 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-18 22:53:52,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:52,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:53:52,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:53:52,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:52,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:53:52,389 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-18 22:53:52,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:53:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:53:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:53:52,390 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2018-11-18 22:53:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:52,614 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-18 22:53:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:53:52,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:53:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:53:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:53:52,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-18 22:53:52,728 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-18 22:53:52,729 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:53:52,729 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:53:52,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:53:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:53:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-18 22:53:52,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:52,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-18 22:53:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:53:52,937 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:53:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:52,939 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 22:53:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:53:52,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:52,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:52,940 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:53:52,940 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:53:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:52,942 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 22:53:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:53:52,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:52,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:52,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:52,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:53:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-18 22:53:52,945 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-11-18 22:53:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:52,945 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-18 22:53:52,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:53:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:53:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:53:52,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:52,946 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-18 22:53:52,947 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:52,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash 84749163, now seen corresponding path program 6 times [2018-11-18 22:53:52,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:52,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:52,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:53,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-18 22:53:53,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-18 22:53:53,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-18 22:53:53,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-18 22:53:53,122 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-18 22:53:53,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(= main_~i~0 0)} assume true; {1900#(= main_~i~0 0)} is VALID [2018-11-18 22:53:53,124 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:53,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:53,125 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:53,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:53,126 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:53,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:53,128 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:53,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:53,130 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:53,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:53,139 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:53,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:53,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:53:53,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#false} ~i~0 := 0; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#false} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1899#false} is VALID [2018-11-18 22:53:53,144 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1899#false} is VALID [2018-11-18 22:53:53,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-18 22:53:53,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-18 22:53:53,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-18 22:53:53,147 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-18 22:53:53,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:53,147 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-18 22:53:53,159 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:53:53,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:53:53,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:53,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:53,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-18 22:53:53,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-18 22:53:53,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-18 22:53:53,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-18 22:53:53,519 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-18 22:53:53,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:53:53,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:53:53,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:53:53,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:53:53,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:53:53,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:53:53,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1961#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:53,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {1961#(<= main_~i~0 100000)} assume true; {1961#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:53,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {1961#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {1898#true} is VALID [2018-11-18 22:53:53,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {1898#true} ~i~0 := 0; {1971#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:53,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {1971#(<= main_~i~0 0)} assume true; {1971#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:53,528 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:53,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:53,529 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:53,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:53,530 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:53,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:53,532 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:53,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:53,534 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:53,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:53,536 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:53,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:53,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:53:53,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-18 22:53:53,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:53:53,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1899#false} is VALID [2018-11-18 22:53:53,539 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1899#false} is VALID [2018-11-18 22:53:53,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-18 22:53:53,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-18 22:53:53,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-18 22:53:53,543 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-18 22:53:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:53,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-18 22:53:53,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-18 22:53:53,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:53,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:53:53,618 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-18 22:53:53,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:53:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:53:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:53:53,619 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 11 states. [2018-11-18 22:53:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:54,018 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-18 22:53:54,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:53:54,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-18 22:53:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-18 22:53:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-18 22:53:54,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2018-11-18 22:53:54,286 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-18 22:53:54,288 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:53:54,288 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:53:54,288 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-18 22:53:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:53:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-18 22:53:54,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:54,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-18 22:53:54,321 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-18 22:53:54,321 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-18 22:53:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:54,323 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 22:53:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:53:54,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:54,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:54,323 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-18 22:53:54,323 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-18 22:53:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:54,325 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 22:53:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:53:54,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:54,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:54,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:54,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:53:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-18 22:53:54,328 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 42 [2018-11-18 22:53:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-18 22:53:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:53:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:53:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 22:53:54,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:54,329 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-18 22:53:54,329 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash -872837845, now seen corresponding path program 7 times [2018-11-18 22:53:54,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:54,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:54,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-18 22:53:54,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-18 22:53:54,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-18 22:53:54,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-18 22:53:54,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-18 22:53:54,525 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-18 22:53:54,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(= main_~i~0 0)} assume true; {2323#(= main_~i~0 0)} is VALID [2018-11-18 22:53:54,526 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:54,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:54,527 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:54,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:54,528 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:54,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:54,529 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:54,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:54,530 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:54,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:54,531 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:54,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:54,533 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:54,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:54,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:53:54,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-18 22:53:54,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:54,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,539 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:53:54,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-18 22:53:54,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:54,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2322#false} is VALID [2018-11-18 22:53:54,539 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2322#false} is VALID [2018-11-18 22:53:54,540 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-18 22:53:54,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume 0 == ~cond; {2322#false} is VALID [2018-11-18 22:53:54,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-18 22:53:54,541 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-18 22:53:54,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:54,541 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-18 22:53:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:54,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:55,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-18 22:53:55,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-18 22:53:55,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-18 22:53:55,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-18 22:53:55,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-18 22:53:55,265 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-18 22:53:55,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {2349#(<= main_~i~0 0)} assume true; {2349#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:55,266 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:55,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:55,267 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:55,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:55,268 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:55,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:55,269 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:55,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:55,270 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:55,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:55,272 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:55,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:55,273 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:55,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:55,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:53:55,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-18 22:53:55,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:53:55,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:53:55,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-18 22:53:55,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:53:55,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2322#false} is VALID [2018-11-18 22:53:55,279 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2322#false} is VALID [2018-11-18 22:53:55,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-18 22:53:55,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume 0 == ~cond; {2322#false} is VALID [2018-11-18 22:53:55,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-18 22:53:55,281 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-18 22:53:55,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:55,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:53:55,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-18 22:53:55,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:55,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:53:55,332 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-18 22:53:55,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:53:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:53:55,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:53:55,333 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 11 states. [2018-11-18 22:53:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,650 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-18 22:53:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:53:55,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-18 22:53:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-18 22:53:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-18 22:53:55,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2018-11-18 22:53:55,734 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-18 22:53:55,735 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:53:55,735 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 22:53:55,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:53:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 22:53:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 22:53:55,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:55,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-18 22:53:55,764 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-18 22:53:55,764 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-18 22:53:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,766 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:53:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:53:55,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:55,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:55,767 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-18 22:53:55,767 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-18 22:53:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:55,769 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:53:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:53:55,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:55,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:55,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:55,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 22:53:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-18 22:53:55,771 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 46 [2018-11-18 22:53:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:55,772 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-18 22:53:55,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:53:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:53:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:53:55,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:55,773 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-18 22:53:55,773 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:55,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -621126677, now seen corresponding path program 8 times [2018-11-18 22:53:55,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:55,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-18 22:53:55,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-18 22:53:55,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-18 22:53:55,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-18 22:53:55,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-18 22:53:55,946 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-18 22:53:55,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {2781#(= main_~i~0 0)} assume true; {2781#(= main_~i~0 0)} is VALID [2018-11-18 22:53:55,947 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:55,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:55,948 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:55,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:55,950 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:55,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:55,952 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:55,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:55,955 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:55,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:55,958 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:55,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:55,959 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:55,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:55,959 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:55,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:55,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:53:55,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,963 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-18 22:53:55,964 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2780#false} is VALID [2018-11-18 22:53:55,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-18 22:53:55,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-18 22:53:55,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-18 22:53:55,966 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-18 22:53:55,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:55,967 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-18 22:53:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:56,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:56,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:56,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:56,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-18 22:53:56,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-18 22:53:56,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-18 22:53:56,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-18 22:53:56,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-18 22:53:56,278 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-18 22:53:56,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {2808#(<= main_~i~0 0)} assume true; {2808#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:56,280 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:56,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:56,282 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:56,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:56,285 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:56,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:56,287 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:56,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:56,289 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:56,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:56,292 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:56,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:56,293 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:56,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:56,296 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:56,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:56,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:53:56,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-18 22:53:56,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,299 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,299 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,300 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,300 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-18 22:53:56,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:53:56,302 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-18 22:53:56,302 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2780#false} is VALID [2018-11-18 22:53:56,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-18 22:53:56,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-18 22:53:56,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-18 22:53:56,304 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-18 22:53:56,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:56,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:53:56,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 22:53:56,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:56,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:53:56,379 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-18 22:53:56,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:53:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:53:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:56,380 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-11-18 22:53:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:56,901 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-11-18 22:53:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:53:56,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 22:53:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-18 22:53:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-18 22:53:56,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 79 transitions. [2018-11-18 22:53:56,982 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-18 22:53:56,983 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:53:56,983 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 22:53:56,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 22:53:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-18 22:53:57,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:57,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-18 22:53:57,028 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-18 22:53:57,028 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-18 22:53:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:57,029 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-18 22:53:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:53:57,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:57,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:57,030 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-18 22:53:57,030 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-18 22:53:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:57,032 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-18 22:53:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:53:57,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:57,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:57,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:57,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:53:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-18 22:53:57,034 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 50 [2018-11-18 22:53:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:57,034 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-18 22:53:57,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:53:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:53:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:53:57,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:57,035 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-18 22:53:57,036 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:57,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1316083627, now seen corresponding path program 9 times [2018-11-18 22:53:57,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:57,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:57,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-18 22:53:57,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-18 22:53:57,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-18 22:53:57,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-18 22:53:57,432 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-18 22:53:57,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {3275#(= main_~i~0 0)} assume true; {3275#(= main_~i~0 0)} is VALID [2018-11-18 22:53:57,433 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,434 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:57,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:57,435 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:57,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:57,436 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:57,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:57,437 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:57,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:57,439 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:57,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:57,440 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:57,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:57,442 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:57,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:57,443 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:57,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:57,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:53:57,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {3274#false} ~i~0 := 0; {3274#false} is VALID [2018-11-18 22:53:57,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,448 INFO L273 TraceCheckUtils]: 39: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,448 INFO L273 TraceCheckUtils]: 40: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 41: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 42: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 43: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 44: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 45: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,449 INFO L273 TraceCheckUtils]: 46: Hoare triple {3274#false} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:53:57,450 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-18 22:53:57,450 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3274#false} is VALID [2018-11-18 22:53:57,450 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3274#false} is VALID [2018-11-18 22:53:57,450 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-18 22:53:57,451 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume 0 == ~cond; {3274#false} is VALID [2018-11-18 22:53:57,451 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-18 22:53:57,453 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-18 22:53:57,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:57,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 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-18 22:53:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:57,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:53:57,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:57,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-18 22:53:57,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-18 22:53:57,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-18 22:53:57,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-18 22:53:57,816 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-18 22:53:57,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:53:57,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:53:57,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {3273#true} assume !(~i~0 < 100000); {3273#true} is VALID [2018-11-18 22:53:57,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {3273#true} ~i~0 := 0; {3366#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:57,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {3366#(<= main_~i~0 0)} assume true; {3366#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:57,840 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:57,841 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:57,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:57,843 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:57,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:57,846 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:57,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:57,847 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:57,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:57,849 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:57,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:57,851 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:57,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:57,852 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:57,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:57,854 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:57,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:57,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:53:57,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-18 22:53:57,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:53:57,856 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3274#false} is VALID [2018-11-18 22:53:57,856 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3274#false} is VALID [2018-11-18 22:53:57,857 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-18 22:53:57,857 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume 0 == ~cond; {3274#false} is VALID [2018-11-18 22:53:57,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-18 22:53:57,860 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-18 22:53:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:53:57,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-18 22:53:57,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:57,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:53:57,948 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-18 22:53:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:53:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:53:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:57,949 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-11-18 22:53:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,180 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-18 22:53:58,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:53:58,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-18 22:53:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-18 22:53:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-18 22:53:58,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 83 transitions. [2018-11-18 22:53:58,259 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-18 22:53:58,261 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:53:58,261 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:53:58,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:53:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-18 22:53:58,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:58,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-18 22:53:58,311 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-18 22:53:58,311 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-18 22:53:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,313 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:53:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:53:58,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:58,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:58,314 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-18 22:53:58,314 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-18 22:53:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:58,315 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:53:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:53:58,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:58,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:58,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:58,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 22:53:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-18 22:53:58,317 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 54 [2018-11-18 22:53:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:58,317 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-18 22:53:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:53:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:53:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 22:53:58,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:58,318 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-18 22:53:58,318 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:58,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1301135253, now seen corresponding path program 10 times [2018-11-18 22:53:58,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:58,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:58,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-18 22:53:58,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-18 22:53:58,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-18 22:53:58,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-18 22:53:58,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-18 22:53:58,492 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-18 22:53:58,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {3805#(= main_~i~0 0)} assume true; {3805#(= main_~i~0 0)} is VALID [2018-11-18 22:53:58,494 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,495 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,497 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:58,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:58,499 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:58,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:58,501 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:58,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:58,502 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:58,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:58,515 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:58,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:58,517 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:58,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:58,518 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:58,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:58,519 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:58,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:58,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:53:58,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-18 22:53:58,520 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,524 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-18 22:53:58,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3804#false} is VALID [2018-11-18 22:53:58,526 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3804#false} is VALID [2018-11-18 22:53:58,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-18 22:53:58,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2018-11-18 22:53:58,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-18 22:53:58,528 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-18 22:53:58,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:58,529 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-18 22:53:58,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:58,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:58,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:58,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:58,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-18 22:53:58,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-18 22:53:58,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-18 22:53:58,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-18 22:53:58,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-18 22:53:58,732 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-18 22:53:58,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {3834#(<= main_~i~0 0)} assume true; {3834#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:58,756 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:58,782 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:58,804 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:58,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:58,826 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:58,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:58,828 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:58,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:58,831 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:58,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:58,832 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:58,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:58,833 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:58,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:58,835 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:58,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:58,836 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:58,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:58,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:53:58,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-18 22:53:58,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,839 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2018-11-18 22:53:58,842 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-18 22:53:58,844 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-18 22:53:58,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:53:58,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-18 22:53:58,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:58,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:53:58,899 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-18 22:53:58,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:53:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:53:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:53:58,900 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 14 states. [2018-11-18 22:53:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:59,224 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-18 22:53:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:53:59,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-18 22:53:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:53:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-18 22:53:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:53:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-18 22:53:59,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 87 transitions. [2018-11-18 22:53:59,353 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-18 22:53:59,355 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:53:59,355 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 22:53:59,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:53:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 22:53:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 22:53:59,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:59,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-18 22:53:59,409 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-18 22:53:59,409 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-18 22:53:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:59,410 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-18 22:53:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:53:59,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:59,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-18 22:53:59,411 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-18 22:53:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:59,412 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-18 22:53:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:53:59,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:59,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:59,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:59,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 22:53:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-18 22:53:59,415 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 58 [2018-11-18 22:53:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:59,415 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-18 22:53:59,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:53:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:53:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 22:53:59,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:59,416 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-18 22:53:59,416 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:59,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash 918410795, now seen corresponding path program 11 times [2018-11-18 22:53:59,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:59,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:59,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:00,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-18 22:54:00,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-18 22:54:00,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:00,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-18 22:54:00,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-18 22:54:00,106 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-18 22:54:00,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {4371#(= main_~i~0 0)} assume true; {4371#(= main_~i~0 0)} is VALID [2018-11-18 22:54:00,107 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:00,108 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:00,109 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:00,110 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:00,112 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:00,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:00,113 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:00,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:00,114 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:00,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:00,116 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:00,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:00,117 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:00,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:00,119 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:00,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:00,120 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:00,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:00,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:54:00,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#false} ~i~0 := 0; {4370#false} is VALID [2018-11-18 22:54:00,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 42: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 43: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 44: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 46: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 47: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 49: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 52: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {4370#false} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-18 22:54:00,125 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:00,126 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4370#false} is VALID [2018-11-18 22:54:00,126 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4370#false} is VALID [2018-11-18 22:54:00,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-18 22:54:00,126 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume 0 == ~cond; {4370#false} is VALID [2018-11-18 22:54:00,126 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-18 22:54:00,129 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-18 22:54:00,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:00,129 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-18 22:54:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:54:00,941 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:54:00,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:00,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:01,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-18 22:54:01,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-18 22:54:01,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-18 22:54:01,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-18 22:54:01,148 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-18 22:54:01,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:54:01,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:54:01,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#true} assume !(~i~0 < 100000); {4369#true} is VALID [2018-11-18 22:54:01,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {4369#true} ~i~0 := 0; {4476#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:01,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {4476#(<= main_~i~0 0)} assume true; {4476#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:01,154 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:01,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:01,155 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:01,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:01,156 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:01,157 INFO L273 TraceCheckUtils]: 37: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:01,158 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:01,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:01,159 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:01,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:01,161 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:01,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:01,163 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:01,164 INFO L273 TraceCheckUtils]: 45: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:01,165 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:01,165 INFO L273 TraceCheckUtils]: 47: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:01,166 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:01,167 INFO L273 TraceCheckUtils]: 49: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:01,168 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:01,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:01,170 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:01,171 INFO L273 TraceCheckUtils]: 53: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:01,171 INFO L273 TraceCheckUtils]: 54: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:54:01,172 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-18 22:54:01,172 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:54:01,172 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4370#false} is VALID [2018-11-18 22:54:01,172 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4370#false} is VALID [2018-11-18 22:54:01,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-18 22:54:01,173 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume 0 == ~cond; {4370#false} is VALID [2018-11-18 22:54:01,173 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-18 22:54:01,178 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-18 22:54:01,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:54:01,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-18 22:54:01,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:01,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:54:01,273 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-18 22:54:01,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:54:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:54:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:54:01,275 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 15 states. [2018-11-18 22:54:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:01,858 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-18 22:54:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:54:01,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-18 22:54:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:54:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:54:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:54:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:54:01,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2018-11-18 22:54:02,031 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-18 22:54:02,033 INFO L225 Difference]: With dead ends: 108 [2018-11-18 22:54:02,033 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 22:54:02,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:54:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 22:54:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-18 22:54:02,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:02,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-18 22:54:02,707 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-18 22:54:02,707 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-18 22:54:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:02,710 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-18 22:54:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:54:02,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:02,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:02,711 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-18 22:54:02,711 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-18 22:54:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:02,713 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-18 22:54:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:54:02,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:02,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:02,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:02,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 22:54:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-18 22:54:02,715 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 62 [2018-11-18 22:54:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:02,715 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-18 22:54:02,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:54:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:54:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:54:02,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:02,717 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-18 22:54:02,717 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:02,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -490284821, now seen corresponding path program 12 times [2018-11-18 22:54:02,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:02,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:02,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:02,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:02,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:03,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-18 22:54:03,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-18 22:54:03,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-18 22:54:03,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-18 22:54:03,278 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-18 22:54:03,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#(= main_~i~0 0)} assume true; {4973#(= main_~i~0 0)} is VALID [2018-11-18 22:54:03,279 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,280 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,281 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,283 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,284 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,286 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:03,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:03,287 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:03,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:03,289 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:03,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:03,290 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:03,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:03,292 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:03,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:03,293 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:03,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:03,295 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:03,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:03,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:54:03,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {4972#false} ~i~0 := 0; {4972#false} is VALID [2018-11-18 22:54:03,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,297 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {4972#false} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume 0 == ~cond; {4972#false} is VALID [2018-11-18 22:54:03,301 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-18 22:54:03,304 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-18 22:54:03,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:03,304 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-18 22:54:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:54:03,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:54:03,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:03,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:03,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-18 22:54:03,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-18 22:54:03,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-18 22:54:03,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-18 22:54:03,886 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-18 22:54:03,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:54:03,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:54:03,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5076#(<= main_~i~0 100000)} is VALID [2018-11-18 22:54:03,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {5076#(<= main_~i~0 100000)} assume true; {5076#(<= main_~i~0 100000)} is VALID [2018-11-18 22:54:03,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {5076#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4971#true} is VALID [2018-11-18 22:54:03,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {4971#true} ~i~0 := 0; {5086#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:03,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {5086#(<= main_~i~0 0)} assume true; {5086#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:03,891 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:03,892 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:03,894 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:03,895 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,896 INFO L273 TraceCheckUtils]: 41: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:03,897 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:03,898 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:03,899 INFO L273 TraceCheckUtils]: 45: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:03,900 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:03,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:03,901 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:03,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:03,903 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:03,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:03,904 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:03,905 INFO L273 TraceCheckUtils]: 53: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:03,906 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:03,906 INFO L273 TraceCheckUtils]: 55: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:03,907 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:03,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:03,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:54:03,908 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-18 22:54:03,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:54:03,909 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4972#false} is VALID [2018-11-18 22:54:03,909 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4972#false} is VALID [2018-11-18 22:54:03,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-18 22:54:03,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume 0 == ~cond; {4972#false} is VALID [2018-11-18 22:54:03,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-18 22:54:03,913 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-18 22:54:03,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-18 22:54:03,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-18 22:54:03,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:03,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:54:04,001 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-18 22:54:04,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:54:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:54:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:54:04,003 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2018-11-18 22:54:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:04,433 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-18 22:54:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:54:04,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-18 22:54:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-18 22:54:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-18 22:54:04,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2018-11-18 22:54:04,969 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-18 22:54:04,971 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:54:04,971 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:54:04,972 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-18 22:54:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:54:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-18 22:54:05,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:05,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-18 22:54:05,006 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-18 22:54:05,007 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-18 22:54:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:05,010 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:54:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:54:05,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:05,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:05,010 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-18 22:54:05,010 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-18 22:54:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:05,012 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:54:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:54:05,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:05,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:05,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:05,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 22:54:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-18 22:54:05,014 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 66 [2018-11-18 22:54:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:05,014 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-18 22:54:05,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:54:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:54:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 22:54:05,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:05,016 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-18 22:54:05,016 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:05,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -911243093, now seen corresponding path program 13 times [2018-11-18 22:54:05,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:05,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:05,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:05,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-18 22:54:05,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-18 22:54:05,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-18 22:54:05,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-18 22:54:05,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-18 22:54:05,442 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-18 22:54:05,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {5612#(= main_~i~0 0)} assume true; {5612#(= main_~i~0 0)} is VALID [2018-11-18 22:54:05,443 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,444 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,445 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,446 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,448 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,449 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,451 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:05,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:05,452 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:05,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:05,454 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:05,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:05,455 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:05,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:05,457 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:05,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:05,458 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:05,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:05,460 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:05,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:05,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:54:05,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-18 22:54:05,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,462 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,462 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,463 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,463 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,463 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,465 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume 0 == ~cond; {5611#false} is VALID [2018-11-18 22:54:05,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-18 22:54:05,469 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-18 22:54:05,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:05,469 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-18 22:54:05,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:05,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:05,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-18 22:54:05,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-18 22:54:05,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-18 22:54:05,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-18 22:54:05,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-18 22:54:05,658 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-18 22:54:05,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#(<= main_~i~0 0)} assume true; {5644#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:05,659 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:05,660 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:05,661 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:05,662 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:05,663 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:05,665 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:05,666 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:05,667 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:05,668 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:05,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:05,669 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:05,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:05,671 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:05,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:05,672 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:05,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:05,674 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:05,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:05,675 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:05,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:05,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:54:05,677 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-18 22:54:05,677 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,678 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,679 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,679 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,679 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,679 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,680 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,680 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,680 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,680 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,681 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5611#false} is VALID [2018-11-18 22:54:05,682 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-18 22:54:05,683 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume 0 == ~cond; {5611#false} is VALID [2018-11-18 22:54:05,683 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-18 22:54:05,685 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-18 22:54:05,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:54:05,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-18 22:54:05,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:05,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:54:05,748 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-18 22:54:05,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:54:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:54:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:54:05,750 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 17 states. [2018-11-18 22:54:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:06,315 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-18 22:54:06,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:54:06,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-18 22:54:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-18 22:54:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-18 22:54:06,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-18 22:54:06,827 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-18 22:54:06,829 INFO L225 Difference]: With dead ends: 120 [2018-11-18 22:54:06,830 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 22:54:06,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:54:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 22:54:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-18 22:54:06,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:06,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-18 22:54:06,865 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 22:54:06,866 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 22:54:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:06,868 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-18 22:54:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:54:06,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:06,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:06,868 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 22:54:06,868 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 22:54:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:06,870 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-18 22:54:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:54:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:06,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:06,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 22:54:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-18 22:54:06,872 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 70 [2018-11-18 22:54:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:06,872 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-18 22:54:06,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:54:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:54:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 22:54:06,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:06,873 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-18 22:54:06,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:06,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1045046635, now seen corresponding path program 14 times [2018-11-18 22:54:06,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:06,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:06,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:07,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-18 22:54:07,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-18 22:54:07,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-18 22:54:07,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-18 22:54:07,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-18 22:54:07,631 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-18 22:54:07,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {6286#(= main_~i~0 0)} assume true; {6286#(= main_~i~0 0)} is VALID [2018-11-18 22:54:07,632 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,633 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,634 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,636 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,637 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,639 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,640 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,642 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,643 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:07,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:07,645 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:07,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:07,646 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:07,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:07,648 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:07,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:07,649 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:07,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:07,651 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:07,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:07,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:54:07,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-18 22:54:07,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,654 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,654 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,655 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6285#false} is VALID [2018-11-18 22:54:07,657 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-18 22:54:07,658 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume 0 == ~cond; {6285#false} is VALID [2018-11-18 22:54:07,658 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-18 22:54:07,661 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-18 22:54:07,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:07,661 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-18 22:54:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:54:07,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:54:07,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:07,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:07,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-18 22:54:07,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-18 22:54:07,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-18 22:54:07,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-18 22:54:07,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-18 22:54:07,854 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-18 22:54:07,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {6319#(<= main_~i~0 0)} assume true; {6319#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:07,855 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:07,856 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:07,857 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:07,858 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:07,859 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:07,861 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:07,862 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:07,864 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:07,865 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:07,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:07,867 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:07,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:07,868 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:07,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:07,870 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:07,870 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:07,871 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:07,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:07,873 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:07,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:07,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:54:07,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-18 22:54:07,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,876 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:54:07,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6285#false} is VALID [2018-11-18 22:54:07,881 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6285#false} is VALID [2018-11-18 22:54:07,881 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-18 22:54:07,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume 0 == ~cond; {6285#false} is VALID [2018-11-18 22:54:07,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-18 22:54:07,885 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-18 22:54:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:07,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:54:07,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-18 22:54:07,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:07,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:54:07,956 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-18 22:54:07,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:54:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:54:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:54:07,957 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 18 states. [2018-11-18 22:54:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,376 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-18 22:54:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:54:08,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-18 22:54:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:54:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-18 22:54:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:54:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-18 22:54:08,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 103 transitions. [2018-11-18 22:54:08,491 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-18 22:54:08,492 INFO L225 Difference]: With dead ends: 126 [2018-11-18 22:54:08,493 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 22:54:08,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:54:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 22:54:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-18 22:54:08,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:08,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-18 22:54:08,589 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-18 22:54:08,589 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-18 22:54:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,590 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-18 22:54:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:54:08,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:08,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:08,591 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-18 22:54:08,591 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-18 22:54:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:08,593 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-18 22:54:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:54:08,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:08,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:08,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:08,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 22:54:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-18 22:54:08,595 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 74 [2018-11-18 22:54:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-18 22:54:08,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:54:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:54:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 22:54:08,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:08,597 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-18 22:54:08,597 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:08,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 119074603, now seen corresponding path program 15 times [2018-11-18 22:54:08,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:08,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:09,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-18 22:54:09,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-18 22:54:09,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-18 22:54:09,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-18 22:54:09,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-18 22:54:09,501 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-18 22:54:09,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {6996#(= main_~i~0 0)} assume true; {6996#(= main_~i~0 0)} is VALID [2018-11-18 22:54:09,503 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:09,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:09,504 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:09,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:09,506 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:09,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:09,507 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:09,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:09,509 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:09,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:09,510 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:09,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:09,511 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:09,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:09,513 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:09,513 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:09,514 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:09,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:09,516 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:09,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:09,517 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:09,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:09,519 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:09,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:09,520 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:09,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:09,522 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:09,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:09,523 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:09,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:09,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:54:09,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-18 22:54:09,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-18 22:54:09,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:09,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6995#false} is VALID [2018-11-18 22:54:09,530 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6995#false} is VALID [2018-11-18 22:54:09,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-18 22:54:09,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume 0 == ~cond; {6995#false} is VALID [2018-11-18 22:54:09,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-18 22:54:09,533 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-18 22:54:09,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:09,534 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-18 22:54:09,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:54:10,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:54:10,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:10,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:10,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-18 22:54:10,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-18 22:54:10,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-18 22:54:10,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-18 22:54:10,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-18 22:54:10,969 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-18 22:54:10,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {7030#(<= main_~i~0 0)} assume true; {7030#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:10,970 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:10,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:10,971 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:10,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:10,973 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:10,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:10,974 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:10,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:10,976 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:10,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:10,978 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:10,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:10,979 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:10,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:10,981 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:10,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:10,982 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:10,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:10,984 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:10,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:10,985 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:10,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:10,987 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:10,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:10,989 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:10,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:10,990 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:10,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:11,008 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:11,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:11,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:54:11,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-18 22:54:11,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,033 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,035 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,035 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,036 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,036 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,037 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,038 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,038 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,038 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:54:11,038 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:54:11,039 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-18 22:54:11,039 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:54:11,039 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6995#false} is VALID [2018-11-18 22:54:11,039 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6995#false} is VALID [2018-11-18 22:54:11,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-18 22:54:11,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume 0 == ~cond; {6995#false} is VALID [2018-11-18 22:54:11,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-18 22:54:11,047 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-18 22:54:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:11,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:54:11,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-18 22:54:11,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:11,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:54:11,121 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-18 22:54:11,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:54:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:54:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:54:11,123 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 19 states. [2018-11-18 22:54:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:11,579 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-18 22:54:11,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:54:11,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-18 22:54:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:54:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-18 22:54:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:54:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-18 22:54:11,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 107 transitions. [2018-11-18 22:54:11,724 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-18 22:54:11,726 INFO L225 Difference]: With dead ends: 132 [2018-11-18 22:54:11,727 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 22:54:11,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:54:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 22:54:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-18 22:54:11,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:11,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2018-11-18 22:54:11,964 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-18 22:54:11,964 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-18 22:54:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:11,965 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:54:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:54:11,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:11,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:11,966 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-18 22:54:11,966 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-18 22:54:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:11,968 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:54:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:54:11,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:11,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:11,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:11,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 22:54:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-18 22:54:11,970 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 78 [2018-11-18 22:54:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:11,970 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-18 22:54:11,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:54:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:54:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 22:54:11,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:11,972 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-18 22:54:11,972 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:11,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1840372245, now seen corresponding path program 16 times [2018-11-18 22:54:11,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:11,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:11,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:12,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-18 22:54:12,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-18 22:54:12,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-18 22:54:12,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-18 22:54:12,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-18 22:54:12,350 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-18 22:54:12,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {7742#(= main_~i~0 0)} assume true; {7742#(= main_~i~0 0)} is VALID [2018-11-18 22:54:12,351 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:12,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:12,351 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:12,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:12,352 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:12,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:12,353 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:12,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:12,355 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:12,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:12,356 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:12,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:12,358 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:12,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:12,359 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:12,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:12,361 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:12,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:12,362 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:12,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:12,364 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:12,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:12,365 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:12,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:12,367 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:12,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:12,368 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:12,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:12,370 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:12,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:12,371 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:12,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:12,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:54:12,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-18 22:54:12,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,374 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,374 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,375 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,375 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,376 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,376 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:54:12,378 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-18 22:54:12,379 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-18 22:54:12,383 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-18 22:54:12,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:12,383 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-18 22:54:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:54:12,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:54:12,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:12,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:12,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-18 22:54:12,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-18 22:54:12,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-18 22:54:12,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-18 22:54:12,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-18 22:54:12,835 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-18 22:54:12,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {7777#(<= main_~i~0 0)} assume true; {7777#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:12,858 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:12,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:12,880 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:12,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:12,902 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:12,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:12,924 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:12,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:12,951 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:12,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:12,972 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:12,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,002 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,025 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,050 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,080 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,101 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:13,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:13,125 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:13,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:13,151 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:13,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:13,176 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:13,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:13,189 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:13,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:13,191 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:13,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,194 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,196 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-18 22:54:13,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:54:13,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-18 22:54:13,198 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-18 22:54:13,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-18 22:54:13,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-18 22:54:13,198 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-18 22:54:13,203 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-18 22:54:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:54:13,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-18 22:54:13,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:13,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:54:13,273 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-18 22:54:13,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:54:13,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:54:13,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:54:13,275 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 20 states. [2018-11-18 22:54:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:13,673 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-11-18 22:54:13,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:54:13,673 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-18 22:54:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:54:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-18 22:54:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:54:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-18 22:54:13,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2018-11-18 22:54:13,837 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-18 22:54:13,839 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:54:13,839 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 22:54:13,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:54:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 22:54:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-18 22:54:13,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:13,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-18 22:54:13,882 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-18 22:54:13,883 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-18 22:54:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:13,884 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-18 22:54:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:54:13,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:13,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:13,885 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-18 22:54:13,885 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-18 22:54:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:13,887 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-18 22:54:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:54:13,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:13,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:13,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:13,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 22:54:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-18 22:54:13,890 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 82 [2018-11-18 22:54:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:13,890 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-18 22:54:13,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:54:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:54:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 22:54:13,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:13,891 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-18 22:54:13,891 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:13,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 701237675, now seen corresponding path program 17 times [2018-11-18 22:54:13,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:13,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:14,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-18 22:54:14,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-18 22:54:14,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-18 22:54:14,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-18 22:54:14,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-18 22:54:14,309 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-18 22:54:14,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {8524#(= main_~i~0 0)} assume true; {8524#(= main_~i~0 0)} is VALID [2018-11-18 22:54:14,311 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:14,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:14,311 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:14,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:14,312 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:14,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:14,314 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:14,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:14,315 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:14,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:14,316 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:14,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:14,318 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:14,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:14,319 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:14,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:14,320 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:14,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:14,322 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:14,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:14,323 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:14,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:14,324 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:14,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:14,326 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:14,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:14,327 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:14,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:14,329 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:14,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:14,330 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:14,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:14,331 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:14,332 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:14,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:54:14,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-18 22:54:14,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,335 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,337 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8523#false} is VALID [2018-11-18 22:54:14,338 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-18 22:54:14,339 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume 0 == ~cond; {8523#false} is VALID [2018-11-18 22:54:14,339 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-18 22:54:14,343 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-18 22:54:14,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:14,343 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-18 22:54:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:54:26,281 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:54:26,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:26,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:26,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-18 22:54:26,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-18 22:54:26,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-18 22:54:26,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-18 22:54:26,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-18 22:54:26,500 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-18 22:54:26,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {8560#(<= main_~i~0 0)} assume true; {8560#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:26,501 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:26,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:26,502 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:26,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:26,503 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:26,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:26,505 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:26,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:26,506 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:26,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:26,507 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:26,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:26,509 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:26,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:26,510 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:26,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:26,512 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:26,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:26,513 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:26,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:26,515 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:26,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:26,516 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:26,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:26,518 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:26,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:26,519 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:26,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:26,521 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:26,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:26,522 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:26,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:26,523 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:26,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:26,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:54:26,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-18 22:54:26,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,526 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,526 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,527 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-18 22:54:26,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:54:26,531 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8523#false} is VALID [2018-11-18 22:54:26,531 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8523#false} is VALID [2018-11-18 22:54:26,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-18 22:54:26,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume 0 == ~cond; {8523#false} is VALID [2018-11-18 22:54:26,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-18 22:54:26,535 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-18 22:54:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:54:26,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-18 22:54:26,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:26,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:54:26,610 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-18 22:54:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:54:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:54:26,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:54:26,611 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 21 states. [2018-11-18 22:54:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:27,315 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-11-18 22:54:27,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:54:27,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-18 22:54:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:54:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-18 22:54:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:54:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-18 22:54:27,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2018-11-18 22:54:27,459 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-18 22:54:27,461 INFO L225 Difference]: With dead ends: 144 [2018-11-18 22:54:27,462 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 22:54:27,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:54:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 22:54:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-18 22:54:27,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:27,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2018-11-18 22:54:27,506 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-18 22:54:27,507 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-18 22:54:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:27,508 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-18 22:54:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:54:27,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:27,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:27,509 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-18 22:54:27,509 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-18 22:54:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:27,510 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-18 22:54:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:54:27,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:27,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:27,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:27,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:54:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-18 22:54:27,513 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 86 [2018-11-18 22:54:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:27,513 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-18 22:54:27,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:54:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:54:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:54:27,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:27,514 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-18 22:54:27,515 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:27,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 656726635, now seen corresponding path program 18 times [2018-11-18 22:54:27,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:27,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:27,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:27,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-18 22:54:27,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-18 22:54:27,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-18 22:54:27,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-18 22:54:27,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-18 22:54:27,980 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-18 22:54:27,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {9342#(= main_~i~0 0)} assume true; {9342#(= main_~i~0 0)} is VALID [2018-11-18 22:54:27,982 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:27,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:27,983 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:27,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:27,985 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:27,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:27,986 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:27,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:27,988 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:27,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:27,989 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:27,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:27,990 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:27,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:27,992 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:27,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:27,993 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:27,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:27,995 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:27,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:27,996 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:27,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:27,998 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:27,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:27,999 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:28,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:28,001 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:28,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:28,002 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:28,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:28,004 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:28,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:28,005 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:28,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:28,006 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:28,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:28,008 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:54:28,008 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-18 22:54:28,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,009 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,009 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,009 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,010 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,011 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,012 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:54:28,013 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume 0 == ~cond; {9341#false} is VALID [2018-11-18 22:54:28,014 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-18 22:54:28,019 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-18 22:54:28,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:28,019 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-18 22:54:28,029 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:54:29,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-18 22:54:29,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:29,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:29,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-18 22:54:29,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-18 22:54:29,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-18 22:54:29,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-18 22:54:29,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-18 22:54:29,591 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-18 22:54:29,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {9379#(<= main_~i~0 0)} assume true; {9379#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:29,592 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:29,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:29,593 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:29,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:29,594 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:29,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:29,595 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:29,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:29,597 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:29,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:29,598 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:29,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:29,600 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:29,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:29,601 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:29,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:29,603 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:29,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:29,604 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:29,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:29,606 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:29,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:29,607 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:29,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:29,609 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:29,609 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:29,610 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:29,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:29,611 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:29,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:29,613 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:29,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:29,614 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:29,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:29,616 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:29,616 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:29,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:54:29,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-18 22:54:29,617 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume 0 == ~cond; {9341#false} is VALID [2018-11-18 22:54:29,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-18 22:54:29,628 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-18 22:54:29,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:29,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-18 22:54:29,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-18 22:54:29,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:29,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:54:29,702 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-18 22:54:29,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:54:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:54:29,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:54:29,703 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 22 states. [2018-11-18 22:54:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:30,339 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-18 22:54:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:54:30,340 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-18 22:54:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:54:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-18 22:54:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:54:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-18 22:54:30,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 119 transitions. [2018-11-18 22:54:30,451 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-18 22:54:30,453 INFO L225 Difference]: With dead ends: 150 [2018-11-18 22:54:30,453 INFO L226 Difference]: Without dead ends: 99 [2018-11-18 22:54:30,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:54:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-18 22:54:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-18 22:54:30,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:30,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2018-11-18 22:54:30,525 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-18 22:54:30,525 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-18 22:54:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:30,526 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-18 22:54:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:54:30,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:30,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:30,527 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-18 22:54:30,527 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-18 22:54:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:30,528 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-18 22:54:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:54:30,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:30,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:30,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:30,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 22:54:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-18 22:54:30,530 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 90 [2018-11-18 22:54:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:30,530 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-18 22:54:30,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:54:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:54:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 22:54:30,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:30,531 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-18 22:54:30,532 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:30,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash 664459307, now seen corresponding path program 19 times [2018-11-18 22:54:30,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:30,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:30,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:30,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-18 22:54:30,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-18 22:54:30,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-18 22:54:30,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-18 22:54:30,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-18 22:54:30,989 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-18 22:54:30,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {10196#(= main_~i~0 0)} assume true; {10196#(= main_~i~0 0)} is VALID [2018-11-18 22:54:30,990 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:30,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:30,991 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:30,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:30,992 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:30,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:30,993 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:30,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:30,994 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:30,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:30,996 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:30,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:30,997 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:30,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:30,999 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:30,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:31,000 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:31,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:31,002 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:31,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:31,003 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:31,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:31,004 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:31,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:31,006 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:31,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:31,007 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:31,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:31,009 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:31,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:31,010 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:31,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:31,012 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:31,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:31,013 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:31,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:31,015 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:31,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:31,016 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:54:31,016 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-18 22:54:31,016 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,016 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,017 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,018 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,020 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,021 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume 0 == ~cond; {10195#false} is VALID [2018-11-18 22:54:31,022 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-18 22:54:31,042 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-18 22:54:31,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:31,042 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-18 22:54:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:31,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:31,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-18 22:54:31,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-18 22:54:31,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-18 22:54:31,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-18 22:54:31,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-18 22:54:31,340 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-18 22:54:31,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {10234#(<= main_~i~0 0)} assume true; {10234#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:31,341 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:31,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:31,342 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:31,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:31,343 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:31,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:31,344 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:31,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:31,346 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:31,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:31,347 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:31,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:31,349 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:31,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:31,350 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:31,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:31,352 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:31,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:31,353 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:31,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:31,354 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:31,355 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:31,356 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:31,356 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:31,357 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:31,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:31,359 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:31,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:31,360 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:31,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:31,362 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:31,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:31,363 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:31,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:31,365 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:31,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:31,366 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:31,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:31,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:54:31,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-18 22:54:31,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,370 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,370 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,371 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,373 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume 0 == ~cond; {10195#false} is VALID [2018-11-18 22:54:31,374 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-18 22:54:31,379 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-18 22:54:31,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:31,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:54:31,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-18 22:54:31,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:31,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:54:31,455 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-18 22:54:31,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:54:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:54:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:54:31,457 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 23 states. [2018-11-18 22:54:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:32,320 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-11-18 22:54:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:54:32,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-18 22:54:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:54:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-18 22:54:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:54:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-18 22:54:32,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2018-11-18 22:54:32,431 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-18 22:54:32,433 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:54:32,434 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 22:54:32,434 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-18 22:54:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 22:54:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-18 22:54:32,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:32,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-18 22:54:32,486 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-18 22:54:32,487 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-18 22:54:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:32,489 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:54:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:54:32,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:32,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:32,489 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-18 22:54:32,490 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-18 22:54:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:32,491 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:54:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:54:32,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:32,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:32,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:32,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 22:54:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-18 22:54:32,494 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 94 [2018-11-18 22:54:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:32,494 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-18 22:54:32,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:54:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:54:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 22:54:32,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:32,495 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-18 22:54:32,496 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:32,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1075856107, now seen corresponding path program 20 times [2018-11-18 22:54:32,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:32,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:32,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:33,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-18 22:54:33,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-18 22:54:33,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-18 22:54:33,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-18 22:54:33,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-18 22:54:33,162 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-18 22:54:33,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#(= main_~i~0 0)} assume true; {11086#(= main_~i~0 0)} is VALID [2018-11-18 22:54:33,163 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:33,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:33,165 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:33,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:33,166 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:33,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:33,167 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:33,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:33,169 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:33,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:33,170 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:33,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:33,171 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:33,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:33,173 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:33,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:33,174 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:33,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:33,176 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:33,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:33,177 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:33,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:33,178 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:33,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:33,180 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:33,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:33,181 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:33,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:33,182 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:33,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:33,184 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:33,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:33,185 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:33,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:33,186 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:33,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:33,188 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:33,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:33,189 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:33,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:33,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:54:33,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,194 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,195 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-18 22:54:33,196 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11085#false} is VALID [2018-11-18 22:54:33,197 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-18 22:54:33,197 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-18 22:54:33,197 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-18 22:54:33,202 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-18 22:54:33,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:33,202 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-18 22:54:33,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:54:33,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:54:33,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:33,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:33,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-18 22:54:33,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-18 22:54:33,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-18 22:54:33,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-18 22:54:33,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-18 22:54:33,435 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-18 22:54:33,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {11125#(<= main_~i~0 0)} assume true; {11125#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:33,436 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:33,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:33,437 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:33,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:33,438 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:33,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:33,439 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:33,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:33,442 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:33,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:33,443 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:33,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:33,444 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:33,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:33,446 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:33,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:33,447 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:33,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:33,448 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:33,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:33,450 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:33,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:33,451 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:33,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:33,453 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:33,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:33,454 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:33,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:33,455 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:33,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:33,457 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:33,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:33,458 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:33,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:33,460 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:33,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:33,461 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:33,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:33,462 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:33,463 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:33,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:54:33,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-18 22:54:33,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,466 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,466 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,466 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,467 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,467 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,467 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,467 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:54:33,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11085#false} is VALID [2018-11-18 22:54:33,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-18 22:54:33,473 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-18 22:54:33,473 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-18 22:54:33,479 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-18 22:54:33,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:33,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:54:33,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-18 22:54:33,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:33,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:54:33,576 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-18 22:54:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:54:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:54:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:54:33,578 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 24 states. [2018-11-18 22:54:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:33,927 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2018-11-18 22:54:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:54:33,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-18 22:54:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:54:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-18 22:54:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:54:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-18 22:54:33,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 127 transitions. [2018-11-18 22:54:34,041 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-18 22:54:34,043 INFO L225 Difference]: With dead ends: 162 [2018-11-18 22:54:34,043 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 22:54:34,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:54:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 22:54:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-18 22:54:34,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:34,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2018-11-18 22:54:34,096 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-18 22:54:34,096 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-18 22:54:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:34,097 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-18 22:54:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:54:34,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:34,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:34,098 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-18 22:54:34,098 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-18 22:54:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:34,099 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-18 22:54:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:54:34,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:34,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:34,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:34,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 22:54:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-11-18 22:54:34,101 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 98 [2018-11-18 22:54:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:34,102 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-11-18 22:54:34,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:54:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:54:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 22:54:34,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:34,103 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-18 22:54:34,103 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:34,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 827808427, now seen corresponding path program 21 times [2018-11-18 22:54:34,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:34,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:34,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-18 22:54:34,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-18 22:54:34,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:34,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-18 22:54:34,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-18 22:54:34,661 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-18 22:54:34,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {12012#(= main_~i~0 0)} assume true; {12012#(= main_~i~0 0)} is VALID [2018-11-18 22:54:34,662 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:34,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:34,664 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:34,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:34,665 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:34,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:34,667 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:34,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:34,668 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:34,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:34,669 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:34,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:34,671 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:34,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:34,672 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:34,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:34,674 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:34,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:34,675 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:34,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:34,677 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:34,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:34,678 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:34,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:34,680 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:34,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:34,681 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:34,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:34,682 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:34,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:34,684 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:34,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:34,685 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:34,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:34,687 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:34,687 INFO L273 TraceCheckUtils]: 42: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:34,688 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:34,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:34,690 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:34,690 INFO L273 TraceCheckUtils]: 46: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:34,691 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:34,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:34,692 INFO L273 TraceCheckUtils]: 49: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:54:34,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {12011#false} ~i~0 := 0; {12011#false} is VALID [2018-11-18 22:54:34,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,695 INFO L273 TraceCheckUtils]: 63: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,695 INFO L273 TraceCheckUtils]: 64: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,696 INFO L273 TraceCheckUtils]: 67: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,696 INFO L273 TraceCheckUtils]: 69: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 74: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,697 INFO L273 TraceCheckUtils]: 75: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 79: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 80: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 81: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 82: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,698 INFO L273 TraceCheckUtils]: 84: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 85: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 86: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 87: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 90: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 91: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,699 INFO L273 TraceCheckUtils]: 92: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 93: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 94: Hoare triple {12011#false} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-18 22:54:34,700 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-18 22:54:34,706 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-18 22:54:34,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:34,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:54:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:54:35,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 22:54:35,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:35,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:36,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-18 22:54:36,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-18 22:54:36,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-18 22:54:36,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-18 22:54:36,147 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-18 22:54:36,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 39: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:54:36,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:54:36,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12178#(<= main_~i~0 100000)} is VALID [2018-11-18 22:54:36,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {12178#(<= main_~i~0 100000)} assume true; {12178#(<= main_~i~0 100000)} is VALID [2018-11-18 22:54:36,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {12178#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12010#true} is VALID [2018-11-18 22:54:36,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#true} ~i~0 := 0; {12188#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:36,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {12188#(<= main_~i~0 0)} assume true; {12188#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:36,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {12188#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:36,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:36,155 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:36,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:36,157 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:36,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:36,158 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:36,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:36,159 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:36,160 INFO L273 TraceCheckUtils]: 61: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:36,161 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:36,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:36,162 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:36,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:36,164 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:36,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:36,165 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:36,166 INFO L273 TraceCheckUtils]: 69: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:36,167 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:36,167 INFO L273 TraceCheckUtils]: 71: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:36,168 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:36,168 INFO L273 TraceCheckUtils]: 73: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:36,169 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:36,170 INFO L273 TraceCheckUtils]: 75: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:36,171 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:36,171 INFO L273 TraceCheckUtils]: 77: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:36,172 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:36,173 INFO L273 TraceCheckUtils]: 79: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:36,174 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:36,174 INFO L273 TraceCheckUtils]: 81: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:36,175 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:36,176 INFO L273 TraceCheckUtils]: 83: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:36,176 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:36,177 INFO L273 TraceCheckUtils]: 85: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:36,178 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:36,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:36,179 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:36,180 INFO L273 TraceCheckUtils]: 89: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:36,181 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:36,181 INFO L273 TraceCheckUtils]: 91: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:36,182 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 + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:36,183 INFO L273 TraceCheckUtils]: 93: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:36,183 INFO L273 TraceCheckUtils]: 94: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:54:36,183 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-18 22:54:36,184 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:54:36,184 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12011#false} is VALID [2018-11-18 22:54:36,184 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12011#false} is VALID [2018-11-18 22:54:36,184 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-18 22:54:36,185 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-18 22:54:36,185 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-18 22:54:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 462 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-18 22:54:36,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:36,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-11-18 22:54:36,215 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-11-18 22:54:36,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:36,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:54:36,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:54:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:54:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:54:36,326 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 26 states. [2018-11-18 22:54:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:36,696 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-18 22:54:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:54:36,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-11-18 22:54:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:54:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 131 transitions. [2018-11-18 22:54:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:54:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 131 transitions. [2018-11-18 22:54:36,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 131 transitions. [2018-11-18 22:54:36,819 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-18 22:54:36,821 INFO L225 Difference]: With dead ends: 168 [2018-11-18 22:54:36,821 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 22:54:36,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:54:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 22:54:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-18 22:54:36,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:36,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-18 22:54:36,879 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 22:54:36,879 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 22:54:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:36,881 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:54:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:54:36,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:36,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:36,882 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 22:54:36,882 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 22:54:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:36,883 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:54:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:54:36,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:36,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:36,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:36,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 22:54:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-11-18 22:54:36,886 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 102 [2018-11-18 22:54:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:36,886 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-18 22:54:36,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:54:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:54:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 22:54:36,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:36,888 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-18 22:54:36,888 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:36,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1684906133, now seen corresponding path program 22 times [2018-11-18 22:54:36,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:36,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:36,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:36,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:36,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:37,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {12973#true} call ULTIMATE.init(); {12973#true} is VALID [2018-11-18 22:54:37,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {12973#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12973#true} is VALID [2018-11-18 22:54:37,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {12973#true} assume true; {12973#true} is VALID [2018-11-18 22:54:37,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12973#true} {12973#true} #64#return; {12973#true} is VALID [2018-11-18 22:54:37,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {12973#true} call #t~ret2 := main(); {12973#true} is VALID [2018-11-18 22:54:37,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {12973#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12975#(= main_~i~0 0)} is VALID [2018-11-18 22:54:37,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {12975#(= main_~i~0 0)} assume true; {12975#(= main_~i~0 0)} is VALID [2018-11-18 22:54:37,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {12975#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:37,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {12976#(<= main_~i~0 1)} assume true; {12976#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:37,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {12976#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:37,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {12977#(<= main_~i~0 2)} assume true; {12977#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:37,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {12977#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:37,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {12978#(<= main_~i~0 3)} assume true; {12978#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:37,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {12978#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:37,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {12979#(<= main_~i~0 4)} assume true; {12979#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:37,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {12979#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:37,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {12980#(<= main_~i~0 5)} assume true; {12980#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:37,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {12980#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:37,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {12981#(<= main_~i~0 6)} assume true; {12981#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:37,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {12981#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:37,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {12982#(<= main_~i~0 7)} assume true; {12982#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:37,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {12982#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:37,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {12983#(<= main_~i~0 8)} assume true; {12983#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:37,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {12983#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:37,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#(<= main_~i~0 9)} assume true; {12984#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:37,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:37,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {12985#(<= main_~i~0 10)} assume true; {12985#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:37,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {12985#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:37,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {12986#(<= main_~i~0 11)} assume true; {12986#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:37,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {12986#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:37,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {12987#(<= main_~i~0 12)} assume true; {12987#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:37,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {12987#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:37,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {12988#(<= main_~i~0 13)} assume true; {12988#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:37,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {12988#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:37,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {12989#(<= main_~i~0 14)} assume true; {12989#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:37,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {12989#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:37,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {12990#(<= main_~i~0 15)} assume true; {12990#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:37,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {12990#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:37,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {12991#(<= main_~i~0 16)} assume true; {12991#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:37,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {12991#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:37,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {12992#(<= main_~i~0 17)} assume true; {12992#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:37,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {12992#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:37,560 INFO L273 TraceCheckUtils]: 42: Hoare triple {12993#(<= main_~i~0 18)} assume true; {12993#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:37,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {12993#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:37,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {12994#(<= main_~i~0 19)} assume true; {12994#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:37,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {12994#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:37,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {12995#(<= main_~i~0 20)} assume true; {12995#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:37,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {12995#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:37,567 INFO L273 TraceCheckUtils]: 48: Hoare triple {12996#(<= main_~i~0 21)} assume true; {12996#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:37,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {12996#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12997#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:37,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {12997#(<= main_~i~0 22)} assume true; {12997#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:37,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {12997#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12974#false} is VALID [2018-11-18 22:54:37,570 INFO L273 TraceCheckUtils]: 52: Hoare triple {12974#false} ~i~0 := 0; {12974#false} is VALID [2018-11-18 22:54:37,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,572 INFO L273 TraceCheckUtils]: 59: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,572 INFO L273 TraceCheckUtils]: 60: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,572 INFO L273 TraceCheckUtils]: 63: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,573 INFO L273 TraceCheckUtils]: 65: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,573 INFO L273 TraceCheckUtils]: 66: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,574 INFO L273 TraceCheckUtils]: 73: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 74: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 75: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 76: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 77: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 81: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 82: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 83: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 85: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 86: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,576 INFO L273 TraceCheckUtils]: 87: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 88: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 89: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 90: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 91: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 92: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,577 INFO L273 TraceCheckUtils]: 93: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,578 INFO L273 TraceCheckUtils]: 94: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,578 INFO L273 TraceCheckUtils]: 95: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,578 INFO L273 TraceCheckUtils]: 96: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:37,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,578 INFO L273 TraceCheckUtils]: 98: Hoare triple {12974#false} assume !(~i~0 < 100000); {12974#false} is VALID [2018-11-18 22:54:37,579 INFO L273 TraceCheckUtils]: 99: Hoare triple {12974#false} havoc ~x~0;~x~0 := 0; {12974#false} is VALID [2018-11-18 22:54:37,579 INFO L273 TraceCheckUtils]: 100: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:37,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {12974#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12974#false} is VALID [2018-11-18 22:54:37,579 INFO L256 TraceCheckUtils]: 102: Hoare triple {12974#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12974#false} is VALID [2018-11-18 22:54:37,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {12974#false} ~cond := #in~cond; {12974#false} is VALID [2018-11-18 22:54:37,580 INFO L273 TraceCheckUtils]: 104: Hoare triple {12974#false} assume 0 == ~cond; {12974#false} is VALID [2018-11-18 22:54:37,580 INFO L273 TraceCheckUtils]: 105: Hoare triple {12974#false} assume !false; {12974#false} is VALID [2018-11-18 22:54:37,594 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-18 22:54:37,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:37,595 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-18 22:54:37,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:54:37,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:54:37,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:37,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:37,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {12973#true} call ULTIMATE.init(); {12973#true} is VALID [2018-11-18 22:54:37,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {12973#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12973#true} is VALID [2018-11-18 22:54:37,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {12973#true} assume true; {12973#true} is VALID [2018-11-18 22:54:37,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12973#true} {12973#true} #64#return; {12973#true} is VALID [2018-11-18 22:54:37,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {12973#true} call #t~ret2 := main(); {12973#true} is VALID [2018-11-18 22:54:37,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {12973#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13016#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:37,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {13016#(<= main_~i~0 0)} assume true; {13016#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:37,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {13016#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:37,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {12976#(<= main_~i~0 1)} assume true; {12976#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:37,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {12976#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:37,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {12977#(<= main_~i~0 2)} assume true; {12977#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:37,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {12977#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:37,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {12978#(<= main_~i~0 3)} assume true; {12978#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:37,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {12978#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:37,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {12979#(<= main_~i~0 4)} assume true; {12979#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:37,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {12979#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:37,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {12980#(<= main_~i~0 5)} assume true; {12980#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:37,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {12980#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:38,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {12981#(<= main_~i~0 6)} assume true; {12981#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:38,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {12981#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:38,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {12982#(<= main_~i~0 7)} assume true; {12982#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:38,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {12982#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:38,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {12983#(<= main_~i~0 8)} assume true; {12983#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:38,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {12983#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:38,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#(<= main_~i~0 9)} assume true; {12984#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:38,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:38,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {12985#(<= main_~i~0 10)} assume true; {12985#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:38,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {12985#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:38,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {12986#(<= main_~i~0 11)} assume true; {12986#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:38,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {12986#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:38,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {12987#(<= main_~i~0 12)} assume true; {12987#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:38,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {12987#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:38,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {12988#(<= main_~i~0 13)} assume true; {12988#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:38,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {12988#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:38,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {12989#(<= main_~i~0 14)} assume true; {12989#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:38,027 INFO L273 TraceCheckUtils]: 35: Hoare triple {12989#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:38,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {12990#(<= main_~i~0 15)} assume true; {12990#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:38,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {12990#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:38,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {12991#(<= main_~i~0 16)} assume true; {12991#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:38,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {12991#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:38,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {12992#(<= main_~i~0 17)} assume true; {12992#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:38,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {12992#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:38,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {12993#(<= main_~i~0 18)} assume true; {12993#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:38,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {12993#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:38,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {12994#(<= main_~i~0 19)} assume true; {12994#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:38,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {12994#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:38,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {12995#(<= main_~i~0 20)} assume true; {12995#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:38,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {12995#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:38,036 INFO L273 TraceCheckUtils]: 48: Hoare triple {12996#(<= main_~i~0 21)} assume true; {12996#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:38,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {12996#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12997#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:38,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {12997#(<= main_~i~0 22)} assume true; {12997#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:38,038 INFO L273 TraceCheckUtils]: 51: Hoare triple {12997#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12974#false} is VALID [2018-11-18 22:54:38,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {12974#false} ~i~0 := 0; {12974#false} is VALID [2018-11-18 22:54:38,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 58: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,039 INFO L273 TraceCheckUtils]: 59: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,040 INFO L273 TraceCheckUtils]: 64: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 65: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 67: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 71: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 72: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,041 INFO L273 TraceCheckUtils]: 73: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 74: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 75: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 77: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 78: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 79: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 80: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 81: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,042 INFO L273 TraceCheckUtils]: 82: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 84: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 85: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 86: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 87: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 88: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 89: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 90: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,043 INFO L273 TraceCheckUtils]: 91: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 92: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 93: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 94: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 96: Hoare triple {12974#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 97: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 98: Hoare triple {12974#false} assume !(~i~0 < 100000); {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 99: Hoare triple {12974#false} havoc ~x~0;~x~0 := 0; {12974#false} is VALID [2018-11-18 22:54:38,044 INFO L273 TraceCheckUtils]: 100: Hoare triple {12974#false} assume true; {12974#false} is VALID [2018-11-18 22:54:38,045 INFO L273 TraceCheckUtils]: 101: Hoare triple {12974#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12974#false} is VALID [2018-11-18 22:54:38,045 INFO L256 TraceCheckUtils]: 102: Hoare triple {12974#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12974#false} is VALID [2018-11-18 22:54:38,045 INFO L273 TraceCheckUtils]: 103: Hoare triple {12974#false} ~cond := #in~cond; {12974#false} is VALID [2018-11-18 22:54:38,045 INFO L273 TraceCheckUtils]: 104: Hoare triple {12974#false} assume 0 == ~cond; {12974#false} is VALID [2018-11-18 22:54:38,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {12974#false} assume !false; {12974#false} is VALID [2018-11-18 22:54:38,051 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-18 22:54:38,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:38,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:54:38,070 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-18 22:54:38,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:38,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:54:38,131 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-18 22:54:38,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:54:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:54:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:54:38,132 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 26 states. [2018-11-18 22:54:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:39,323 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-11-18 22:54:39,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:54:39,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-18 22:54:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:54:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-18 22:54:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:54:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-18 22:54:39,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 135 transitions. [2018-11-18 22:54:39,448 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-18 22:54:39,451 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:54:39,451 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 22:54:39,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:54:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 22:54:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-18 22:54:39,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:39,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-18 22:54:39,530 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 22:54:39,531 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 22:54:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:39,532 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-18 22:54:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:54:39,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:39,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 22:54:39,533 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 22:54:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:39,534 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-18 22:54:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:54:39,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:39,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:39,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:39,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 22:54:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-11-18 22:54:39,537 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 106 [2018-11-18 22:54:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:39,537 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-11-18 22:54:39,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:54:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:54:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 22:54:39,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:39,538 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-18 22:54:39,538 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:39,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash 852726059, now seen corresponding path program 23 times [2018-11-18 22:54:39,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:39,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:39,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:40,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {13971#true} call ULTIMATE.init(); {13971#true} is VALID [2018-11-18 22:54:40,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {13971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13971#true} is VALID [2018-11-18 22:54:40,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {13971#true} assume true; {13971#true} is VALID [2018-11-18 22:54:40,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13971#true} {13971#true} #64#return; {13971#true} is VALID [2018-11-18 22:54:40,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {13971#true} call #t~ret2 := main(); {13971#true} is VALID [2018-11-18 22:54:40,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {13971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13973#(= main_~i~0 0)} is VALID [2018-11-18 22:54:40,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {13973#(= main_~i~0 0)} assume true; {13973#(= main_~i~0 0)} is VALID [2018-11-18 22:54:40,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {13973#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:40,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {13974#(<= main_~i~0 1)} assume true; {13974#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:40,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {13974#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:40,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~i~0 2)} assume true; {13975#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:40,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:40,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {13976#(<= main_~i~0 3)} assume true; {13976#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:40,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {13976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:40,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {13977#(<= main_~i~0 4)} assume true; {13977#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:40,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {13977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:40,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 5)} assume true; {13978#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:40,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:40,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 6)} assume true; {13979#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:40,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:40,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {13980#(<= main_~i~0 7)} assume true; {13980#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:40,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {13980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:40,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {13981#(<= main_~i~0 8)} assume true; {13981#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:40,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {13981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:40,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {13982#(<= main_~i~0 9)} assume true; {13982#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:40,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {13982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:40,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {13983#(<= main_~i~0 10)} assume true; {13983#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:40,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {13983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:40,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {13984#(<= main_~i~0 11)} assume true; {13984#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:40,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {13984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:40,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {13985#(<= main_~i~0 12)} assume true; {13985#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:40,080 INFO L273 TraceCheckUtils]: 31: Hoare triple {13985#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13986#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:40,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {13986#(<= main_~i~0 13)} assume true; {13986#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:40,081 INFO L273 TraceCheckUtils]: 33: Hoare triple {13986#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13987#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:40,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {13987#(<= main_~i~0 14)} assume true; {13987#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:40,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {13987#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13988#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:40,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {13988#(<= main_~i~0 15)} assume true; {13988#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:40,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {13988#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13989#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:40,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {13989#(<= main_~i~0 16)} assume true; {13989#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:40,086 INFO L273 TraceCheckUtils]: 39: Hoare triple {13989#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13990#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:40,086 INFO L273 TraceCheckUtils]: 40: Hoare triple {13990#(<= main_~i~0 17)} assume true; {13990#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:40,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {13990#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13991#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:40,088 INFO L273 TraceCheckUtils]: 42: Hoare triple {13991#(<= main_~i~0 18)} assume true; {13991#(<= main_~i~0 18)} is VALID [2018-11-18 22:54:40,088 INFO L273 TraceCheckUtils]: 43: Hoare triple {13991#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13992#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:40,089 INFO L273 TraceCheckUtils]: 44: Hoare triple {13992#(<= main_~i~0 19)} assume true; {13992#(<= main_~i~0 19)} is VALID [2018-11-18 22:54:40,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {13992#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13993#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:40,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {13993#(<= main_~i~0 20)} assume true; {13993#(<= main_~i~0 20)} is VALID [2018-11-18 22:54:40,091 INFO L273 TraceCheckUtils]: 47: Hoare triple {13993#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13994#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:40,092 INFO L273 TraceCheckUtils]: 48: Hoare triple {13994#(<= main_~i~0 21)} assume true; {13994#(<= main_~i~0 21)} is VALID [2018-11-18 22:54:40,093 INFO L273 TraceCheckUtils]: 49: Hoare triple {13994#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13995#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:40,093 INFO L273 TraceCheckUtils]: 50: Hoare triple {13995#(<= main_~i~0 22)} assume true; {13995#(<= main_~i~0 22)} is VALID [2018-11-18 22:54:40,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {13995#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#(<= main_~i~0 23)} is VALID [2018-11-18 22:54:40,095 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#(<= main_~i~0 23)} assume true; {13996#(<= main_~i~0 23)} is VALID [2018-11-18 22:54:40,095 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13972#false} is VALID [2018-11-18 22:54:40,096 INFO L273 TraceCheckUtils]: 54: Hoare triple {13972#false} ~i~0 := 0; {13972#false} is VALID [2018-11-18 22:54:40,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,096 INFO L273 TraceCheckUtils]: 56: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,096 INFO L273 TraceCheckUtils]: 57: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,096 INFO L273 TraceCheckUtils]: 58: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,097 INFO L273 TraceCheckUtils]: 59: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,097 INFO L273 TraceCheckUtils]: 60: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,097 INFO L273 TraceCheckUtils]: 61: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,097 INFO L273 TraceCheckUtils]: 62: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,097 INFO L273 TraceCheckUtils]: 63: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 64: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 74: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,099 INFO L273 TraceCheckUtils]: 78: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 79: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 80: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 81: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 88: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 91: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 94: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 96: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 97: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 98: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 99: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 100: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 101: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 102: Hoare triple {13972#false} assume !(~i~0 < 100000); {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 103: Hoare triple {13972#false} havoc ~x~0;~x~0 := 0; {13972#false} is VALID [2018-11-18 22:54:40,102 INFO L273 TraceCheckUtils]: 104: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:54:40,103 INFO L273 TraceCheckUtils]: 105: Hoare triple {13972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13972#false} is VALID [2018-11-18 22:54:40,103 INFO L256 TraceCheckUtils]: 106: Hoare triple {13972#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13972#false} is VALID [2018-11-18 22:54:40,103 INFO L273 TraceCheckUtils]: 107: Hoare triple {13972#false} ~cond := #in~cond; {13972#false} is VALID [2018-11-18 22:54:40,103 INFO L273 TraceCheckUtils]: 108: Hoare triple {13972#false} assume 0 == ~cond; {13972#false} is VALID [2018-11-18 22:54:40,103 INFO L273 TraceCheckUtils]: 109: Hoare triple {13972#false} assume !false; {13972#false} is VALID [2018-11-18 22:54:40,109 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-18 22:54:40,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:40,110 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-18 22:54:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:55:44,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 22:55:44,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:44,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:45,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {13971#true} call ULTIMATE.init(); {13971#true} is VALID [2018-11-18 22:55:45,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {13971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13971#true} is VALID [2018-11-18 22:55:45,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {13971#true} assume true; {13971#true} is VALID [2018-11-18 22:55:45,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13971#true} {13971#true} #64#return; {13971#true} is VALID [2018-11-18 22:55:45,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {13971#true} call #t~ret2 := main(); {13971#true} is VALID [2018-11-18 22:55:45,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {13971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14015#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:45,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {14015#(<= main_~i~0 0)} assume true; {14015#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:45,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {14015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13974#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:45,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {13974#(<= main_~i~0 1)} assume true; {13974#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:45,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {13974#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13975#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:45,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~i~0 2)} assume true; {13975#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:45,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13976#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:45,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {13976#(<= main_~i~0 3)} assume true; {13976#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:45,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {13976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13977#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:45,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {13977#(<= main_~i~0 4)} assume true; {13977#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:45,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {13977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13978#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:45,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 5)} assume true; {13978#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:45,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13979#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:45,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 6)} assume true; {13979#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:45,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13980#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:45,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {13980#(<= main_~i~0 7)} assume true; {13980#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:45,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {13980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13981#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:45,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {13981#(<= main_~i~0 8)} assume true; {13981#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:45,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {13981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13982#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:45,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {13982#(<= main_~i~0 9)} assume true; {13982#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:45,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {13982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13983#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:45,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {13983#(<= main_~i~0 10)} assume true; {13983#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:45,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {13983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13984#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:45,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {13984#(<= main_~i~0 11)} assume true; {13984#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:45,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {13984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13985#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:45,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {13985#(<= main_~i~0 12)} assume true; {13985#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:45,104 INFO L273 TraceCheckUtils]: 31: Hoare triple {13985#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13986#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:45,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {13986#(<= main_~i~0 13)} assume true; {13986#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:45,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {13986#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13987#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:45,106 INFO L273 TraceCheckUtils]: 34: Hoare triple {13987#(<= main_~i~0 14)} assume true; {13987#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:45,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {13987#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13988#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:45,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {13988#(<= main_~i~0 15)} assume true; {13988#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:45,108 INFO L273 TraceCheckUtils]: 37: Hoare triple {13988#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13989#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:45,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {13989#(<= main_~i~0 16)} assume true; {13989#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:45,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {13989#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13990#(<= main_~i~0 17)} is VALID [2018-11-18 22:55:45,110 INFO L273 TraceCheckUtils]: 40: Hoare triple {13990#(<= main_~i~0 17)} assume true; {13990#(<= main_~i~0 17)} is VALID [2018-11-18 22:55:45,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {13990#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13991#(<= main_~i~0 18)} is VALID [2018-11-18 22:55:45,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {13991#(<= main_~i~0 18)} assume true; {13991#(<= main_~i~0 18)} is VALID [2018-11-18 22:55:45,113 INFO L273 TraceCheckUtils]: 43: Hoare triple {13991#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13992#(<= main_~i~0 19)} is VALID [2018-11-18 22:55:45,113 INFO L273 TraceCheckUtils]: 44: Hoare triple {13992#(<= main_~i~0 19)} assume true; {13992#(<= main_~i~0 19)} is VALID [2018-11-18 22:55:45,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {13992#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13993#(<= main_~i~0 20)} is VALID [2018-11-18 22:55:45,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {13993#(<= main_~i~0 20)} assume true; {13993#(<= main_~i~0 20)} is VALID [2018-11-18 22:55:45,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {13993#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13994#(<= main_~i~0 21)} is VALID [2018-11-18 22:55:45,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {13994#(<= main_~i~0 21)} assume true; {13994#(<= main_~i~0 21)} is VALID [2018-11-18 22:55:45,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {13994#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13995#(<= main_~i~0 22)} is VALID [2018-11-18 22:55:45,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {13995#(<= main_~i~0 22)} assume true; {13995#(<= main_~i~0 22)} is VALID [2018-11-18 22:55:45,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {13995#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#(<= main_~i~0 23)} is VALID [2018-11-18 22:55:45,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#(<= main_~i~0 23)} assume true; {13996#(<= main_~i~0 23)} is VALID [2018-11-18 22:55:45,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13972#false} is VALID [2018-11-18 22:55:45,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {13972#false} ~i~0 := 0; {13972#false} is VALID [2018-11-18 22:55:45,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,120 INFO L273 TraceCheckUtils]: 56: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,121 INFO L273 TraceCheckUtils]: 57: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,121 INFO L273 TraceCheckUtils]: 58: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,121 INFO L273 TraceCheckUtils]: 59: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,121 INFO L273 TraceCheckUtils]: 60: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 62: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 63: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 66: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 67: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,122 INFO L273 TraceCheckUtils]: 68: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 69: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 70: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 71: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 72: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 73: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 75: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,123 INFO L273 TraceCheckUtils]: 76: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 77: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 78: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 79: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 80: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 81: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 82: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 83: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 84: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,124 INFO L273 TraceCheckUtils]: 85: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 86: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 87: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 88: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 89: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 90: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 91: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 92: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 93: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 95: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 96: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 97: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 98: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 99: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 100: Hoare triple {13972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 101: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 102: Hoare triple {13972#false} assume !(~i~0 < 100000); {13972#false} is VALID [2018-11-18 22:55:45,126 INFO L273 TraceCheckUtils]: 103: Hoare triple {13972#false} havoc ~x~0;~x~0 := 0; {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L273 TraceCheckUtils]: 104: Hoare triple {13972#false} assume true; {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L273 TraceCheckUtils]: 105: Hoare triple {13972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L256 TraceCheckUtils]: 106: Hoare triple {13972#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L273 TraceCheckUtils]: 107: Hoare triple {13972#false} ~cond := #in~cond; {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L273 TraceCheckUtils]: 108: Hoare triple {13972#false} assume 0 == ~cond; {13972#false} is VALID [2018-11-18 22:55:45,127 INFO L273 TraceCheckUtils]: 109: Hoare triple {13972#false} assume !false; {13972#false} is VALID [2018-11-18 22:55:45,134 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-18 22:55:45,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:55:45,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-18 22:55:45,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:45,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:55:45,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:55:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:55:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:55:45,233 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 27 states. [2018-11-18 22:55:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:45,831 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2018-11-18 22:55:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:55:45,831 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-18 22:55:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:55:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 139 transitions. [2018-11-18 22:55:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:55:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 139 transitions. [2018-11-18 22:55:45,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 139 transitions. [2018-11-18 22:55:45,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:45,974 INFO L225 Difference]: With dead ends: 180 [2018-11-18 22:55:45,974 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 22:55:45,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:55:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 22:55:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-18 22:55:46,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:46,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 119 states. [2018-11-18 22:55:46,039 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-18 22:55:46,039 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-18 22:55:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:46,042 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-18 22:55:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:55:46,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:46,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:46,042 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-18 22:55:46,042 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-18 22:55:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:46,044 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-18 22:55:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:55:46,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:46,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:46,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:46,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 22:55:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-11-18 22:55:46,046 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 110 [2018-11-18 22:55:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:46,046 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-11-18 22:55:46,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:55:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:55:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:55:46,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:46,047 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:46,047 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:46,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -221433877, now seen corresponding path program 24 times [2018-11-18 22:55:46,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:46,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:46,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:46,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {15005#true} call ULTIMATE.init(); {15005#true} is VALID [2018-11-18 22:55:46,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {15005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15005#true} is VALID [2018-11-18 22:55:46,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {15005#true} assume true; {15005#true} is VALID [2018-11-18 22:55:46,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15005#true} {15005#true} #64#return; {15005#true} is VALID [2018-11-18 22:55:46,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {15005#true} call #t~ret2 := main(); {15005#true} is VALID [2018-11-18 22:55:46,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {15005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15007#(= main_~i~0 0)} is VALID [2018-11-18 22:55:46,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {15007#(= main_~i~0 0)} assume true; {15007#(= main_~i~0 0)} is VALID [2018-11-18 22:55:46,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {15007#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15008#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:46,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {15008#(<= main_~i~0 1)} assume true; {15008#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:46,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {15008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15009#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:46,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {15009#(<= main_~i~0 2)} assume true; {15009#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:46,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {15009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15010#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:46,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {15010#(<= main_~i~0 3)} assume true; {15010#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:46,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {15010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15011#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:46,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {15011#(<= main_~i~0 4)} assume true; {15011#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:46,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {15011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15012#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:46,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {15012#(<= main_~i~0 5)} assume true; {15012#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:46,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {15012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15013#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:46,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {15013#(<= main_~i~0 6)} assume true; {15013#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:46,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {15013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15014#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:46,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {15014#(<= main_~i~0 7)} assume true; {15014#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:46,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {15014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15015#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:46,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {15015#(<= main_~i~0 8)} assume true; {15015#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:46,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {15015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15016#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:46,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {15016#(<= main_~i~0 9)} assume true; {15016#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:46,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {15016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15017#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:46,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {15017#(<= main_~i~0 10)} assume true; {15017#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:46,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {15017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:46,856 INFO L273 TraceCheckUtils]: 28: Hoare triple {15018#(<= main_~i~0 11)} assume true; {15018#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:46,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {15018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15019#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:46,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {15019#(<= main_~i~0 12)} assume true; {15019#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:46,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {15019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15020#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:46,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {15020#(<= main_~i~0 13)} assume true; {15020#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:46,860 INFO L273 TraceCheckUtils]: 33: Hoare triple {15020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15021#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:46,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {15021#(<= main_~i~0 14)} assume true; {15021#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:46,861 INFO L273 TraceCheckUtils]: 35: Hoare triple {15021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15022#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:46,862 INFO L273 TraceCheckUtils]: 36: Hoare triple {15022#(<= main_~i~0 15)} assume true; {15022#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:46,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {15022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15023#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:46,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {15023#(<= main_~i~0 16)} assume true; {15023#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:46,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {15023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15024#(<= main_~i~0 17)} is VALID [2018-11-18 22:55:46,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {15024#(<= main_~i~0 17)} assume true; {15024#(<= main_~i~0 17)} is VALID [2018-11-18 22:55:46,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {15024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15025#(<= main_~i~0 18)} is VALID [2018-11-18 22:55:46,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {15025#(<= main_~i~0 18)} assume true; {15025#(<= main_~i~0 18)} is VALID [2018-11-18 22:55:46,867 INFO L273 TraceCheckUtils]: 43: Hoare triple {15025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15026#(<= main_~i~0 19)} is VALID [2018-11-18 22:55:46,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {15026#(<= main_~i~0 19)} assume true; {15026#(<= main_~i~0 19)} is VALID [2018-11-18 22:55:46,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {15026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15027#(<= main_~i~0 20)} is VALID [2018-11-18 22:55:46,869 INFO L273 TraceCheckUtils]: 46: Hoare triple {15027#(<= main_~i~0 20)} assume true; {15027#(<= main_~i~0 20)} is VALID [2018-11-18 22:55:46,870 INFO L273 TraceCheckUtils]: 47: Hoare triple {15027#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15028#(<= main_~i~0 21)} is VALID [2018-11-18 22:55:46,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {15028#(<= main_~i~0 21)} assume true; {15028#(<= main_~i~0 21)} is VALID [2018-11-18 22:55:46,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {15028#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15029#(<= main_~i~0 22)} is VALID [2018-11-18 22:55:46,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {15029#(<= main_~i~0 22)} assume true; {15029#(<= main_~i~0 22)} is VALID [2018-11-18 22:55:46,873 INFO L273 TraceCheckUtils]: 51: Hoare triple {15029#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15030#(<= main_~i~0 23)} is VALID [2018-11-18 22:55:46,873 INFO L273 TraceCheckUtils]: 52: Hoare triple {15030#(<= main_~i~0 23)} assume true; {15030#(<= main_~i~0 23)} is VALID [2018-11-18 22:55:46,874 INFO L273 TraceCheckUtils]: 53: Hoare triple {15030#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15031#(<= main_~i~0 24)} is VALID [2018-11-18 22:55:46,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {15031#(<= main_~i~0 24)} assume true; {15031#(<= main_~i~0 24)} is VALID [2018-11-18 22:55:46,875 INFO L273 TraceCheckUtils]: 55: Hoare triple {15031#(<= main_~i~0 24)} assume !(~i~0 < 100000); {15006#false} is VALID [2018-11-18 22:55:46,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {15006#false} ~i~0 := 0; {15006#false} is VALID [2018-11-18 22:55:46,876 INFO L273 TraceCheckUtils]: 57: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,877 INFO L273 TraceCheckUtils]: 61: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,877 INFO L273 TraceCheckUtils]: 62: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 66: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 68: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 69: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,878 INFO L273 TraceCheckUtils]: 70: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,879 INFO L273 TraceCheckUtils]: 71: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,879 INFO L273 TraceCheckUtils]: 74: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 82: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 83: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 85: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,882 INFO L273 TraceCheckUtils]: 95: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 99: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 101: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,883 INFO L273 TraceCheckUtils]: 102: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 106: Hoare triple {15006#false} assume !(~i~0 < 100000); {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 107: Hoare triple {15006#false} havoc ~x~0;~x~0 := 0; {15006#false} is VALID [2018-11-18 22:55:46,884 INFO L273 TraceCheckUtils]: 108: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:55:46,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {15006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15006#false} is VALID [2018-11-18 22:55:46,885 INFO L256 TraceCheckUtils]: 110: Hoare triple {15006#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15006#false} is VALID [2018-11-18 22:55:46,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {15006#false} ~cond := #in~cond; {15006#false} is VALID [2018-11-18 22:55:46,885 INFO L273 TraceCheckUtils]: 112: Hoare triple {15006#false} assume 0 == ~cond; {15006#false} is VALID [2018-11-18 22:55:46,885 INFO L273 TraceCheckUtils]: 113: Hoare triple {15006#false} assume !false; {15006#false} is VALID [2018-11-18 22:55:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-18 22:55:46,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:46,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:55:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:56,931 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-18 22:56:56,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:57,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:57,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {15005#true} call ULTIMATE.init(); {15005#true} is VALID [2018-11-18 22:56:57,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {15005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15005#true} is VALID [2018-11-18 22:56:57,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {15005#true} assume true; {15005#true} is VALID [2018-11-18 22:56:57,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15005#true} {15005#true} #64#return; {15005#true} is VALID [2018-11-18 22:56:57,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {15005#true} call #t~ret2 := main(); {15005#true} is VALID [2018-11-18 22:56:57,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {15005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15050#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {15050#(<= main_~i~0 0)} assume true; {15050#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {15050#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15008#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {15008#(<= main_~i~0 1)} assume true; {15008#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {15008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15009#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {15009#(<= main_~i~0 2)} assume true; {15009#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {15009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15010#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {15010#(<= main_~i~0 3)} assume true; {15010#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {15010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15011#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {15011#(<= main_~i~0 4)} assume true; {15011#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {15011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15012#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {15012#(<= main_~i~0 5)} assume true; {15012#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {15012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15013#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {15013#(<= main_~i~0 6)} assume true; {15013#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {15013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15014#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {15014#(<= main_~i~0 7)} assume true; {15014#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {15014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15015#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {15015#(<= main_~i~0 8)} assume true; {15015#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {15015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15016#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {15016#(<= main_~i~0 9)} assume true; {15016#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {15016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15017#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {15017#(<= main_~i~0 10)} assume true; {15017#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {15017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {15018#(<= main_~i~0 11)} assume true; {15018#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {15018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15019#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {15019#(<= main_~i~0 12)} assume true; {15019#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {15019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15020#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {15020#(<= main_~i~0 13)} assume true; {15020#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {15020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15021#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:57,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {15021#(<= main_~i~0 14)} assume true; {15021#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:57,247 INFO L273 TraceCheckUtils]: 35: Hoare triple {15021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15022#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:57,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {15022#(<= main_~i~0 15)} assume true; {15022#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:57,248 INFO L273 TraceCheckUtils]: 37: Hoare triple {15022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15023#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:57,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {15023#(<= main_~i~0 16)} assume true; {15023#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:57,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {15023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15024#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:57,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {15024#(<= main_~i~0 17)} assume true; {15024#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:57,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {15024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15025#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:57,252 INFO L273 TraceCheckUtils]: 42: Hoare triple {15025#(<= main_~i~0 18)} assume true; {15025#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:57,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {15025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15026#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:57,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {15026#(<= main_~i~0 19)} assume true; {15026#(<= main_~i~0 19)} is VALID [2018-11-18 22:56:57,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {15026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15027#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:57,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {15027#(<= main_~i~0 20)} assume true; {15027#(<= main_~i~0 20)} is VALID [2018-11-18 22:56:57,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {15027#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15028#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:57,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {15028#(<= main_~i~0 21)} assume true; {15028#(<= main_~i~0 21)} is VALID [2018-11-18 22:56:57,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {15028#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15029#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:57,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {15029#(<= main_~i~0 22)} assume true; {15029#(<= main_~i~0 22)} is VALID [2018-11-18 22:56:57,258 INFO L273 TraceCheckUtils]: 51: Hoare triple {15029#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15030#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:57,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {15030#(<= main_~i~0 23)} assume true; {15030#(<= main_~i~0 23)} is VALID [2018-11-18 22:56:57,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {15030#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15031#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:57,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {15031#(<= main_~i~0 24)} assume true; {15031#(<= main_~i~0 24)} is VALID [2018-11-18 22:56:57,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {15031#(<= main_~i~0 24)} assume !(~i~0 < 100000); {15006#false} is VALID [2018-11-18 22:56:57,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {15006#false} ~i~0 := 0; {15006#false} is VALID [2018-11-18 22:56:57,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,263 INFO L273 TraceCheckUtils]: 62: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 72: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 78: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 79: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 85: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 93: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 96: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 98: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 99: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 100: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 101: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 102: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 104: Hoare triple {15006#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 105: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 106: Hoare triple {15006#false} assume !(~i~0 < 100000); {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 107: Hoare triple {15006#false} havoc ~x~0;~x~0 := 0; {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 108: Hoare triple {15006#false} assume true; {15006#false} is VALID [2018-11-18 22:56:57,269 INFO L273 TraceCheckUtils]: 109: Hoare triple {15006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15006#false} is VALID [2018-11-18 22:56:57,270 INFO L256 TraceCheckUtils]: 110: Hoare triple {15006#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15006#false} is VALID [2018-11-18 22:56:57,270 INFO L273 TraceCheckUtils]: 111: Hoare triple {15006#false} ~cond := #in~cond; {15006#false} is VALID [2018-11-18 22:56:57,270 INFO L273 TraceCheckUtils]: 112: Hoare triple {15006#false} assume 0 == ~cond; {15006#false} is VALID [2018-11-18 22:56:57,270 INFO L273 TraceCheckUtils]: 113: Hoare triple {15006#false} assume !false; {15006#false} is VALID [2018-11-18 22:56:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-18 22:56:57,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:57,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-18 22:56:57,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-18 22:56:57,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:57,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:56:57,643 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-18 22:56:57,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:56:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:56:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:56:57,645 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 28 states. [2018-11-18 22:56:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:58,264 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-11-18 22:56:58,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:56:58,264 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-18 22:56:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 143 transitions. [2018-11-18 22:56:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 143 transitions. [2018-11-18 22:56:58,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 143 transitions. [2018-11-18 22:56:58,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:58,798 INFO L225 Difference]: With dead ends: 186 [2018-11-18 22:56:58,798 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 22:56:58,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:56:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 22:57:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-18 22:57:00,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:00,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2018-11-18 22:57:00,199 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2018-11-18 22:57:00,199 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2018-11-18 22:57:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:00,201 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-18 22:57:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-18 22:57:00,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:00,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:00,202 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2018-11-18 22:57:00,202 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2018-11-18 22:57:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:00,204 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-18 22:57:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-18 22:57:00,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:00,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:00,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:00,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 22:57:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-11-18 22:57:00,207 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 114 [2018-11-18 22:57:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:00,208 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-11-18 22:57:00,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:57:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-18 22:57:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 22:57:00,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:00,209 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:00,209 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:00,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1390508971, now seen corresponding path program 25 times [2018-11-18 22:57:00,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:00,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:01,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {16075#true} call ULTIMATE.init(); {16075#true} is VALID [2018-11-18 22:57:01,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {16075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16075#true} is VALID [2018-11-18 22:57:01,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {16075#true} assume true; {16075#true} is VALID [2018-11-18 22:57:01,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16075#true} {16075#true} #64#return; {16075#true} is VALID [2018-11-18 22:57:01,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {16075#true} call #t~ret2 := main(); {16075#true} is VALID [2018-11-18 22:57:01,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {16075#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16077#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {16077#(= main_~i~0 0)} assume true; {16077#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {16077#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16078#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {16078#(<= main_~i~0 1)} assume true; {16078#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {16078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16079#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {16079#(<= main_~i~0 2)} assume true; {16079#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {16079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16080#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {16080#(<= main_~i~0 3)} assume true; {16080#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {16080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16081#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {16081#(<= main_~i~0 4)} assume true; {16081#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {16081#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16082#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {16082#(<= main_~i~0 5)} assume true; {16082#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {16082#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16083#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {16083#(<= main_~i~0 6)} assume true; {16083#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {16083#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16084#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {16084#(<= main_~i~0 7)} assume true; {16084#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {16084#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16085#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {16085#(<= main_~i~0 8)} assume true; {16085#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {16085#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16086#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {16086#(<= main_~i~0 9)} assume true; {16086#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {16086#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16087#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {16087#(<= main_~i~0 10)} assume true; {16087#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {16087#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16088#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {16088#(<= main_~i~0 11)} assume true; {16088#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {16088#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16089#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {16089#(<= main_~i~0 12)} assume true; {16089#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {16089#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16090#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {16090#(<= main_~i~0 13)} assume true; {16090#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {16090#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16091#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {16091#(<= main_~i~0 14)} assume true; {16091#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {16091#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16092#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {16092#(<= main_~i~0 15)} assume true; {16092#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {16092#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16093#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:01,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {16093#(<= main_~i~0 16)} assume true; {16093#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:01,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {16093#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16094#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:01,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {16094#(<= main_~i~0 17)} assume true; {16094#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:01,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {16094#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16095#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:01,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {16095#(<= main_~i~0 18)} assume true; {16095#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:01,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {16095#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16096#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:01,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {16096#(<= main_~i~0 19)} assume true; {16096#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:01,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {16096#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16097#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:01,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {16097#(<= main_~i~0 20)} assume true; {16097#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:01,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {16097#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16098#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:01,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {16098#(<= main_~i~0 21)} assume true; {16098#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:01,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {16098#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16099#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:01,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {16099#(<= main_~i~0 22)} assume true; {16099#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:01,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {16099#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16100#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:01,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {16100#(<= main_~i~0 23)} assume true; {16100#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:01,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {16100#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16101#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:01,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {16101#(<= main_~i~0 24)} assume true; {16101#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:01,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {16101#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16102#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:01,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {16102#(<= main_~i~0 25)} assume true; {16102#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:01,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {16102#(<= main_~i~0 25)} assume !(~i~0 < 100000); {16076#false} is VALID [2018-11-18 22:57:01,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {16076#false} ~i~0 := 0; {16076#false} is VALID [2018-11-18 22:57:01,426 INFO L273 TraceCheckUtils]: 59: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,426 INFO L273 TraceCheckUtils]: 60: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 61: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 62: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 65: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,427 INFO L273 TraceCheckUtils]: 66: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 71: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,428 INFO L273 TraceCheckUtils]: 72: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,429 INFO L273 TraceCheckUtils]: 73: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,429 INFO L273 TraceCheckUtils]: 74: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 78: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 79: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 83: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 84: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 85: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 88: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 90: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 91: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 92: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 94: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 95: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,431 INFO L273 TraceCheckUtils]: 96: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 97: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 98: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 99: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 100: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 101: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 102: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 103: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 104: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,432 INFO L273 TraceCheckUtils]: 105: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 106: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 107: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 108: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 109: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 110: Hoare triple {16076#false} assume !(~i~0 < 100000); {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 111: Hoare triple {16076#false} havoc ~x~0;~x~0 := 0; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L273 TraceCheckUtils]: 113: Hoare triple {16076#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16076#false} is VALID [2018-11-18 22:57:01,433 INFO L256 TraceCheckUtils]: 114: Hoare triple {16076#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {16076#false} is VALID [2018-11-18 22:57:01,434 INFO L273 TraceCheckUtils]: 115: Hoare triple {16076#false} ~cond := #in~cond; {16076#false} is VALID [2018-11-18 22:57:01,434 INFO L273 TraceCheckUtils]: 116: Hoare triple {16076#false} assume 0 == ~cond; {16076#false} is VALID [2018-11-18 22:57:01,434 INFO L273 TraceCheckUtils]: 117: Hoare triple {16076#false} assume !false; {16076#false} is VALID [2018-11-18 22:57:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-18 22:57:01,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:01,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:01,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:01,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:01,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {16075#true} call ULTIMATE.init(); {16075#true} is VALID [2018-11-18 22:57:01,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {16075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16075#true} is VALID [2018-11-18 22:57:01,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {16075#true} assume true; {16075#true} is VALID [2018-11-18 22:57:01,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16075#true} {16075#true} #64#return; {16075#true} is VALID [2018-11-18 22:57:01,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {16075#true} call #t~ret2 := main(); {16075#true} is VALID [2018-11-18 22:57:01,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {16075#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16121#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {16121#(<= main_~i~0 0)} assume true; {16121#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {16121#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16078#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {16078#(<= main_~i~0 1)} assume true; {16078#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {16078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16079#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {16079#(<= main_~i~0 2)} assume true; {16079#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {16079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16080#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {16080#(<= main_~i~0 3)} assume true; {16080#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {16080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16081#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {16081#(<= main_~i~0 4)} assume true; {16081#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {16081#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16082#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {16082#(<= main_~i~0 5)} assume true; {16082#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,738 INFO L273 TraceCheckUtils]: 17: Hoare triple {16082#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16083#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {16083#(<= main_~i~0 6)} assume true; {16083#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {16083#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16084#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {16084#(<= main_~i~0 7)} assume true; {16084#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {16084#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16085#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {16085#(<= main_~i~0 8)} assume true; {16085#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {16085#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16086#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {16086#(<= main_~i~0 9)} assume true; {16086#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {16086#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16087#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {16087#(<= main_~i~0 10)} assume true; {16087#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {16087#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16088#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {16088#(<= main_~i~0 11)} assume true; {16088#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {16088#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16089#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {16089#(<= main_~i~0 12)} assume true; {16089#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {16089#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16090#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {16090#(<= main_~i~0 13)} assume true; {16090#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {16090#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16091#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {16091#(<= main_~i~0 14)} assume true; {16091#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {16091#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16092#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {16092#(<= main_~i~0 15)} assume true; {16092#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {16092#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16093#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:01,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {16093#(<= main_~i~0 16)} assume true; {16093#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:01,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {16093#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16094#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:01,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {16094#(<= main_~i~0 17)} assume true; {16094#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:01,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {16094#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16095#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:01,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {16095#(<= main_~i~0 18)} assume true; {16095#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:01,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {16095#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16096#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:01,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {16096#(<= main_~i~0 19)} assume true; {16096#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:01,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {16096#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16097#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:01,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {16097#(<= main_~i~0 20)} assume true; {16097#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:01,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {16097#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16098#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:01,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {16098#(<= main_~i~0 21)} assume true; {16098#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:01,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {16098#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16099#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:01,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {16099#(<= main_~i~0 22)} assume true; {16099#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:01,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {16099#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16100#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:01,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {16100#(<= main_~i~0 23)} assume true; {16100#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:01,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {16100#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16101#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:01,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {16101#(<= main_~i~0 24)} assume true; {16101#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:01,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {16101#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16102#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:01,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {16102#(<= main_~i~0 25)} assume true; {16102#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:01,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {16102#(<= main_~i~0 25)} assume !(~i~0 < 100000); {16076#false} is VALID [2018-11-18 22:57:01,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {16076#false} ~i~0 := 0; {16076#false} is VALID [2018-11-18 22:57:01,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,766 INFO L273 TraceCheckUtils]: 64: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,767 INFO L273 TraceCheckUtils]: 66: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,767 INFO L273 TraceCheckUtils]: 67: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,767 INFO L273 TraceCheckUtils]: 69: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,767 INFO L273 TraceCheckUtils]: 70: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 71: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 72: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 73: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 74: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 75: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 76: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,768 INFO L273 TraceCheckUtils]: 77: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 78: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 79: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 80: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 81: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 82: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,769 INFO L273 TraceCheckUtils]: 83: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 84: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 85: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 86: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 88: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 89: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,770 INFO L273 TraceCheckUtils]: 90: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 91: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 92: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 93: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 94: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 95: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,771 INFO L273 TraceCheckUtils]: 96: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 97: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 98: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 99: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 100: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 101: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 102: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,772 INFO L273 TraceCheckUtils]: 103: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 104: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 105: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 106: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 107: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 108: Hoare triple {16076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 109: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,773 INFO L273 TraceCheckUtils]: 110: Hoare triple {16076#false} assume !(~i~0 < 100000); {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L273 TraceCheckUtils]: 111: Hoare triple {16076#false} havoc ~x~0;~x~0 := 0; {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L273 TraceCheckUtils]: 112: Hoare triple {16076#false} assume true; {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L273 TraceCheckUtils]: 113: Hoare triple {16076#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L256 TraceCheckUtils]: 114: Hoare triple {16076#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L273 TraceCheckUtils]: 115: Hoare triple {16076#false} ~cond := #in~cond; {16076#false} is VALID [2018-11-18 22:57:01,774 INFO L273 TraceCheckUtils]: 116: Hoare triple {16076#false} assume 0 == ~cond; {16076#false} is VALID [2018-11-18 22:57:01,775 INFO L273 TraceCheckUtils]: 117: Hoare triple {16076#false} assume !false; {16076#false} is VALID [2018-11-18 22:57:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-18 22:57:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:01,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-18 22:57:01,805 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-11-18 22:57:01,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:01,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 22:57:01,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 22:57:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 22:57:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:01,894 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 29 states. [2018-11-18 22:57:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:02,618 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-11-18 22:57:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:57:02,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-11-18 22:57:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 147 transitions. [2018-11-18 22:57:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 147 transitions. [2018-11-18 22:57:02,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 147 transitions. [2018-11-18 22:57:02,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:02,821 INFO L225 Difference]: With dead ends: 192 [2018-11-18 22:57:02,821 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 22:57:02,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 22:57:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-18 22:57:02,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:02,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 127 states. [2018-11-18 22:57:02,891 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 127 states. [2018-11-18 22:57:02,891 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 127 states. [2018-11-18 22:57:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:02,893 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-18 22:57:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-11-18 22:57:02,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:02,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:02,894 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 127 states. [2018-11-18 22:57:02,894 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 127 states. [2018-11-18 22:57:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:02,896 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-18 22:57:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-11-18 22:57:02,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:02,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:02,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:02,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 22:57:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-11-18 22:57:02,899 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 118 [2018-11-18 22:57:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:02,900 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-11-18 22:57:02,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 22:57:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-11-18 22:57:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 22:57:02,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:02,901 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:02,901 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:02,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2049094763, now seen corresponding path program 26 times [2018-11-18 22:57:02,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:02,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:05,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {17181#true} call ULTIMATE.init(); {17181#true} is VALID [2018-11-18 22:57:05,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {17181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17181#true} is VALID [2018-11-18 22:57:05,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {17181#true} assume true; {17181#true} is VALID [2018-11-18 22:57:05,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17181#true} {17181#true} #64#return; {17181#true} is VALID [2018-11-18 22:57:05,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {17181#true} call #t~ret2 := main(); {17181#true} is VALID [2018-11-18 22:57:05,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {17181#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {17183#(= main_~i~0 0)} is VALID [2018-11-18 22:57:05,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {17183#(= main_~i~0 0)} assume true; {17183#(= main_~i~0 0)} is VALID [2018-11-18 22:57:05,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {17183#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17184#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {17184#(<= main_~i~0 1)} assume true; {17184#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {17184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17185#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {17185#(<= main_~i~0 2)} assume true; {17185#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {17185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17186#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {17186#(<= main_~i~0 3)} assume true; {17186#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {17186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17187#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {17187#(<= main_~i~0 4)} assume true; {17187#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {17187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17188#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {17188#(<= main_~i~0 5)} assume true; {17188#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {17188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17189#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {17189#(<= main_~i~0 6)} assume true; {17189#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {17189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17190#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {17190#(<= main_~i~0 7)} assume true; {17190#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {17190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17191#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {17191#(<= main_~i~0 8)} assume true; {17191#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {17191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17192#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {17192#(<= main_~i~0 9)} assume true; {17192#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {17192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17193#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {17193#(<= main_~i~0 10)} assume true; {17193#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {17193#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17194#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {17194#(<= main_~i~0 11)} assume true; {17194#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {17194#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17195#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {17195#(<= main_~i~0 12)} assume true; {17195#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {17195#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17196#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {17196#(<= main_~i~0 13)} assume true; {17196#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,129 INFO L273 TraceCheckUtils]: 33: Hoare triple {17196#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17197#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {17197#(<= main_~i~0 14)} assume true; {17197#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {17197#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17198#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {17198#(<= main_~i~0 15)} assume true; {17198#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {17198#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17199#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {17199#(<= main_~i~0 16)} assume true; {17199#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {17199#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17200#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {17200#(<= main_~i~0 17)} assume true; {17200#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {17200#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17201#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {17201#(<= main_~i~0 18)} assume true; {17201#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {17201#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17202#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {17202#(<= main_~i~0 19)} assume true; {17202#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {17202#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17203#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {17203#(<= main_~i~0 20)} assume true; {17203#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {17203#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17204#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {17204#(<= main_~i~0 21)} assume true; {17204#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {17204#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17205#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {17205#(<= main_~i~0 22)} assume true; {17205#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {17205#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17206#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {17206#(<= main_~i~0 23)} assume true; {17206#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {17206#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17207#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {17207#(<= main_~i~0 24)} assume true; {17207#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {17207#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17208#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {17208#(<= main_~i~0 25)} assume true; {17208#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {17208#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17209#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {17209#(<= main_~i~0 26)} assume true; {17209#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {17209#(<= main_~i~0 26)} assume !(~i~0 < 100000); {17182#false} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {17182#false} ~i~0 := 0; {17182#false} is VALID [2018-11-18 22:57:05,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 63: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 64: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 65: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,149 INFO L273 TraceCheckUtils]: 66: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 71: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,150 INFO L273 TraceCheckUtils]: 72: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 74: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 76: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 77: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 78: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 79: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 80: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,151 INFO L273 TraceCheckUtils]: 81: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 82: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 83: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 84: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 85: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 86: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 87: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 88: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 89: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,152 INFO L273 TraceCheckUtils]: 90: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 91: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 92: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 93: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 94: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 95: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 96: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 97: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 98: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,153 INFO L273 TraceCheckUtils]: 99: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 100: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 101: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 102: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 103: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 104: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 105: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 106: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 107: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 108: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,154 INFO L273 TraceCheckUtils]: 109: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 110: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 111: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 112: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 113: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 114: Hoare triple {17182#false} assume !(~i~0 < 100000); {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 115: Hoare triple {17182#false} havoc ~x~0;~x~0 := 0; {17182#false} is VALID [2018-11-18 22:57:05,155 INFO L273 TraceCheckUtils]: 116: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,156 INFO L273 TraceCheckUtils]: 117: Hoare triple {17182#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17182#false} is VALID [2018-11-18 22:57:05,156 INFO L256 TraceCheckUtils]: 118: Hoare triple {17182#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {17182#false} is VALID [2018-11-18 22:57:05,156 INFO L273 TraceCheckUtils]: 119: Hoare triple {17182#false} ~cond := #in~cond; {17182#false} is VALID [2018-11-18 22:57:05,156 INFO L273 TraceCheckUtils]: 120: Hoare triple {17182#false} assume 0 == ~cond; {17182#false} is VALID [2018-11-18 22:57:05,156 INFO L273 TraceCheckUtils]: 121: Hoare triple {17182#false} assume !false; {17182#false} is VALID [2018-11-18 22:57:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-11-18 22:57:05,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:05,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:05,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:05,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:05,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:05,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {17181#true} call ULTIMATE.init(); {17181#true} is VALID [2018-11-18 22:57:05,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {17181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17181#true} is VALID [2018-11-18 22:57:05,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {17181#true} assume true; {17181#true} is VALID [2018-11-18 22:57:05,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17181#true} {17181#true} #64#return; {17181#true} is VALID [2018-11-18 22:57:05,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {17181#true} call #t~ret2 := main(); {17181#true} is VALID [2018-11-18 22:57:05,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {17181#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {17228#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {17228#(<= main_~i~0 0)} assume true; {17228#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {17228#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17184#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {17184#(<= main_~i~0 1)} assume true; {17184#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {17184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17185#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {17185#(<= main_~i~0 2)} assume true; {17185#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {17185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17186#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {17186#(<= main_~i~0 3)} assume true; {17186#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {17186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17187#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {17187#(<= main_~i~0 4)} assume true; {17187#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,494 INFO L273 TraceCheckUtils]: 15: Hoare triple {17187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17188#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {17188#(<= main_~i~0 5)} assume true; {17188#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {17188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17189#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {17189#(<= main_~i~0 6)} assume true; {17189#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {17189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17190#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {17190#(<= main_~i~0 7)} assume true; {17190#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {17190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17191#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {17191#(<= main_~i~0 8)} assume true; {17191#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {17191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17192#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {17192#(<= main_~i~0 9)} assume true; {17192#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {17192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17193#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {17193#(<= main_~i~0 10)} assume true; {17193#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {17193#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17194#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {17194#(<= main_~i~0 11)} assume true; {17194#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {17194#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17195#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {17195#(<= main_~i~0 12)} assume true; {17195#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {17195#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17196#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {17196#(<= main_~i~0 13)} assume true; {17196#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {17196#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17197#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {17197#(<= main_~i~0 14)} assume true; {17197#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {17197#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17198#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {17198#(<= main_~i~0 15)} assume true; {17198#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {17198#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17199#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {17199#(<= main_~i~0 16)} assume true; {17199#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {17199#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17200#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {17200#(<= main_~i~0 17)} assume true; {17200#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:05,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {17200#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17201#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {17201#(<= main_~i~0 18)} assume true; {17201#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:05,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {17201#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17202#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {17202#(<= main_~i~0 19)} assume true; {17202#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:05,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {17202#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17203#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {17203#(<= main_~i~0 20)} assume true; {17203#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:05,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {17203#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17204#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {17204#(<= main_~i~0 21)} assume true; {17204#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:05,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {17204#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17205#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,520 INFO L273 TraceCheckUtils]: 50: Hoare triple {17205#(<= main_~i~0 22)} assume true; {17205#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:05,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {17205#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17206#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {17206#(<= main_~i~0 23)} assume true; {17206#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:05,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {17206#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17207#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {17207#(<= main_~i~0 24)} assume true; {17207#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:05,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {17207#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17208#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {17208#(<= main_~i~0 25)} assume true; {17208#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:05,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {17208#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17209#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {17209#(<= main_~i~0 26)} assume true; {17209#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:05,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {17209#(<= main_~i~0 26)} assume !(~i~0 < 100000); {17182#false} is VALID [2018-11-18 22:57:05,526 INFO L273 TraceCheckUtils]: 60: Hoare triple {17182#false} ~i~0 := 0; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 77: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 79: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,529 INFO L273 TraceCheckUtils]: 82: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 85: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 86: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 88: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 90: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,530 INFO L273 TraceCheckUtils]: 91: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 92: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 93: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 94: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 95: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 96: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 97: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 98: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 99: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,531 INFO L273 TraceCheckUtils]: 100: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 101: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 102: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 103: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 104: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 105: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 106: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 107: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 108: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,532 INFO L273 TraceCheckUtils]: 109: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 110: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 111: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 112: Hoare triple {17182#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 113: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 114: Hoare triple {17182#false} assume !(~i~0 < 100000); {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 115: Hoare triple {17182#false} havoc ~x~0;~x~0 := 0; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 116: Hoare triple {17182#false} assume true; {17182#false} is VALID [2018-11-18 22:57:05,533 INFO L273 TraceCheckUtils]: 117: Hoare triple {17182#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17182#false} is VALID [2018-11-18 22:57:05,534 INFO L256 TraceCheckUtils]: 118: Hoare triple {17182#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {17182#false} is VALID [2018-11-18 22:57:05,534 INFO L273 TraceCheckUtils]: 119: Hoare triple {17182#false} ~cond := #in~cond; {17182#false} is VALID [2018-11-18 22:57:05,534 INFO L273 TraceCheckUtils]: 120: Hoare triple {17182#false} assume 0 == ~cond; {17182#false} is VALID [2018-11-18 22:57:05,534 INFO L273 TraceCheckUtils]: 121: Hoare triple {17182#false} assume !false; {17182#false} is VALID [2018-11-18 22:57:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-11-18 22:57:05,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:05,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-18 22:57:05,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2018-11-18 22:57:05,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:05,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:57:05,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:05,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:57:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:57:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:05,633 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 30 states. [2018-11-18 22:57:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,568 INFO L93 Difference]: Finished difference Result 198 states and 203 transitions. [2018-11-18 22:57:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 22:57:06,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2018-11-18 22:57:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 151 transitions. [2018-11-18 22:57:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 151 transitions. [2018-11-18 22:57:06,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 151 transitions. [2018-11-18 22:57:06,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:06,709 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:57:06,709 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 22:57:06,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 22:57:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-18 22:57:06,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:06,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 131 states. [2018-11-18 22:57:06,785 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2018-11-18 22:57:06,785 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2018-11-18 22:57:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,787 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-11-18 22:57:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-11-18 22:57:06,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:06,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:06,788 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2018-11-18 22:57:06,788 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2018-11-18 22:57:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,790 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-11-18 22:57:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-11-18 22:57:06,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:06,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:06,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:06,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 22:57:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-11-18 22:57:06,793 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 122 [2018-11-18 22:57:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:06,793 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-11-18 22:57:06,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:57:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-11-18 22:57:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 22:57:06,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:06,794 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:06,794 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:06,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1934826027, now seen corresponding path program 27 times [2018-11-18 22:57:06,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:06,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:07,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {18323#true} call ULTIMATE.init(); {18323#true} is VALID [2018-11-18 22:57:07,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {18323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18323#true} is VALID [2018-11-18 22:57:07,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {18323#true} assume true; {18323#true} is VALID [2018-11-18 22:57:07,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18323#true} {18323#true} #64#return; {18323#true} is VALID [2018-11-18 22:57:07,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {18323#true} call #t~ret2 := main(); {18323#true} is VALID [2018-11-18 22:57:07,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {18323#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {18325#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {18325#(= main_~i~0 0)} assume true; {18325#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {18325#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18326#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {18326#(<= main_~i~0 1)} assume true; {18326#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {18326#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18327#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {18327#(<= main_~i~0 2)} assume true; {18327#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {18327#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18328#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {18328#(<= main_~i~0 3)} assume true; {18328#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {18328#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18329#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {18329#(<= main_~i~0 4)} assume true; {18329#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {18329#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18330#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {18330#(<= main_~i~0 5)} assume true; {18330#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {18330#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18331#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {18331#(<= main_~i~0 6)} assume true; {18331#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {18331#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18332#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {18332#(<= main_~i~0 7)} assume true; {18332#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {18332#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18333#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {18333#(<= main_~i~0 8)} assume true; {18333#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {18333#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18334#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {18334#(<= main_~i~0 9)} assume true; {18334#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {18334#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18335#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {18335#(<= main_~i~0 10)} assume true; {18335#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {18335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18336#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {18336#(<= main_~i~0 11)} assume true; {18336#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {18336#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18337#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {18337#(<= main_~i~0 12)} assume true; {18337#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {18337#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18338#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {18338#(<= main_~i~0 13)} assume true; {18338#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {18338#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18339#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {18339#(<= main_~i~0 14)} assume true; {18339#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {18339#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18340#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {18340#(<= main_~i~0 15)} assume true; {18340#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,831 INFO L273 TraceCheckUtils]: 37: Hoare triple {18340#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18341#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {18341#(<= main_~i~0 16)} assume true; {18341#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,833 INFO L273 TraceCheckUtils]: 39: Hoare triple {18341#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18342#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:07,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {18342#(<= main_~i~0 17)} assume true; {18342#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:07,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {18342#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18343#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:07,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {18343#(<= main_~i~0 18)} assume true; {18343#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:07,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {18343#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18344#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:07,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {18344#(<= main_~i~0 19)} assume true; {18344#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:07,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {18344#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18345#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:07,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {18345#(<= main_~i~0 20)} assume true; {18345#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:07,838 INFO L273 TraceCheckUtils]: 47: Hoare triple {18345#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18346#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:07,839 INFO L273 TraceCheckUtils]: 48: Hoare triple {18346#(<= main_~i~0 21)} assume true; {18346#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:07,840 INFO L273 TraceCheckUtils]: 49: Hoare triple {18346#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18347#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:07,840 INFO L273 TraceCheckUtils]: 50: Hoare triple {18347#(<= main_~i~0 22)} assume true; {18347#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:07,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {18347#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18348#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:07,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {18348#(<= main_~i~0 23)} assume true; {18348#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:07,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {18348#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18349#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:07,843 INFO L273 TraceCheckUtils]: 54: Hoare triple {18349#(<= main_~i~0 24)} assume true; {18349#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:07,844 INFO L273 TraceCheckUtils]: 55: Hoare triple {18349#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18350#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:07,845 INFO L273 TraceCheckUtils]: 56: Hoare triple {18350#(<= main_~i~0 25)} assume true; {18350#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:07,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {18350#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18351#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:07,846 INFO L273 TraceCheckUtils]: 58: Hoare triple {18351#(<= main_~i~0 26)} assume true; {18351#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:07,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {18351#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18352#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:07,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {18352#(<= main_~i~0 27)} assume true; {18352#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:07,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {18352#(<= main_~i~0 27)} assume !(~i~0 < 100000); {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {18324#false} ~i~0 := 0; {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,850 INFO L273 TraceCheckUtils]: 68: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,850 INFO L273 TraceCheckUtils]: 69: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,850 INFO L273 TraceCheckUtils]: 70: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,850 INFO L273 TraceCheckUtils]: 71: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,851 INFO L273 TraceCheckUtils]: 73: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,851 INFO L273 TraceCheckUtils]: 74: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,851 INFO L273 TraceCheckUtils]: 75: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,851 INFO L273 TraceCheckUtils]: 76: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,851 INFO L273 TraceCheckUtils]: 77: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 78: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 79: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 80: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 81: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 82: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 84: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 85: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 86: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 87: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 88: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 89: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 90: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 91: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,853 INFO L273 TraceCheckUtils]: 92: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 93: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 94: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 95: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 96: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 97: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 98: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 99: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 100: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,854 INFO L273 TraceCheckUtils]: 101: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 102: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 103: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 104: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 105: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 106: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 107: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 108: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 109: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,855 INFO L273 TraceCheckUtils]: 110: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 111: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 112: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 113: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 114: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 115: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 116: Hoare triple {18324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 117: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 118: Hoare triple {18324#false} assume !(~i~0 < 100000); {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 119: Hoare triple {18324#false} havoc ~x~0;~x~0 := 0; {18324#false} is VALID [2018-11-18 22:57:07,856 INFO L273 TraceCheckUtils]: 120: Hoare triple {18324#false} assume true; {18324#false} is VALID [2018-11-18 22:57:07,857 INFO L273 TraceCheckUtils]: 121: Hoare triple {18324#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18324#false} is VALID [2018-11-18 22:57:07,857 INFO L256 TraceCheckUtils]: 122: Hoare triple {18324#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {18324#false} is VALID [2018-11-18 22:57:07,857 INFO L273 TraceCheckUtils]: 123: Hoare triple {18324#false} ~cond := #in~cond; {18324#false} is VALID [2018-11-18 22:57:07,857 INFO L273 TraceCheckUtils]: 124: Hoare triple {18324#false} assume 0 == ~cond; {18324#false} is VALID [2018-11-18 22:57:07,857 INFO L273 TraceCheckUtils]: 125: Hoare triple {18324#false} assume !false; {18324#false} is VALID [2018-11-18 22:57:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-18 22:57:07,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:07,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:07,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2