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_copy2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:50:16,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:50:16,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:50:16,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:50:16,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:50:16,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:50:16,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:50:16,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:50:16,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:50:16,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:50:16,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:50:16,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:50:16,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:50:16,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:50:16,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:50:16,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:50:16,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:50:16,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:50:16,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:50:16,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:50:16,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:50:16,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:50:16,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:50:16,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:50:16,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:50:16,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:50:16,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:50:16,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:50:16,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:50:16,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:50:16,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:50:16,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:50:16,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:50:16,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:50:16,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:50:16,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:50:16,333 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:50:16,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:50:16,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:50:16,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:50:16,351 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:50:16,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:50:16,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:50:16,354 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:50:16,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:50:16,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:50:16,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:50:16,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:50:16,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:50:16,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:50:16,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:50:16,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:50:16,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:50:16,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:50:16,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:50:16,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:50:16,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:50:16,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:50:16,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:50:16,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:50:16,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:50:16,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:50:16,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:50:16,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:50:16,359 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:50:16,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:50:16,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:50:16,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:50:16,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:50:16,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:50:16,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:50:16,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:50:16,451 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:50:16,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-18 22:50:16,530 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dff9fdc1/1657c167dddd42298ed50650663f0342/FLAGb19b21c2c [2018-11-18 22:50:17,034 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:50:17,034 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-18 22:50:17,043 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dff9fdc1/1657c167dddd42298ed50650663f0342/FLAGb19b21c2c [2018-11-18 22:50:17,370 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dff9fdc1/1657c167dddd42298ed50650663f0342 [2018-11-18 22:50:17,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:50:17,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:50:17,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:50:17,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:50:17,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:50:17,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da4c069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17, skipping insertion in model container [2018-11-18 22:50:17,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:50:17,421 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:50:17,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:50:17,632 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:50:17,658 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:50:17,688 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:50:17,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17 WrapperNode [2018-11-18 22:50:17,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:50:17,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:50:17,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:50:17,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:50:17,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (1/1) ... [2018-11-18 22:50:17,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:50:17,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:50:17,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:50:17,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:50:17,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (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:50:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:50:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:50:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:50:17,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:50:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:50:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:50:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:50:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:50:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:50:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:50:18,519 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:50:18,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:18 BoogieIcfgContainer [2018-11-18 22:50:18,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:50:18,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:50:18,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:50:18,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:50:18,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:50:17" (1/3) ... [2018-11-18 22:50:18,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac84f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:18, skipping insertion in model container [2018-11-18 22:50:18,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:17" (2/3) ... [2018-11-18 22:50:18,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac84f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:18, skipping insertion in model container [2018-11-18 22:50:18,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:18" (3/3) ... [2018-11-18 22:50:18,530 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_true-unreach-call_ground.i [2018-11-18 22:50:18,540 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:50:18,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:50:18,570 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:50:18,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:50:18,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:50:18,602 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:50:18,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:50:18,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:50:18,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:50:18,603 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:50:18,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:50:18,603 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:50:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 22:50:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:50:18,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:18,634 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:50:18,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:18,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1430000846, now seen corresponding path program 1 times [2018-11-18 22:50:18,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:18,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:18,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:18,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-18 22:50:18,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-18 22:50:18,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-18 22:50:18,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2018-11-18 22:50:18,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-18 22:50:18,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {37#true} is VALID [2018-11-18 22:50:18,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-18 22:50:18,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} havoc ~i~0;~i~0 := 0; {38#false} is VALID [2018-11-18 22:50:18,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 22:50:18,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 22:50:18,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 22:50:18,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} havoc ~x~0;~x~0 := 0; {38#false} is VALID [2018-11-18 22:50:18,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-18 22:50:18,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {38#false} is VALID [2018-11-18 22:50:18,816 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {38#false} is VALID [2018-11-18 22:50:18,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-18 22:50:18,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-18 22:50:18,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-18 22:50:18,820 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:50:18,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:50:18,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 22:50:18,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:18,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:50:19,028 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:50:19,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:50:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:50:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:50:19,043 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 22:50:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:19,240 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-18 22:50:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:50:19,241 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 22:50:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:50:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 22:50:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:50:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 22:50:19,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-18 22:50:19,541 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:50:19,553 INFO L225 Difference]: With dead ends: 59 [2018-11-18 22:50:19,554 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 22:50:19,557 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:50:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 22:50:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 22:50:19,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:19,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-18 22:50:19,728 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:50:19,728 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:50:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:19,734 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 22:50:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:50:19,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:19,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:19,735 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:50:19,735 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:50:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:19,740 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 22:50:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:50:19,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:19,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:19,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:19,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:50:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 22:50:19,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2018-11-18 22:50:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:19,748 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 22:50:19,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:50:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:50:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:50:19,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:19,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:19,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:19,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1047758436, now seen corresponding path program 1 times [2018-11-18 22:50:19,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:20,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-18 22:50:20,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-18 22:50:20,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-18 22:50:20,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #81#return; {212#true} is VALID [2018-11-18 22:50:20,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret9 := main(); {212#true} is VALID [2018-11-18 22:50:20,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {214#(= main_~a~0 0)} is VALID [2018-11-18 22:50:20,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~a~0 0)} assume true; {214#(= main_~a~0 0)} is VALID [2018-11-18 22:50:20,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~a~0 0)} assume !(~a~0 < 100000); {213#false} is VALID [2018-11-18 22:50:20,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {213#false} havoc ~i~0;~i~0 := 0; {213#false} is VALID [2018-11-18 22:50:20,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-18 22:50:20,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~i~0 < 100000); {213#false} is VALID [2018-11-18 22:50:20,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~i~0 := 0; {213#false} is VALID [2018-11-18 22:50:20,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-18 22:50:20,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !(~i~0 < 100000); {213#false} is VALID [2018-11-18 22:50:20,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} havoc ~x~0;~x~0 := 0; {213#false} is VALID [2018-11-18 22:50:20,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-18 22:50:20,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {213#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {213#false} is VALID [2018-11-18 22:50:20,049 INFO L256 TraceCheckUtils]: 17: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {213#false} is VALID [2018-11-18 22:50:20,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-18 22:50:20,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-18 22:50:20,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-18 22:50:20,051 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:50:20,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:20,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:50:20,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:50:20,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:20,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:50:20,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:50:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:50:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:50:20,104 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-18 22:50:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:20,573 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-18 22:50:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:50:20,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:50:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-18 22:50:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-18 22:50:20,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-18 22:50:20,696 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:50:20,698 INFO L225 Difference]: With dead ends: 52 [2018-11-18 22:50:20,699 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 22:50:20,700 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:50:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 22:50:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-18 22:50:20,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:20,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-18 22:50:20,725 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-18 22:50:20,725 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-18 22:50:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:20,728 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-18 22:50:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-18 22:50:20,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:20,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:20,729 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-18 22:50:20,730 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-18 22:50:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:20,732 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-18 22:50:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-18 22:50:20,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:20,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:20,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:20,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:50:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 22:50:20,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2018-11-18 22:50:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:20,737 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 22:50:20,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:50:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 22:50:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:50:20,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:20,738 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:20,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:20,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash -212363359, now seen corresponding path program 1 times [2018-11-18 22:50:20,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:20,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:20,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:20,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-18 22:50:20,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {391#true} is VALID [2018-11-18 22:50:20,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-18 22:50:20,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #81#return; {391#true} is VALID [2018-11-18 22:50:20,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret9 := main(); {391#true} is VALID [2018-11-18 22:50:20,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {391#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {391#true} is VALID [2018-11-18 22:50:20,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-18 22:50:20,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {391#true} is VALID [2018-11-18 22:50:20,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {391#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {391#true} is VALID [2018-11-18 22:50:20,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-18 22:50:20,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#true} assume !(~a~0 < 100000); {391#true} is VALID [2018-11-18 22:50:20,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#true} havoc ~i~0;~i~0 := 0; {393#(= main_~i~0 0)} is VALID [2018-11-18 22:50:20,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {393#(= main_~i~0 0)} assume true; {393#(= main_~i~0 0)} is VALID [2018-11-18 22:50:20,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(= main_~i~0 0)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-18 22:50:20,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-18 22:50:20,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#false} assume true; {392#false} is VALID [2018-11-18 22:50:20,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-18 22:50:20,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-18 22:50:20,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {392#false} assume true; {392#false} is VALID [2018-11-18 22:50:20,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {392#false} is VALID [2018-11-18 22:50:20,871 INFO L256 TraceCheckUtils]: 20: Hoare triple {392#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {392#false} is VALID [2018-11-18 22:50:20,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-18 22:50:20,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {392#false} assume 0 == ~cond; {392#false} is VALID [2018-11-18 22:50:20,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-18 22:50:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:50:20,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:20,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:50:20,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:50:20,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:20,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:50:20,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:20,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:50:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:50:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:50:20,916 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-11-18 22:50:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:21,165 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-18 22:50:21,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:50:21,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:50:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-11-18 22:50:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-11-18 22:50:21,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2018-11-18 22:50:21,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:21,316 INFO L225 Difference]: With dead ends: 53 [2018-11-18 22:50:21,316 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 22:50:21,317 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:50:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 22:50:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-18 22:50:21,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:21,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-18 22:50:21,363 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-18 22:50:21,363 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-18 22:50:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:21,366 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 22:50:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 22:50:21,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:21,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:21,367 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-18 22:50:21,367 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-18 22:50:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:21,370 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 22:50:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 22:50:21,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:21,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:21,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:21,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:50:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 22:50:21,374 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2018-11-18 22:50:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:21,374 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 22:50:21,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:50:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 22:50:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:50:21,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:21,376 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:21,377 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:21,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash -147651490, now seen corresponding path program 1 times [2018-11-18 22:50:21,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:21,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:21,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:21,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:21,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-18 22:50:21,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {588#true} is VALID [2018-11-18 22:50:21,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-18 22:50:21,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #81#return; {588#true} is VALID [2018-11-18 22:50:21,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret9 := main(); {588#true} is VALID [2018-11-18 22:50:21,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:21,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(= main_~a~0 0)} assume true; {590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:21,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:21,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:21,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(<= main_~a~0 1)} assume true; {591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:21,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(<= main_~a~0 1)} assume !(~a~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#false} havoc ~i~0;~i~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {589#false} is VALID [2018-11-18 22:50:21,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {589#false} is VALID [2018-11-18 22:50:21,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} ~i~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {589#false} is VALID [2018-11-18 22:50:21,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {589#false} is VALID [2018-11-18 22:50:21,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {589#false} havoc ~x~0;~x~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,482 INFO L273 TraceCheckUtils]: 24: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {589#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {589#false} is VALID [2018-11-18 22:50:21,483 INFO L256 TraceCheckUtils]: 26: Hoare triple {589#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {589#false} is VALID [2018-11-18 22:50:21,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2018-11-18 22:50:21,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {589#false} assume 0 == ~cond; {589#false} is VALID [2018-11-18 22:50:21,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-18 22:50:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:50:21,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:21,486 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:50:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:21,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:21,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-18 22:50:21,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {588#true} is VALID [2018-11-18 22:50:21,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-18 22:50:21,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #81#return; {588#true} is VALID [2018-11-18 22:50:21,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret9 := main(); {588#true} is VALID [2018-11-18 22:50:21,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {610#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:21,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {610#(<= main_~a~0 0)} assume true; {610#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:21,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {610#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:21,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:21,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(<= main_~a~0 1)} assume true; {591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:21,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(<= main_~a~0 1)} assume !(~a~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#false} havoc ~i~0;~i~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {589#false} is VALID [2018-11-18 22:50:21,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {589#false} is VALID [2018-11-18 22:50:21,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} ~i~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {589#false} is VALID [2018-11-18 22:50:21,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {589#false} is VALID [2018-11-18 22:50:21,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-18 22:50:21,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {589#false} havoc ~x~0;~x~0 := 0; {589#false} is VALID [2018-11-18 22:50:21,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-18 22:50:21,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {589#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {589#false} is VALID [2018-11-18 22:50:21,888 INFO L256 TraceCheckUtils]: 26: Hoare triple {589#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {589#false} is VALID [2018-11-18 22:50:21,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2018-11-18 22:50:21,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {589#false} assume 0 == ~cond; {589#false} is VALID [2018-11-18 22:50:21,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-18 22:50:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:50:21,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:50:21,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:50:21,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:21,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:50:21,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:21,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:50:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:50:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:50:21,958 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-18 22:50:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,312 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-18 22:50:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:50:22,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:50:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:50:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-18 22:50:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:50:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-18 22:50:22,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-18 22:50:22,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:22,447 INFO L225 Difference]: With dead ends: 63 [2018-11-18 22:50:22,447 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:50:22,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:50:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:50:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 22:50:22,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:22,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-18 22:50:22,487 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-18 22:50:22,487 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-18 22:50:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,490 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 22:50:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 22:50:22,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:22,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:22,491 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-18 22:50:22,491 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-18 22:50:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,494 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 22:50:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 22:50:22,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:22,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:22,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:22,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:50:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-18 22:50:22,498 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 30 [2018-11-18 22:50:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:22,498 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 22:50:22,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:50:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-18 22:50:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:50:22,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:22,500 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:22,500 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:22,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1731065919, now seen corresponding path program 2 times [2018-11-18 22:50:22,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:22,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:22,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:22,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {896#true} is VALID [2018-11-18 22:50:22,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {896#true} is VALID [2018-11-18 22:50:22,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-18 22:50:22,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #81#return; {896#true} is VALID [2018-11-18 22:50:22,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret9 := main(); {896#true} is VALID [2018-11-18 22:50:22,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {898#(= main_~a~0 0)} is VALID [2018-11-18 22:50:22,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {898#(= main_~a~0 0)} assume true; {898#(= main_~a~0 0)} is VALID [2018-11-18 22:50:22,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {898#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {898#(= main_~a~0 0)} is VALID [2018-11-18 22:50:22,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {898#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {899#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:22,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {899#(<= main_~a~0 1)} assume true; {899#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:22,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {899#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {899#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:22,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {899#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {900#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:22,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#(<= main_~a~0 2)} assume true; {900#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:22,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#(<= main_~a~0 2)} assume !(~a~0 < 100000); {897#false} is VALID [2018-11-18 22:50:22,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#false} havoc ~i~0;~i~0 := 0; {897#false} is VALID [2018-11-18 22:50:22,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {897#false} is VALID [2018-11-18 22:50:22,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {897#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {897#false} is VALID [2018-11-18 22:50:22,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-18 22:50:22,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {897#false} ~i~0 := 0; {897#false} is VALID [2018-11-18 22:50:22,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {897#false} is VALID [2018-11-18 22:50:22,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {897#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {897#false} is VALID [2018-11-18 22:50:22,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-18 22:50:22,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {897#false} havoc ~x~0;~x~0 := 0; {897#false} is VALID [2018-11-18 22:50:22,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {897#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {897#false} is VALID [2018-11-18 22:50:22,650 INFO L256 TraceCheckUtils]: 29: Hoare triple {897#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {897#false} is VALID [2018-11-18 22:50:22,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {897#false} ~cond := #in~cond; {897#false} is VALID [2018-11-18 22:50:22,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {897#false} assume 0 == ~cond; {897#false} is VALID [2018-11-18 22:50:22,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2018-11-18 22:50:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:50:22,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:22,653 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:50:22,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:22,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:22,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:22,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:22,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {896#true} is VALID [2018-11-18 22:50:22,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {896#true} is VALID [2018-11-18 22:50:22,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-18 22:50:22,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #81#return; {896#true} is VALID [2018-11-18 22:50:22,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret9 := main(); {896#true} is VALID [2018-11-18 22:50:22,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {896#true} is VALID [2018-11-18 22:50:22,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-18 22:50:22,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {896#true} is VALID [2018-11-18 22:50:22,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {896#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {896#true} is VALID [2018-11-18 22:50:22,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-18 22:50:22,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {896#true} is VALID [2018-11-18 22:50:22,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {896#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {896#true} is VALID [2018-11-18 22:50:22,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-18 22:50:22,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {896#true} assume !(~a~0 < 100000); {896#true} is VALID [2018-11-18 22:50:22,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {896#true} havoc ~i~0;~i~0 := 0; {946#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:22,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {946#(<= main_~i~0 0)} assume true; {946#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:22,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {946#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {946#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:22,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {946#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {956#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {956#(<= main_~i~0 1)} assume true; {956#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {956#(<= main_~i~0 1)} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-18 22:50:22,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {897#false} ~i~0 := 0; {897#false} is VALID [2018-11-18 22:50:22,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {897#false} is VALID [2018-11-18 22:50:22,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {897#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {897#false} is VALID [2018-11-18 22:50:22,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-18 22:50:22,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {897#false} havoc ~x~0;~x~0 := 0; {897#false} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {897#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {897#false} is VALID [2018-11-18 22:50:22,888 INFO L256 TraceCheckUtils]: 29: Hoare triple {897#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {897#false} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {897#false} ~cond := #in~cond; {897#false} is VALID [2018-11-18 22:50:22,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {897#false} assume 0 == ~cond; {897#false} is VALID [2018-11-18 22:50:22,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2018-11-18 22:50:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:50:22,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:22,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 22:50:22,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-18 22:50:22,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:22,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:50:23,009 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:50:23,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:50:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:50:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:50:23,010 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-11-18 22:50:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,283 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-18 22:50:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:50:23,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-18 22:50:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:50:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 22:50:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:50:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 22:50:23,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-18 22:50:23,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:23,437 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:50:23,437 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 22:50:23,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:50:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 22:50:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-18 22:50:23,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:23,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-18 22:50:23,469 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-18 22:50:23,470 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-18 22:50:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,473 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-18 22:50:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 22:50:23,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:23,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:23,474 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-18 22:50:23,475 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-18 22:50:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,478 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-18 22:50:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 22:50:23,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:23,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:23,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:23,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:50:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-18 22:50:23,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 33 [2018-11-18 22:50:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:23,482 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-18 22:50:23,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:50:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-18 22:50:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:50:23,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:23,484 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:23,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:23,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash -175622111, now seen corresponding path program 3 times [2018-11-18 22:50:23,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:23,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:23,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:23,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-18 22:50:23,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-18 22:50:23,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #81#return; {1263#true} is VALID [2018-11-18 22:50:23,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret9 := main(); {1263#true} is VALID [2018-11-18 22:50:23,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1265#(= main_~a~0 0)} is VALID [2018-11-18 22:50:23,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~a~0 0)} assume true; {1265#(= main_~a~0 0)} is VALID [2018-11-18 22:50:23,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {1265#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1265#(= main_~a~0 0)} is VALID [2018-11-18 22:50:23,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {1265#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1266#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:23,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(<= main_~a~0 1)} assume true; {1266#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:23,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1266#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:23,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {1266#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1267#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:23,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {1267#(<= main_~a~0 2)} assume true; {1267#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:23,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {1267#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1267#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:23,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1268#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:23,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {1268#(<= main_~a~0 3)} assume true; {1268#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:23,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {1268#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1264#false} is VALID [2018-11-18 22:50:23,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {1264#false} havoc ~i~0;~i~0 := 0; {1264#false} is VALID [2018-11-18 22:50:23,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1264#false} is VALID [2018-11-18 22:50:23,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1264#false} is VALID [2018-11-18 22:50:23,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1264#false} is VALID [2018-11-18 22:50:23,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {1264#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1264#false} is VALID [2018-11-18 22:50:23,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-18 22:50:23,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {1264#false} ~i~0 := 0; {1264#false} is VALID [2018-11-18 22:50:23,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1264#false} is VALID [2018-11-18 22:50:23,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#false} is VALID [2018-11-18 22:50:23,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1264#false} is VALID [2018-11-18 22:50:23,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#false} is VALID [2018-11-18 22:50:23,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-18 22:50:23,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {1264#false} havoc ~x~0;~x~0 := 0; {1264#false} is VALID [2018-11-18 22:50:23,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1264#false} is VALID [2018-11-18 22:50:23,694 INFO L256 TraceCheckUtils]: 38: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1264#false} is VALID [2018-11-18 22:50:23,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-18 22:50:23,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {1264#false} assume 0 == ~cond; {1264#false} is VALID [2018-11-18 22:50:23,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-18 22:50:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:50:23,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:23,698 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:50:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:23,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 22:50:23,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:23,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:23,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-18 22:50:23,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-18 22:50:23,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #81#return; {1263#true} is VALID [2018-11-18 22:50:23,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret9 := main(); {1263#true} is VALID [2018-11-18 22:50:23,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1263#true} is VALID [2018-11-18 22:50:23,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1263#true} is VALID [2018-11-18 22:50:23,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1263#true} is VALID [2018-11-18 22:50:23,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1263#true} is VALID [2018-11-18 22:50:23,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1263#true} is VALID [2018-11-18 22:50:23,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1263#true} is VALID [2018-11-18 22:50:23,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1263#true} is VALID [2018-11-18 22:50:23,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-18 22:50:23,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#true} assume !(~a~0 < 100000); {1263#true} is VALID [2018-11-18 22:50:23,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#true} havoc ~i~0;~i~0 := 0; {1323#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {1323#(<= main_~i~0 0)} assume true; {1323#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {1323#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1323#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {1323#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1333#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {1333#(<= main_~i~0 1)} assume true; {1333#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {1333#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1333#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {1333#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1343#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {1343#(<= main_~i~0 2)} assume true; {1343#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {1343#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-18 22:50:23,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {1264#false} ~i~0 := 0; {1264#false} is VALID [2018-11-18 22:50:23,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1264#false} is VALID [2018-11-18 22:50:23,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-18 22:50:23,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {1264#false} havoc ~x~0;~x~0 := 0; {1264#false} is VALID [2018-11-18 22:50:23,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-18 22:50:23,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1264#false} is VALID [2018-11-18 22:50:23,933 INFO L256 TraceCheckUtils]: 38: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1264#false} is VALID [2018-11-18 22:50:23,934 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-18 22:50:23,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {1264#false} assume 0 == ~cond; {1264#false} is VALID [2018-11-18 22:50:23,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-18 22:50:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 22:50:23,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:23,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-18 22:50:23,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-18 22:50:23,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:23,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:50:24,029 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:50:24,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:50:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:50:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:50:24,031 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2018-11-18 22:50:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:24,375 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-18 22:50:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:50:24,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-18 22:50:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:50:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2018-11-18 22:50:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:50:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2018-11-18 22:50:24,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 87 transitions. [2018-11-18 22:50:24,479 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:50:24,482 INFO L225 Difference]: With dead ends: 89 [2018-11-18 22:50:24,482 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 22:50:24,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:50:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 22:50:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-18 22:50:24,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:24,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 56 states. [2018-11-18 22:50:24,528 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 56 states. [2018-11-18 22:50:24,528 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 56 states. [2018-11-18 22:50:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:24,530 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-18 22:50:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-18 22:50:24,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:24,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:24,532 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 59 states. [2018-11-18 22:50:24,532 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 59 states. [2018-11-18 22:50:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:24,535 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-18 22:50:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-18 22:50:24,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:24,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:24,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:24,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:50:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-18 22:50:24,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 42 [2018-11-18 22:50:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:24,539 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-18 22:50:24,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:50:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-18 22:50:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:50:24,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:24,541 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:24,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:24,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2061528001, now seen corresponding path program 4 times [2018-11-18 22:50:24,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:24,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:24,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:24,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-18 22:50:24,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1709#true} is VALID [2018-11-18 22:50:24,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-18 22:50:24,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #81#return; {1709#true} is VALID [2018-11-18 22:50:24,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret9 := main(); {1709#true} is VALID [2018-11-18 22:50:24,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1711#(= main_~a~0 0)} is VALID [2018-11-18 22:50:24,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {1711#(= main_~a~0 0)} assume true; {1711#(= main_~a~0 0)} is VALID [2018-11-18 22:50:24,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {1711#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1711#(= main_~a~0 0)} is VALID [2018-11-18 22:50:24,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {1711#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:24,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(<= main_~a~0 1)} assume true; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:24,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:24,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:24,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {1713#(<= main_~a~0 2)} assume true; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:24,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {1713#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:24,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {1713#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:24,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {1714#(<= main_~a~0 3)} assume true; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:24,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {1714#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:24,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {1714#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1715#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:24,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {1715#(<= main_~a~0 4)} assume true; {1715#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:24,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {1715#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:24,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#false} havoc ~i~0;~i~0 := 0; {1710#false} is VALID [2018-11-18 22:50:24,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:24,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:24,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:24,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:24,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:24,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:24,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:24,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} ~i~0 := 0; {1710#false} is VALID [2018-11-18 22:50:24,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:24,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:24,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:24,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:24,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:24,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:24,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:24,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0; {1710#false} is VALID [2018-11-18 22:50:24,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:24,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1710#false} is VALID [2018-11-18 22:50:24,746 INFO L256 TraceCheckUtils]: 47: Hoare triple {1710#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1710#false} is VALID [2018-11-18 22:50:24,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-18 22:50:24,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume 0 == ~cond; {1710#false} is VALID [2018-11-18 22:50:24,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-18 22:50:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:50:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:24,749 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:50:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:50:24,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:50:24,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:24,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:25,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-18 22:50:25,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1709#true} is VALID [2018-11-18 22:50:25,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-18 22:50:25,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #81#return; {1709#true} is VALID [2018-11-18 22:50:25,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret9 := main(); {1709#true} is VALID [2018-11-18 22:50:25,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1734#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:25,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {1734#(<= main_~a~0 0)} assume true; {1734#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:25,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1734#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1734#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:25,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {1734#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:25,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(<= main_~a~0 1)} assume true; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:25,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1712#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:25,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:25,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {1713#(<= main_~a~0 2)} assume true; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:25,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {1713#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1713#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:25,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {1713#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:25,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {1714#(<= main_~a~0 3)} assume true; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:25,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {1714#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1714#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:25,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {1714#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1715#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:25,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {1715#(<= main_~a~0 4)} assume true; {1715#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:25,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {1715#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:25,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#false} havoc ~i~0;~i~0 := 0; {1710#false} is VALID [2018-11-18 22:50:25,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:25,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:25,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:25,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:25,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1710#false} is VALID [2018-11-18 22:50:25,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1710#false} is VALID [2018-11-18 22:50:25,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:25,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} ~i~0 := 0; {1710#false} is VALID [2018-11-18 22:50:25,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:25,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:25,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,083 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:25,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:25,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1710#false} is VALID [2018-11-18 22:50:25,084 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1710#false} is VALID [2018-11-18 22:50:25,084 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-18 22:50:25,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0; {1710#false} is VALID [2018-11-18 22:50:25,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-18 22:50:25,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1710#false} is VALID [2018-11-18 22:50:25,085 INFO L256 TraceCheckUtils]: 47: Hoare triple {1710#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1710#false} is VALID [2018-11-18 22:50:25,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-18 22:50:25,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume 0 == ~cond; {1710#false} is VALID [2018-11-18 22:50:25,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-18 22:50:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:50:25,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:25,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:50:25,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 22:50:25,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:25,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:50:25,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:25,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:50:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:50:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:50:25,280 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 8 states. [2018-11-18 22:50:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:25,582 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-18 22:50:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:50:25,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 22:50:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:50:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-18 22:50:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:50:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-18 22:50:25,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2018-11-18 22:50:25,794 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:50:25,796 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:50:25,796 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 22:50:25,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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:50:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 22:50:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-18 22:50:25,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:25,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-18 22:50:25,840 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-18 22:50:25,840 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-18 22:50:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:25,843 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-18 22:50:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-18 22:50:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:25,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:25,844 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-18 22:50:25,845 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-18 22:50:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:25,847 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-18 22:50:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-18 22:50:25,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:25,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:25,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:25,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:50:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-18 22:50:25,851 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 51 [2018-11-18 22:50:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:25,851 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-18 22:50:25,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:50:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-18 22:50:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:50:25,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:25,853 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:25,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:25,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -108497858, now seen corresponding path program 5 times [2018-11-18 22:50:25,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:25,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:25,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:25,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:25,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:26,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2018-11-18 22:50:26,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2197#true} is VALID [2018-11-18 22:50:26,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #81#return; {2197#true} is VALID [2018-11-18 22:50:26,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret9 := main(); {2197#true} is VALID [2018-11-18 22:50:26,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {2197#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2199#(= main_~a~0 0)} is VALID [2018-11-18 22:50:26,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {2199#(= main_~a~0 0)} assume true; {2199#(= main_~a~0 0)} is VALID [2018-11-18 22:50:26,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {2199#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2199#(= main_~a~0 0)} is VALID [2018-11-18 22:50:26,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2200#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:26,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= main_~a~0 1)} assume true; {2200#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:26,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {2200#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2200#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:26,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {2200#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2201#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:26,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {2201#(<= main_~a~0 2)} assume true; {2201#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:26,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {2201#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2201#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:26,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {2201#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2202#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:26,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#(<= main_~a~0 3)} assume true; {2202#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:26,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {2202#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2202#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:26,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {2202#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2203#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:26,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {2203#(<= main_~a~0 4)} assume true; {2203#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:26,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {2203#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2203#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:26,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {2203#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2204#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:26,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {2204#(<= main_~a~0 5)} assume true; {2204#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:26,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {2204#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2198#false} is VALID [2018-11-18 22:50:26,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {2198#false} havoc ~i~0;~i~0 := 0; {2198#false} is VALID [2018-11-18 22:50:26,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {2198#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2198#false} is VALID [2018-11-18 22:50:26,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {2198#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 34: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#false} ~i~0 := 0; {2198#false} is VALID [2018-11-18 22:50:26,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 38: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 39: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 40: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {2198#false} havoc ~x~0;~x~0 := 0; {2198#false} is VALID [2018-11-18 22:50:26,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {2198#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2198#false} is VALID [2018-11-18 22:50:26,078 INFO L256 TraceCheckUtils]: 50: Hoare triple {2198#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2198#false} is VALID [2018-11-18 22:50:26,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2018-11-18 22:50:26,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2018-11-18 22:50:26,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2018-11-18 22:50:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:50:26,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:26,082 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:50:26,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:50:26,205 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:50:26,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:26,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:26,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2018-11-18 22:50:26,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2197#true} is VALID [2018-11-18 22:50:26,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #81#return; {2197#true} is VALID [2018-11-18 22:50:26,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret9 := main(); {2197#true} is VALID [2018-11-18 22:50:26,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {2197#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2197#true} is VALID [2018-11-18 22:50:26,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2197#true} is VALID [2018-11-18 22:50:26,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2197#true} is VALID [2018-11-18 22:50:26,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2197#true} is VALID [2018-11-18 22:50:26,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2197#true} is VALID [2018-11-18 22:50:26,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2197#true} is VALID [2018-11-18 22:50:26,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2197#true} is VALID [2018-11-18 22:50:26,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2197#true} is VALID [2018-11-18 22:50:26,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2197#true} is VALID [2018-11-18 22:50:26,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2197#true} is VALID [2018-11-18 22:50:26,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2197#true} is VALID [2018-11-18 22:50:26,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-18 22:50:26,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {2197#true} assume !(~a~0 < 100000); {2197#true} is VALID [2018-11-18 22:50:26,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {2197#true} havoc ~i~0;~i~0 := 0; {2277#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:26,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {2277#(<= main_~i~0 0)} assume true; {2277#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:26,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {2277#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2277#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:26,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {2277#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2287#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:26,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#(<= main_~i~0 1)} assume true; {2287#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:26,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {2287#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2287#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:26,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {2287#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2297#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:26,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {2297#(<= main_~i~0 2)} assume true; {2297#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:26,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {2297#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2297#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:26,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {2297#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:26,677 INFO L273 TraceCheckUtils]: 33: Hoare triple {2307#(<= main_~i~0 3)} assume true; {2307#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:26,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {2307#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-18 22:50:26,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#false} ~i~0 := 0; {2198#false} is VALID [2018-11-18 22:50:26,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,679 INFO L273 TraceCheckUtils]: 37: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2198#false} is VALID [2018-11-18 22:50:26,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {2198#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L273 TraceCheckUtils]: 47: Hoare triple {2198#false} havoc ~x~0;~x~0 := 0; {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {2198#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2198#false} is VALID [2018-11-18 22:50:26,681 INFO L256 TraceCheckUtils]: 50: Hoare triple {2198#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2198#false} is VALID [2018-11-18 22:50:26,682 INFO L273 TraceCheckUtils]: 51: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2018-11-18 22:50:26,682 INFO L273 TraceCheckUtils]: 52: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2018-11-18 22:50:26,682 INFO L273 TraceCheckUtils]: 53: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2018-11-18 22:50:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 22:50:26,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:26,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-18 22:50:26,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-18 22:50:26,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:26,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:50:26,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:26,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:50:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:50:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:50:26,824 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 12 states. [2018-11-18 22:50:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:27,539 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-18 22:50:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:50:27,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-18 22:50:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-18 22:50:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-18 22:50:27,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2018-11-18 22:50:27,664 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:50:27,666 INFO L225 Difference]: With dead ends: 107 [2018-11-18 22:50:27,667 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 22:50:27,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:50:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 22:50:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-18 22:50:27,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:27,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 68 states. [2018-11-18 22:50:27,692 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 68 states. [2018-11-18 22:50:27,693 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 68 states. [2018-11-18 22:50:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:27,696 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-18 22:50:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-18 22:50:27,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:27,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:27,697 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 71 states. [2018-11-18 22:50:27,697 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 71 states. [2018-11-18 22:50:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:27,699 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-18 22:50:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-18 22:50:27,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:27,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:27,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:27,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:50:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-18 22:50:27,701 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 54 [2018-11-18 22:50:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:27,702 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-18 22:50:27,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:50:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:50:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 22:50:27,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:27,703 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:27,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:27,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash -650580796, now seen corresponding path program 6 times [2018-11-18 22:50:27,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:27,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:27,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:28,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2018-11-18 22:50:28,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2746#true} is VALID [2018-11-18 22:50:28,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2018-11-18 22:50:28,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #81#return; {2746#true} is VALID [2018-11-18 22:50:28,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2018-11-18 22:50:28,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2748#(= main_~a~0 0)} is VALID [2018-11-18 22:50:28,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {2748#(= main_~a~0 0)} assume true; {2748#(= main_~a~0 0)} is VALID [2018-11-18 22:50:28,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {2748#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2748#(= main_~a~0 0)} is VALID [2018-11-18 22:50:28,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {2748#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {2749#(<= main_~a~0 1)} assume true; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {2749#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {2749#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {2750#(<= main_~a~0 2)} assume true; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {2750#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {2750#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {2751#(<= main_~a~0 3)} assume true; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {2751#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {2751#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#(<= main_~a~0 4)} assume true; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {2753#(<= main_~a~0 5)} assume true; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {2753#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {2753#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2754#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:28,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {2754#(<= main_~a~0 6)} assume true; {2754#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:28,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {2754#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {2747#false} havoc ~i~0;~i~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {2747#false} ~i~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,557 INFO L273 TraceCheckUtils]: 49: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 53: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {2747#false} havoc ~x~0;~x~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {2747#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2747#false} is VALID [2018-11-18 22:50:28,559 INFO L256 TraceCheckUtils]: 59: Hoare triple {2747#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2747#false} is VALID [2018-11-18 22:50:28,559 INFO L273 TraceCheckUtils]: 60: Hoare triple {2747#false} ~cond := #in~cond; {2747#false} is VALID [2018-11-18 22:50:28,559 INFO L273 TraceCheckUtils]: 61: Hoare triple {2747#false} assume 0 == ~cond; {2747#false} is VALID [2018-11-18 22:50:28,559 INFO L273 TraceCheckUtils]: 62: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2018-11-18 22:50:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:28,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:28,569 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:50:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:50:28,644 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:50:28,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:28,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:28,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2018-11-18 22:50:28,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2746#true} is VALID [2018-11-18 22:50:28,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2018-11-18 22:50:28,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #81#return; {2746#true} is VALID [2018-11-18 22:50:28,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2018-11-18 22:50:28,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2773#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:28,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {2773#(<= main_~a~0 0)} assume true; {2773#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:28,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2773#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:28,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {2749#(<= main_~a~0 1)} assume true; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {2749#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2749#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:28,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {2749#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {2750#(<= main_~a~0 2)} assume true; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {2750#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2750#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:28,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {2750#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {2751#(<= main_~a~0 3)} assume true; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {2751#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2751#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:28,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {2751#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#(<= main_~a~0 4)} assume true; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2752#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:28,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {2753#(<= main_~a~0 5)} assume true; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {2753#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2753#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:28,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {2753#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2754#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:28,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {2754#(<= main_~a~0 6)} assume true; {2754#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:28,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {2754#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {2747#false} havoc ~i~0;~i~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 31: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2747#false} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2747#false} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {2747#false} ~i~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 47: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 53: Hoare triple {2747#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 55: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {2747#false} havoc ~x~0;~x~0 := 0; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 57: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {2747#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2747#false} is VALID [2018-11-18 22:50:28,870 INFO L256 TraceCheckUtils]: 59: Hoare triple {2747#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2747#false} is VALID [2018-11-18 22:50:28,870 INFO L273 TraceCheckUtils]: 60: Hoare triple {2747#false} ~cond := #in~cond; {2747#false} is VALID [2018-11-18 22:50:28,870 INFO L273 TraceCheckUtils]: 61: Hoare triple {2747#false} assume 0 == ~cond; {2747#false} is VALID [2018-11-18 22:50:28,870 INFO L273 TraceCheckUtils]: 62: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2018-11-18 22:50:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:28,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:28,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:50:28,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-11-18 22:50:28,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:28,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:50:28,932 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:50:28,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:50:28,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:50:28,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:50:28,933 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 10 states. [2018-11-18 22:50:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:29,215 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-18 22:50:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:50:29,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-11-18 22:50:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:50:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-18 22:50:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:50:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-18 22:50:29,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2018-11-18 22:50:29,360 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:50:29,364 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:50:29,364 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:50:29,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:50:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:50:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-18 22:50:29,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:29,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-18 22:50:29,392 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-18 22:50:29,393 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-18 22:50:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:29,395 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-18 22:50:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-18 22:50:29,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:29,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:29,395 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-18 22:50:29,396 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-18 22:50:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:29,398 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-18 22:50:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-18 22:50:29,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:29,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:29,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:29,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 22:50:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-18 22:50:29,401 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 63 [2018-11-18 22:50:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:29,402 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-18 22:50:29,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:50:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-18 22:50:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:50:29,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:29,403 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:29,403 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:29,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:29,403 INFO L82 PathProgramCache]: Analyzing trace with hash 705634753, now seen corresponding path program 7 times [2018-11-18 22:50:29,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:29,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:29,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:29,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {3336#true} call ULTIMATE.init(); {3336#true} is VALID [2018-11-18 22:50:29,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {3336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3336#true} is VALID [2018-11-18 22:50:29,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {3336#true} assume true; {3336#true} is VALID [2018-11-18 22:50:29,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3336#true} {3336#true} #81#return; {3336#true} is VALID [2018-11-18 22:50:29,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {3336#true} call #t~ret9 := main(); {3336#true} is VALID [2018-11-18 22:50:29,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {3336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3338#(= main_~a~0 0)} is VALID [2018-11-18 22:50:29,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {3338#(= main_~a~0 0)} assume true; {3338#(= main_~a~0 0)} is VALID [2018-11-18 22:50:29,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {3338#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3338#(= main_~a~0 0)} is VALID [2018-11-18 22:50:29,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {3338#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {3339#(<= main_~a~0 1)} assume true; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {3339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {3339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~a~0 2)} assume true; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {3340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {3340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~a~0 3)} assume true; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {3341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {3341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~a~0 4)} assume true; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {3342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {3342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~a~0 5)} assume true; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {3343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {3343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~a~0 6)} assume true; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {3344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {3344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3345#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:29,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~a~0 7)} assume true; {3345#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:29,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {3345#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,589 INFO L273 TraceCheckUtils]: 29: Hoare triple {3337#false} havoc ~i~0;~i~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,591 INFO L273 TraceCheckUtils]: 36: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,591 INFO L273 TraceCheckUtils]: 39: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,592 INFO L273 TraceCheckUtils]: 42: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,592 INFO L273 TraceCheckUtils]: 43: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {3337#false} ~i~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 49: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 54: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,594 INFO L273 TraceCheckUtils]: 58: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,595 INFO L273 TraceCheckUtils]: 59: Hoare triple {3337#false} havoc ~x~0;~x~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {3337#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3337#false} is VALID [2018-11-18 22:50:29,595 INFO L256 TraceCheckUtils]: 62: Hoare triple {3337#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3337#false} is VALID [2018-11-18 22:50:29,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {3337#false} ~cond := #in~cond; {3337#false} is VALID [2018-11-18 22:50:29,596 INFO L273 TraceCheckUtils]: 64: Hoare triple {3337#false} assume 0 == ~cond; {3337#false} is VALID [2018-11-18 22:50:29,596 INFO L273 TraceCheckUtils]: 65: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2018-11-18 22:50:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:29,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:29,599 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:50:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:29,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:29,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {3336#true} call ULTIMATE.init(); {3336#true} is VALID [2018-11-18 22:50:29,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {3336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3336#true} is VALID [2018-11-18 22:50:29,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {3336#true} assume true; {3336#true} is VALID [2018-11-18 22:50:29,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3336#true} {3336#true} #81#return; {3336#true} is VALID [2018-11-18 22:50:29,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {3336#true} call #t~ret9 := main(); {3336#true} is VALID [2018-11-18 22:50:29,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {3336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3364#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:29,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {3364#(<= main_~a~0 0)} assume true; {3364#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:29,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {3364#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3364#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:29,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {3364#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {3339#(<= main_~a~0 1)} assume true; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {3339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3339#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:29,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {3339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~a~0 2)} assume true; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {3340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3340#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:29,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {3340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~a~0 3)} assume true; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3341#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:29,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {3341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~a~0 4)} assume true; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {3342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3342#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:29,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {3342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~a~0 5)} assume true; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {3343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3343#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:29,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {3343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~a~0 6)} assume true; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {3344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3344#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:29,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {3344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3345#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:29,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~a~0 7)} assume true; {3345#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:29,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {3345#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {3337#false} havoc ~i~0;~i~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {3337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {3337#false} ~i~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 46: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 50: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 51: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 52: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 54: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3337#false} is VALID [2018-11-18 22:50:29,920 INFO L273 TraceCheckUtils]: 56: Hoare triple {3337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 57: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 58: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 59: Hoare triple {3337#false} havoc ~x~0;~x~0 := 0; {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 60: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 61: Hoare triple {3337#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L256 TraceCheckUtils]: 62: Hoare triple {3337#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3337#false} is VALID [2018-11-18 22:50:29,921 INFO L273 TraceCheckUtils]: 63: Hoare triple {3337#false} ~cond := #in~cond; {3337#false} is VALID [2018-11-18 22:50:29,922 INFO L273 TraceCheckUtils]: 64: Hoare triple {3337#false} assume 0 == ~cond; {3337#false} is VALID [2018-11-18 22:50:29,922 INFO L273 TraceCheckUtils]: 65: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2018-11-18 22:50:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:29,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:29,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:50:29,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-18 22:50:29,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:29,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:50:29,995 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:50:29,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:50:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:50:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:50:29,996 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 11 states. [2018-11-18 22:50:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:30,153 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-18 22:50:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:50:30,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-18 22:50:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:50:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-18 22:50:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:50:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-18 22:50:30,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2018-11-18 22:50:30,290 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:50:30,292 INFO L225 Difference]: With dead ends: 117 [2018-11-18 22:50:30,292 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:50:30,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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:50:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:50:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-18 22:50:30,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:30,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-18 22:50:30,331 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-18 22:50:30,331 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-18 22:50:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:30,332 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-18 22:50:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-18 22:50:30,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:30,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:30,333 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-18 22:50:30,333 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-18 22:50:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:30,335 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-18 22:50:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-18 22:50:30,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:30,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:30,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:30,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 22:50:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-18 22:50:30,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 66 [2018-11-18 22:50:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:30,338 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-18 22:50:30,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:50:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-18 22:50:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 22:50:30,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:30,339 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:30,339 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:30,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash 965701540, now seen corresponding path program 8 times [2018-11-18 22:50:30,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:30,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:30,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:30,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {3950#true} call ULTIMATE.init(); {3950#true} is VALID [2018-11-18 22:50:30,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {3950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3950#true} is VALID [2018-11-18 22:50:30,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {3950#true} assume true; {3950#true} is VALID [2018-11-18 22:50:30,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3950#true} {3950#true} #81#return; {3950#true} is VALID [2018-11-18 22:50:30,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {3950#true} call #t~ret9 := main(); {3950#true} is VALID [2018-11-18 22:50:30,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {3950#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3952#(= main_~a~0 0)} is VALID [2018-11-18 22:50:30,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {3952#(= main_~a~0 0)} assume true; {3952#(= main_~a~0 0)} is VALID [2018-11-18 22:50:30,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {3952#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3952#(= main_~a~0 0)} is VALID [2018-11-18 22:50:30,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {3952#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {3953#(<= main_~a~0 1)} assume true; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {3953#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {3953#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {3954#(<= main_~a~0 2)} assume true; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {3954#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {3954#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#(<= main_~a~0 3)} assume true; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {3955#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {3955#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {3956#(<= main_~a~0 4)} assume true; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {3956#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {3957#(<= main_~a~0 5)} assume true; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {3957#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {3957#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {3958#(<= main_~a~0 6)} assume true; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {3958#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {3958#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(<= main_~a~0 7)} assume true; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3960#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:30,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {3960#(<= main_~a~0 8)} assume true; {3960#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:30,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {3960#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {3951#false} havoc ~i~0;~i~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,566 INFO L273 TraceCheckUtils]: 43: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,566 INFO L273 TraceCheckUtils]: 45: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {3951#false} ~i~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 48: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 51: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,568 INFO L273 TraceCheckUtils]: 54: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,568 INFO L273 TraceCheckUtils]: 57: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 59: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 60: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 61: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 62: Hoare triple {3951#false} havoc ~x~0;~x~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,569 INFO L273 TraceCheckUtils]: 64: Hoare triple {3951#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3951#false} is VALID [2018-11-18 22:50:30,570 INFO L256 TraceCheckUtils]: 65: Hoare triple {3951#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3951#false} is VALID [2018-11-18 22:50:30,570 INFO L273 TraceCheckUtils]: 66: Hoare triple {3951#false} ~cond := #in~cond; {3951#false} is VALID [2018-11-18 22:50:30,570 INFO L273 TraceCheckUtils]: 67: Hoare triple {3951#false} assume 0 == ~cond; {3951#false} is VALID [2018-11-18 22:50:30,570 INFO L273 TraceCheckUtils]: 68: Hoare triple {3951#false} assume !false; {3951#false} is VALID [2018-11-18 22:50:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:30,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:30,574 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:50:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:30,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:30,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:30,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:30,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {3950#true} call ULTIMATE.init(); {3950#true} is VALID [2018-11-18 22:50:30,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {3950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3950#true} is VALID [2018-11-18 22:50:30,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {3950#true} assume true; {3950#true} is VALID [2018-11-18 22:50:30,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3950#true} {3950#true} #81#return; {3950#true} is VALID [2018-11-18 22:50:30,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {3950#true} call #t~ret9 := main(); {3950#true} is VALID [2018-11-18 22:50:30,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {3950#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3979#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:30,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {3979#(<= main_~a~0 0)} assume true; {3979#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:30,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {3979#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3979#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:30,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {3979#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {3953#(<= main_~a~0 1)} assume true; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {3953#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3953#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:30,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {3953#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {3954#(<= main_~a~0 2)} assume true; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {3954#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3954#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:30,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {3954#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#(<= main_~a~0 3)} assume true; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {3955#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3955#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:30,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {3955#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {3956#(<= main_~a~0 4)} assume true; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3956#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:30,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {3956#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {3957#(<= main_~a~0 5)} assume true; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {3957#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3957#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:30,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {3957#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {3958#(<= main_~a~0 6)} assume true; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {3958#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3958#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:30,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {3958#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(<= main_~a~0 7)} assume true; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3959#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:30,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3960#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:30,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {3960#(<= main_~a~0 8)} assume true; {3960#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:30,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {3960#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {3951#false} havoc ~i~0;~i~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {3951#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {3951#false} ~i~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {3951#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {3951#false} havoc ~x~0;~x~0 := 0; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-18 22:50:30,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {3951#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3951#false} is VALID [2018-11-18 22:50:30,969 INFO L256 TraceCheckUtils]: 65: Hoare triple {3951#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3951#false} is VALID [2018-11-18 22:50:30,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {3951#false} ~cond := #in~cond; {3951#false} is VALID [2018-11-18 22:50:30,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {3951#false} assume 0 == ~cond; {3951#false} is VALID [2018-11-18 22:50:30,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {3951#false} assume !false; {3951#false} is VALID [2018-11-18 22:50:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:30,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:30,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:50:30,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-18 22:50:30,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:30,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:50:31,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:31,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:50:31,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:50:31,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:50:31,046 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 12 states. [2018-11-18 22:50:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:31,530 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-18 22:50:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:50:31,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-18 22:50:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-18 22:50:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-18 22:50:31,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-18 22:50:31,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:31,664 INFO L225 Difference]: With dead ends: 120 [2018-11-18 22:50:31,664 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 22:50:31,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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:50:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 22:50:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-18 22:50:31,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:31,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-18 22:50:31,729 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-18 22:50:31,730 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-18 22:50:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:31,731 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-18 22:50:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-18 22:50:31,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:31,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:31,732 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-18 22:50:31,732 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-18 22:50:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:31,734 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-18 22:50:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-18 22:50:31,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:31,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:31,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:31,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 22:50:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-18 22:50:31,737 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 69 [2018-11-18 22:50:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:31,737 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-18 22:50:31,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:50:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-18 22:50:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 22:50:31,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:31,738 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:31,738 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:31,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 494351073, now seen corresponding path program 9 times [2018-11-18 22:50:31,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:31,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:31,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:32,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {4588#true} call ULTIMATE.init(); {4588#true} is VALID [2018-11-18 22:50:32,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {4588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4588#true} is VALID [2018-11-18 22:50:32,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4588#true} {4588#true} #81#return; {4588#true} is VALID [2018-11-18 22:50:32,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {4588#true} call #t~ret9 := main(); {4588#true} is VALID [2018-11-18 22:50:32,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {4588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:32,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {4590#(= main_~a~0 0)} assume true; {4590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:32,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {4590#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4590#(= main_~a~0 0)} is VALID [2018-11-18 22:50:32,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {4590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:32,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {4591#(<= main_~a~0 1)} assume true; {4591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:32,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {4591#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4591#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:32,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {4591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4592#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:32,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {4592#(<= main_~a~0 2)} assume true; {4592#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:32,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {4592#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4592#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:32,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {4592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4593#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:32,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {4593#(<= main_~a~0 3)} assume true; {4593#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:32,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {4593#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4593#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:32,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {4593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4594#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:32,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {4594#(<= main_~a~0 4)} assume true; {4594#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:32,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {4594#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4594#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:32,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {4594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4595#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:32,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {4595#(<= main_~a~0 5)} assume true; {4595#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:32,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {4595#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4595#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:32,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {4595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4596#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:32,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {4596#(<= main_~a~0 6)} assume true; {4596#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:32,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {4596#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4596#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:32,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {4596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4597#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:32,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {4597#(<= main_~a~0 7)} assume true; {4597#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:32,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {4597#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4597#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:32,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {4597#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4598#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:32,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {4598#(<= main_~a~0 8)} assume true; {4598#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:32,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {4598#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4598#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:32,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {4598#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4599#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:32,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {4599#(<= main_~a~0 9)} assume true; {4599#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:32,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {4599#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4589#false} is VALID [2018-11-18 22:50:32,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {4589#false} havoc ~i~0;~i~0 := 0; {4589#false} is VALID [2018-11-18 22:50:32,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4589#false} is VALID [2018-11-18 22:50:32,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {4589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4589#false} is VALID [2018-11-18 22:50:32,522 INFO L273 TraceCheckUtils]: 39: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4589#false} is VALID [2018-11-18 22:50:32,522 INFO L273 TraceCheckUtils]: 41: Hoare triple {4589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4589#false} is VALID [2018-11-18 22:50:32,522 INFO L273 TraceCheckUtils]: 42: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,522 INFO L273 TraceCheckUtils]: 43: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 44: Hoare triple {4589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 45: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 46: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 47: Hoare triple {4589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 48: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 49: Hoare triple {4589#false} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-18 22:50:32,523 INFO L273 TraceCheckUtils]: 50: Hoare triple {4589#false} ~i~0 := 0; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 51: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 52: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 53: Hoare triple {4589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 54: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {4589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,524 INFO L273 TraceCheckUtils]: 58: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {4589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {4589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 64: Hoare triple {4589#false} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {4589#false} havoc ~x~0;~x~0 := 0; {4589#false} is VALID [2018-11-18 22:50:32,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {4589#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4589#false} is VALID [2018-11-18 22:50:32,526 INFO L256 TraceCheckUtils]: 68: Hoare triple {4589#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4589#false} is VALID [2018-11-18 22:50:32,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {4589#false} ~cond := #in~cond; {4589#false} is VALID [2018-11-18 22:50:32,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {4589#false} assume 0 == ~cond; {4589#false} is VALID [2018-11-18 22:50:32,526 INFO L273 TraceCheckUtils]: 71: Hoare triple {4589#false} assume !false; {4589#false} is VALID [2018-11-18 22:50:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:50:32,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:32,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 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:50:32,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:32,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:50:32,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:32,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:32,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {4588#true} call ULTIMATE.init(); {4588#true} is VALID [2018-11-18 22:50:32,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {4588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4588#true} is VALID [2018-11-18 22:50:32,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4588#true} {4588#true} #81#return; {4588#true} is VALID [2018-11-18 22:50:32,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {4588#true} call #t~ret9 := main(); {4588#true} is VALID [2018-11-18 22:50:32,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {4588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4588#true} is VALID [2018-11-18 22:50:32,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,769 INFO L273 TraceCheckUtils]: 30: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {4588#true} assume !(~a~0 < 100000); {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {4588#true} havoc ~i~0;~i~0 := 0; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4588#true} is VALID [2018-11-18 22:50:32,770 INFO L273 TraceCheckUtils]: 38: Hoare triple {4588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {4588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {4588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 45: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4588#true} is VALID [2018-11-18 22:50:32,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {4588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4588#true} is VALID [2018-11-18 22:50:32,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-18 22:50:32,772 INFO L273 TraceCheckUtils]: 49: Hoare triple {4588#true} assume !(~i~0 < 100000); {4588#true} is VALID [2018-11-18 22:50:32,772 INFO L273 TraceCheckUtils]: 50: Hoare triple {4588#true} ~i~0 := 0; {4753#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:32,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {4753#(<= main_~i~0 0)} assume true; {4753#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:32,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {4753#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4753#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:32,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {4753#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4763#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:32,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {4763#(<= main_~i~0 1)} assume true; {4763#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:32,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {4763#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4763#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:32,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {4763#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4773#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:32,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {4773#(<= main_~i~0 2)} assume true; {4773#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:32,775 INFO L273 TraceCheckUtils]: 58: Hoare triple {4773#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4773#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:32,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {4773#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4783#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:32,776 INFO L273 TraceCheckUtils]: 60: Hoare triple {4783#(<= main_~i~0 3)} assume true; {4783#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:32,777 INFO L273 TraceCheckUtils]: 61: Hoare triple {4783#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4783#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:32,777 INFO L273 TraceCheckUtils]: 62: Hoare triple {4783#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4793#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:32,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {4793#(<= main_~i~0 4)} assume true; {4793#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:32,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {4793#(<= main_~i~0 4)} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-18 22:50:32,779 INFO L273 TraceCheckUtils]: 65: Hoare triple {4589#false} havoc ~x~0;~x~0 := 0; {4589#false} is VALID [2018-11-18 22:50:32,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-18 22:50:32,779 INFO L273 TraceCheckUtils]: 67: Hoare triple {4589#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4589#false} is VALID [2018-11-18 22:50:32,780 INFO L256 TraceCheckUtils]: 68: Hoare triple {4589#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4589#false} is VALID [2018-11-18 22:50:32,780 INFO L273 TraceCheckUtils]: 69: Hoare triple {4589#false} ~cond := #in~cond; {4589#false} is VALID [2018-11-18 22:50:32,780 INFO L273 TraceCheckUtils]: 70: Hoare triple {4589#false} assume 0 == ~cond; {4589#false} is VALID [2018-11-18 22:50:32,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {4589#false} assume !false; {4589#false} is VALID [2018-11-18 22:50:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-18 22:50:32,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-18 22:50:32,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-18 22:50:32,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:32,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:50:32,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:32,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:50:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:50:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:50:32,885 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 17 states. [2018-11-18 22:50:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:33,459 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-11-18 22:50:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:50:33,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-18 22:50:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:50:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2018-11-18 22:50:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:50:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2018-11-18 22:50:33,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 117 transitions. [2018-11-18 22:50:33,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:33,587 INFO L225 Difference]: With dead ends: 131 [2018-11-18 22:50:33,587 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 22:50:33,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:50:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 22:50:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-18 22:50:33,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:33,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 86 states. [2018-11-18 22:50:33,627 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 86 states. [2018-11-18 22:50:33,627 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 86 states. [2018-11-18 22:50:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:33,629 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-18 22:50:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-18 22:50:33,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:33,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:33,630 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 89 states. [2018-11-18 22:50:33,630 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 89 states. [2018-11-18 22:50:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:33,632 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-18 22:50:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-18 22:50:33,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:33,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:33,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:33,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 22:50:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-18 22:50:33,635 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 72 [2018-11-18 22:50:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:33,635 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-18 22:50:33,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:50:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-18 22:50:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 22:50:33,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:33,637 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:33,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:33,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash -227983999, now seen corresponding path program 10 times [2018-11-18 22:50:33,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:33,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:33,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:34,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-18 22:50:34,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-18 22:50:34,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-18 22:50:34,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #81#return; {5288#true} is VALID [2018-11-18 22:50:34,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret9 := main(); {5288#true} is VALID [2018-11-18 22:50:34,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5290#(= main_~a~0 0)} is VALID [2018-11-18 22:50:34,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {5290#(= main_~a~0 0)} assume true; {5290#(= main_~a~0 0)} is VALID [2018-11-18 22:50:34,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {5290#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5290#(= main_~a~0 0)} is VALID [2018-11-18 22:50:34,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {5290#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~a~0 1)} assume true; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {5291#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {5291#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {5292#(<= main_~a~0 2)} assume true; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {5292#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {5292#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {5293#(<= main_~a~0 3)} assume true; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {5293#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {5293#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {5294#(<= main_~a~0 4)} assume true; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {5294#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {5294#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {5295#(<= main_~a~0 5)} assume true; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {5295#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {5295#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {5296#(<= main_~a~0 6)} assume true; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {5296#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {5296#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {5297#(<= main_~a~0 7)} assume true; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {5297#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {5297#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {5298#(<= main_~a~0 8)} assume true; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {5298#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {5298#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {5299#(<= main_~a~0 9)} assume true; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {5299#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {5299#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5300#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:34,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#(<= main_~a~0 10)} assume true; {5300#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:34,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} havoc ~i~0;~i~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,371 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 63: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 64: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 65: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 67: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 70: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 72: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {5289#false} havoc ~x~0;~x~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L273 TraceCheckUtils]: 75: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L273 TraceCheckUtils]: 76: Hoare triple {5289#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L256 TraceCheckUtils]: 77: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L273 TraceCheckUtils]: 78: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-18 22:50:34,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {5289#false} assume 0 == ~cond; {5289#false} is VALID [2018-11-18 22:50:34,378 INFO L273 TraceCheckUtils]: 80: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-18 22:50:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:50:34,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:34,385 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:50:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:50:34,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:50:34,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:34,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:34,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-18 22:50:34,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-18 22:50:34,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-18 22:50:34,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #81#return; {5288#true} is VALID [2018-11-18 22:50:34,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret9 := main(); {5288#true} is VALID [2018-11-18 22:50:34,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5319#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:34,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {5319#(<= main_~a~0 0)} assume true; {5319#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:34,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {5319#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5319#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:34,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {5319#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~a~0 1)} assume true; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {5291#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5291#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:34,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {5291#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {5292#(<= main_~a~0 2)} assume true; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {5292#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5292#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:34,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {5292#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {5293#(<= main_~a~0 3)} assume true; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {5293#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5293#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:34,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {5293#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {5294#(<= main_~a~0 4)} assume true; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {5294#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5294#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:34,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {5294#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {5295#(<= main_~a~0 5)} assume true; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {5295#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5295#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:34,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {5295#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {5296#(<= main_~a~0 6)} assume true; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {5296#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5296#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:34,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {5296#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {5297#(<= main_~a~0 7)} assume true; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {5297#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5297#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:34,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {5297#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {5298#(<= main_~a~0 8)} assume true; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {5298#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5298#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:34,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {5298#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {5299#(<= main_~a~0 9)} assume true; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {5299#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5299#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:34,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {5299#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5300#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:34,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#(<= main_~a~0 10)} assume true; {5300#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:34,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} havoc ~i~0;~i~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,611 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5289#false} is VALID [2018-11-18 22:50:34,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {5289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 65: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 66: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 67: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 68: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 69: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {5289#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 74: Hoare triple {5289#false} havoc ~x~0;~x~0 := 0; {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 76: Hoare triple {5289#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L256 TraceCheckUtils]: 77: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {5289#false} is VALID [2018-11-18 22:50:34,615 INFO L273 TraceCheckUtils]: 78: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-18 22:50:34,616 INFO L273 TraceCheckUtils]: 79: Hoare triple {5289#false} assume 0 == ~cond; {5289#false} is VALID [2018-11-18 22:50:34,616 INFO L273 TraceCheckUtils]: 80: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-18 22:50:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:50:34,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:50:34,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-18 22:50:34,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:34,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:50:34,690 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:50:34,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:50:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:50:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:50:34,691 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 14 states. [2018-11-18 22:50:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:35,017 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-11-18 22:50:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:50:35,017 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-18 22:50:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:50:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-18 22:50:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:50:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-18 22:50:35,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 88 transitions. [2018-11-18 22:50:35,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:35,953 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:50:35,953 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 22:50:35,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:50:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 22:50:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-18 22:50:36,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:36,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-18 22:50:36,109 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-18 22:50:36,109 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-18 22:50:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:36,112 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-11-18 22:50:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-18 22:50:36,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:36,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:36,112 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-18 22:50:36,112 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-18 22:50:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:36,114 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-11-18 22:50:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-18 22:50:36,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:36,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:36,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:36,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 22:50:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-11-18 22:50:36,117 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 81 [2018-11-18 22:50:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:36,117 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-11-18 22:50:36,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:50:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-18 22:50:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 22:50:36,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:36,119 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:36,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:36,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash -688059074, now seen corresponding path program 11 times [2018-11-18 22:50:36,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:36,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:36,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {6028#true} call ULTIMATE.init(); {6028#true} is VALID [2018-11-18 22:50:36,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {6028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6028#true} is VALID [2018-11-18 22:50:36,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {6028#true} assume true; {6028#true} is VALID [2018-11-18 22:50:36,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6028#true} {6028#true} #81#return; {6028#true} is VALID [2018-11-18 22:50:36,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {6028#true} call #t~ret9 := main(); {6028#true} is VALID [2018-11-18 22:50:36,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {6028#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6030#(= main_~a~0 0)} is VALID [2018-11-18 22:50:36,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {6030#(= main_~a~0 0)} assume true; {6030#(= main_~a~0 0)} is VALID [2018-11-18 22:50:36,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {6030#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6030#(= main_~a~0 0)} is VALID [2018-11-18 22:50:36,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {6030#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:36,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {6031#(<= main_~a~0 1)} assume true; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:36,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {6031#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:36,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {6031#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:36,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~a~0 2)} assume true; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:36,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:36,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:36,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {6033#(<= main_~a~0 3)} assume true; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:36,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {6033#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:36,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {6033#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:36,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {6034#(<= main_~a~0 4)} assume true; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:36,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {6034#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:36,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {6034#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:36,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {6035#(<= main_~a~0 5)} assume true; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:36,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {6035#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:36,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {6035#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:36,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {6036#(<= main_~a~0 6)} assume true; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:36,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {6036#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:36,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {6036#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:36,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {6037#(<= main_~a~0 7)} assume true; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:36,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {6037#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:36,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {6037#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:36,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {6038#(<= main_~a~0 8)} assume true; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:36,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {6038#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:36,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {6038#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:36,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {6039#(<= main_~a~0 9)} assume true; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:36,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {6039#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:36,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {6039#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:36,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {6040#(<= main_~a~0 10)} assume true; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:36,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {6040#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:36,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {6040#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6041#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:36,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {6041#(<= main_~a~0 11)} assume true; {6041#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:36,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {6041#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:36,969 INFO L273 TraceCheckUtils]: 41: Hoare triple {6029#false} havoc ~i~0;~i~0 := 0; {6029#false} is VALID [2018-11-18 22:50:36,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:36,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:36,970 INFO L273 TraceCheckUtils]: 45: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 50: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:36,971 INFO L273 TraceCheckUtils]: 51: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:36,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:36,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:36,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:36,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:36,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {6029#false} ~i~0 := 0; {6029#false} is VALID [2018-11-18 22:50:36,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 64: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:36,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 76: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 77: Hoare triple {6029#false} havoc ~x~0;~x~0 := 0; {6029#false} is VALID [2018-11-18 22:50:36,975 INFO L273 TraceCheckUtils]: 78: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:36,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {6029#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6029#false} is VALID [2018-11-18 22:50:36,976 INFO L256 TraceCheckUtils]: 80: Hoare triple {6029#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6029#false} is VALID [2018-11-18 22:50:36,976 INFO L273 TraceCheckUtils]: 81: Hoare triple {6029#false} ~cond := #in~cond; {6029#false} is VALID [2018-11-18 22:50:36,976 INFO L273 TraceCheckUtils]: 82: Hoare triple {6029#false} assume 0 == ~cond; {6029#false} is VALID [2018-11-18 22:50:36,976 INFO L273 TraceCheckUtils]: 83: Hoare triple {6029#false} assume !false; {6029#false} is VALID [2018-11-18 22:50:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:50:36,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:36,980 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:50:36,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:50:39,107 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:50:39,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:39,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {6028#true} call ULTIMATE.init(); {6028#true} is VALID [2018-11-18 22:50:39,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {6028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6028#true} is VALID [2018-11-18 22:50:39,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {6028#true} assume true; {6028#true} is VALID [2018-11-18 22:50:39,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6028#true} {6028#true} #81#return; {6028#true} is VALID [2018-11-18 22:50:39,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {6028#true} call #t~ret9 := main(); {6028#true} is VALID [2018-11-18 22:50:39,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {6028#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6060#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:39,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#(<= main_~a~0 0)} assume true; {6060#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:39,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6060#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:39,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {6060#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:39,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {6031#(<= main_~a~0 1)} assume true; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:39,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {6031#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6031#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:39,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {6031#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:39,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~a~0 2)} assume true; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:39,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6032#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:39,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:39,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {6033#(<= main_~a~0 3)} assume true; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:39,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {6033#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6033#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:39,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {6033#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:39,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {6034#(<= main_~a~0 4)} assume true; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:39,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {6034#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6034#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:39,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {6034#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:39,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {6035#(<= main_~a~0 5)} assume true; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:39,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {6035#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6035#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:39,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {6035#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:39,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {6036#(<= main_~a~0 6)} assume true; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:39,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {6036#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6036#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:39,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {6036#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:39,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {6037#(<= main_~a~0 7)} assume true; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:39,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {6037#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6037#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:39,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {6037#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:39,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {6038#(<= main_~a~0 8)} assume true; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:39,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {6038#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6038#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:39,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {6038#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:39,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {6039#(<= main_~a~0 9)} assume true; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:39,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {6039#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6039#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:39,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {6039#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:39,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {6040#(<= main_~a~0 10)} assume true; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:39,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {6040#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6040#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:39,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {6040#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6041#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:39,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {6041#(<= main_~a~0 11)} assume true; {6041#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:39,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {6041#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:39,302 INFO L273 TraceCheckUtils]: 41: Hoare triple {6029#false} havoc ~i~0;~i~0 := 0; {6029#false} is VALID [2018-11-18 22:50:39,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,303 INFO L273 TraceCheckUtils]: 43: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:39,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:39,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,303 INFO L273 TraceCheckUtils]: 46: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:39,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:39,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,304 INFO L273 TraceCheckUtils]: 49: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:39,304 INFO L273 TraceCheckUtils]: 50: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:39,304 INFO L273 TraceCheckUtils]: 51: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 52: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 53: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 54: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 55: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 56: Hoare triple {6029#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 57: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,305 INFO L273 TraceCheckUtils]: 58: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 59: Hoare triple {6029#false} ~i~0 := 0; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 61: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 64: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:39,306 INFO L273 TraceCheckUtils]: 66: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 67: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 69: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 70: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 71: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6029#false} is VALID [2018-11-18 22:50:39,307 INFO L273 TraceCheckUtils]: 74: Hoare triple {6029#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6029#false} is VALID [2018-11-18 22:50:39,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,308 INFO L273 TraceCheckUtils]: 76: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-18 22:50:39,308 INFO L273 TraceCheckUtils]: 77: Hoare triple {6029#false} havoc ~x~0;~x~0 := 0; {6029#false} is VALID [2018-11-18 22:50:39,308 INFO L273 TraceCheckUtils]: 78: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-18 22:50:39,308 INFO L273 TraceCheckUtils]: 79: Hoare triple {6029#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6029#false} is VALID [2018-11-18 22:50:39,309 INFO L256 TraceCheckUtils]: 80: Hoare triple {6029#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6029#false} is VALID [2018-11-18 22:50:39,309 INFO L273 TraceCheckUtils]: 81: Hoare triple {6029#false} ~cond := #in~cond; {6029#false} is VALID [2018-11-18 22:50:39,309 INFO L273 TraceCheckUtils]: 82: Hoare triple {6029#false} assume 0 == ~cond; {6029#false} is VALID [2018-11-18 22:50:39,309 INFO L273 TraceCheckUtils]: 83: Hoare triple {6029#false} assume !false; {6029#false} is VALID [2018-11-18 22:50:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:50:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:50:39,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-18 22:50:39,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:39,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:50:39,397 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:50:39,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:50:39,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:50:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:50:39,399 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 15 states. [2018-11-18 22:50:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:40,038 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-18 22:50:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:50:40,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-18 22:50:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:50:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:50:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:50:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:50:40,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2018-11-18 22:50:40,572 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:50:40,574 INFO L225 Difference]: With dead ends: 141 [2018-11-18 22:50:40,574 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 22:50:40,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:50:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 22:50:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-18 22:50:40,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:40,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-18 22:50:40,600 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-18 22:50:40,600 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-18 22:50:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:40,602 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-18 22:50:40,602 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-18 22:50:40,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:40,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:40,603 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-18 22:50:40,603 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-18 22:50:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:40,605 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-18 22:50:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-18 22:50:40,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:40,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:40,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:40,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:50:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-18 22:50:40,608 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 84 [2018-11-18 22:50:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:40,609 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-18 22:50:40,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:50:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-18 22:50:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 22:50:40,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:40,610 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:40,610 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1543976863, now seen corresponding path program 12 times [2018-11-18 22:50:40,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:40,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:40,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:41,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {6792#true} call ULTIMATE.init(); {6792#true} is VALID [2018-11-18 22:50:41,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {6792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6792#true} is VALID [2018-11-18 22:50:41,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:41,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6792#true} {6792#true} #81#return; {6792#true} is VALID [2018-11-18 22:50:41,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {6792#true} call #t~ret9 := main(); {6792#true} is VALID [2018-11-18 22:50:41,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {6792#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6794#(= main_~a~0 0)} is VALID [2018-11-18 22:50:41,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {6794#(= main_~a~0 0)} assume true; {6794#(= main_~a~0 0)} is VALID [2018-11-18 22:50:41,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {6794#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6794#(= main_~a~0 0)} is VALID [2018-11-18 22:50:41,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {6794#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:41,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {6795#(<= main_~a~0 1)} assume true; {6795#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:41,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {6795#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6795#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:41,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {6795#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:41,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {6796#(<= main_~a~0 2)} assume true; {6796#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:41,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {6796#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6796#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:41,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {6796#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:41,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {6797#(<= main_~a~0 3)} assume true; {6797#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:41,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {6797#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6797#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:41,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {6797#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:41,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {6798#(<= main_~a~0 4)} assume true; {6798#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:41,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {6798#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6798#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:41,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {6798#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:41,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {6799#(<= main_~a~0 5)} assume true; {6799#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:41,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {6799#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6799#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:41,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {6799#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:41,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {6800#(<= main_~a~0 6)} assume true; {6800#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:41,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {6800#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6800#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:41,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {6800#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:41,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {6801#(<= main_~a~0 7)} assume true; {6801#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:41,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {6801#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6801#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:41,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {6801#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:41,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {6802#(<= main_~a~0 8)} assume true; {6802#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:41,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {6802#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6802#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:41,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {6802#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:41,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {6803#(<= main_~a~0 9)} assume true; {6803#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:41,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {6803#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6803#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:41,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {6803#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:41,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {6804#(<= main_~a~0 10)} assume true; {6804#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:41,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {6804#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6804#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:41,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {6804#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:41,302 INFO L273 TraceCheckUtils]: 39: Hoare triple {6805#(<= main_~a~0 11)} assume true; {6805#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:41,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {6805#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6805#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:41,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {6805#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:41,304 INFO L273 TraceCheckUtils]: 42: Hoare triple {6806#(<= main_~a~0 12)} assume true; {6806#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:41,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {6806#(<= main_~a~0 12)} assume !(~a~0 < 100000); {6793#false} is VALID [2018-11-18 22:50:41,305 INFO L273 TraceCheckUtils]: 44: Hoare triple {6793#false} havoc ~i~0;~i~0 := 0; {6793#false} is VALID [2018-11-18 22:50:41,305 INFO L273 TraceCheckUtils]: 45: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,305 INFO L273 TraceCheckUtils]: 46: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6793#false} is VALID [2018-11-18 22:50:41,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {6793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#false} is VALID [2018-11-18 22:50:41,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,306 INFO L273 TraceCheckUtils]: 49: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6793#false} is VALID [2018-11-18 22:50:41,306 INFO L273 TraceCheckUtils]: 50: Hoare triple {6793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#false} is VALID [2018-11-18 22:50:41,306 INFO L273 TraceCheckUtils]: 51: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,306 INFO L273 TraceCheckUtils]: 52: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6793#false} is VALID [2018-11-18 22:50:41,306 INFO L273 TraceCheckUtils]: 53: Hoare triple {6793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#false} is VALID [2018-11-18 22:50:41,307 INFO L273 TraceCheckUtils]: 54: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,307 INFO L273 TraceCheckUtils]: 55: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6793#false} is VALID [2018-11-18 22:50:41,307 INFO L273 TraceCheckUtils]: 56: Hoare triple {6793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#false} is VALID [2018-11-18 22:50:41,307 INFO L273 TraceCheckUtils]: 57: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,308 INFO L273 TraceCheckUtils]: 58: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6793#false} is VALID [2018-11-18 22:50:41,308 INFO L273 TraceCheckUtils]: 59: Hoare triple {6793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#false} is VALID [2018-11-18 22:50:41,308 INFO L273 TraceCheckUtils]: 60: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-18 22:50:41,308 INFO L273 TraceCheckUtils]: 62: Hoare triple {6793#false} ~i~0 := 0; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 63: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 64: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 69: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,309 INFO L273 TraceCheckUtils]: 70: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 71: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 72: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 73: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 74: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 75: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 76: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 77: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 78: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,310 INFO L273 TraceCheckUtils]: 79: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 80: Hoare triple {6793#false} havoc ~x~0;~x~0 := 0; {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 81: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 82: Hoare triple {6793#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L256 TraceCheckUtils]: 83: Hoare triple {6793#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 84: Hoare triple {6793#false} ~cond := #in~cond; {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 85: Hoare triple {6793#false} assume 0 == ~cond; {6793#false} is VALID [2018-11-18 22:50:41,311 INFO L273 TraceCheckUtils]: 86: Hoare triple {6793#false} assume !false; {6793#false} is VALID [2018-11-18 22:50:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:50:41,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:41,315 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:50:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:50:42,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 22:50:42,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:42,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:42,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {6792#true} call ULTIMATE.init(); {6792#true} is VALID [2018-11-18 22:50:42,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {6792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6792#true} is VALID [2018-11-18 22:50:42,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6792#true} {6792#true} #81#return; {6792#true} is VALID [2018-11-18 22:50:42,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {6792#true} call #t~ret9 := main(); {6792#true} is VALID [2018-11-18 22:50:42,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {6792#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6792#true} is VALID [2018-11-18 22:50:42,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6792#true} is VALID [2018-11-18 22:50:42,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6792#true} is VALID [2018-11-18 22:50:42,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-18 22:50:42,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {6792#true} assume !(~a~0 < 100000); {6792#true} is VALID [2018-11-18 22:50:42,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {6792#true} havoc ~i~0;~i~0 := 0; {6942#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:42,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {6942#(<= main_~i~0 0)} assume true; {6942#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:42,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {6942#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6942#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:42,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {6942#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6952#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:42,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {6952#(<= main_~i~0 1)} assume true; {6952#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:42,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {6952#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6952#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:42,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {6952#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6962#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:42,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {6962#(<= main_~i~0 2)} assume true; {6962#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:42,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {6962#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6962#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:42,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {6962#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6972#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:42,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {6972#(<= main_~i~0 3)} assume true; {6972#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:42,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {6972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6972#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:42,263 INFO L273 TraceCheckUtils]: 56: Hoare triple {6972#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6982#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:42,280 INFO L273 TraceCheckUtils]: 57: Hoare triple {6982#(<= main_~i~0 4)} assume true; {6982#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:42,287 INFO L273 TraceCheckUtils]: 58: Hoare triple {6982#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6982#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:42,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {6982#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6992#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:42,288 INFO L273 TraceCheckUtils]: 60: Hoare triple {6992#(<= main_~i~0 5)} assume true; {6992#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:42,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {6992#(<= main_~i~0 5)} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-18 22:50:42,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {6793#false} ~i~0 := 0; {6793#false} is VALID [2018-11-18 22:50:42,288 INFO L273 TraceCheckUtils]: 63: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 69: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 70: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:42,289 INFO L273 TraceCheckUtils]: 71: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 72: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 73: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 74: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 75: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 76: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 77: Hoare triple {6793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 78: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-18 22:50:42,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {6793#false} havoc ~x~0;~x~0 := 0; {6793#false} is VALID [2018-11-18 22:50:42,291 INFO L273 TraceCheckUtils]: 81: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-18 22:50:42,291 INFO L273 TraceCheckUtils]: 82: Hoare triple {6793#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6793#false} is VALID [2018-11-18 22:50:42,291 INFO L256 TraceCheckUtils]: 83: Hoare triple {6793#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6793#false} is VALID [2018-11-18 22:50:42,291 INFO L273 TraceCheckUtils]: 84: Hoare triple {6793#false} ~cond := #in~cond; {6793#false} is VALID [2018-11-18 22:50:42,291 INFO L273 TraceCheckUtils]: 85: Hoare triple {6793#false} assume 0 == ~cond; {6793#false} is VALID [2018-11-18 22:50:42,292 INFO L273 TraceCheckUtils]: 86: Hoare triple {6793#false} assume !false; {6793#false} is VALID [2018-11-18 22:50:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-11-18 22:50:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-18 22:50:42,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-18 22:50:42,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:42,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:50:42,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:42,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:50:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:50:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:50:42,390 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 21 states. [2018-11-18 22:50:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:43,491 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-18 22:50:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:50:43,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-18 22:50:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:50:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-18 22:50:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:50:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-18 22:50:43,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 132 transitions. [2018-11-18 22:50:43,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:43,617 INFO L225 Difference]: With dead ends: 152 [2018-11-18 22:50:43,617 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 22:50:43,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:50:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 22:50:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-18 22:50:43,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:43,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 101 states. [2018-11-18 22:50:43,648 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 101 states. [2018-11-18 22:50:43,648 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 101 states. [2018-11-18 22:50:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:43,651 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-18 22:50:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-18 22:50:43,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:43,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:43,652 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 104 states. [2018-11-18 22:50:43,652 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 104 states. [2018-11-18 22:50:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:43,654 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-18 22:50:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-18 22:50:43,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:43,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:43,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:43,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 22:50:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-11-18 22:50:43,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 87 [2018-11-18 22:50:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:43,657 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-11-18 22:50:43,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:50:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-18 22:50:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 22:50:43,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:43,659 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:43,659 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:43,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1869493377, now seen corresponding path program 13 times [2018-11-18 22:50:43,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:43,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:43,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:44,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {7619#true} call ULTIMATE.init(); {7619#true} is VALID [2018-11-18 22:50:44,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {7619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7619#true} is VALID [2018-11-18 22:50:44,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {7619#true} assume true; {7619#true} is VALID [2018-11-18 22:50:44,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7619#true} {7619#true} #81#return; {7619#true} is VALID [2018-11-18 22:50:44,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {7619#true} call #t~ret9 := main(); {7619#true} is VALID [2018-11-18 22:50:44,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {7619#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7621#(= main_~a~0 0)} is VALID [2018-11-18 22:50:44,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {7621#(= main_~a~0 0)} assume true; {7621#(= main_~a~0 0)} is VALID [2018-11-18 22:50:44,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {7621#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7621#(= main_~a~0 0)} is VALID [2018-11-18 22:50:44,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {7621#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {7622#(<= main_~a~0 1)} assume true; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {7622#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {7622#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {7623#(<= main_~a~0 2)} assume true; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {7623#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {7623#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {7624#(<= main_~a~0 3)} assume true; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {7624#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {7624#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {7625#(<= main_~a~0 4)} assume true; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {7625#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {7625#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {7626#(<= main_~a~0 5)} assume true; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {7626#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {7626#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {7627#(<= main_~a~0 6)} assume true; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {7627#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {7628#(<= main_~a~0 7)} assume true; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {7628#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {7628#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {7629#(<= main_~a~0 8)} assume true; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {7629#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {7629#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {7630#(<= main_~a~0 9)} assume true; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {7630#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {7630#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {7631#(<= main_~a~0 10)} assume true; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {7631#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {7631#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {7632#(<= main_~a~0 11)} assume true; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {7632#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,341 INFO L273 TraceCheckUtils]: 41: Hoare triple {7632#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {7633#(<= main_~a~0 12)} assume true; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {7633#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {7633#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7634#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:44,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {7634#(<= main_~a~0 13)} assume true; {7634#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:44,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {7634#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {7620#false} havoc ~i~0;~i~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,346 INFO L273 TraceCheckUtils]: 53: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,346 INFO L273 TraceCheckUtils]: 54: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,346 INFO L273 TraceCheckUtils]: 56: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,347 INFO L273 TraceCheckUtils]: 58: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,347 INFO L273 TraceCheckUtils]: 60: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,347 INFO L273 TraceCheckUtils]: 61: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,347 INFO L273 TraceCheckUtils]: 62: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,348 INFO L273 TraceCheckUtils]: 66: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,348 INFO L273 TraceCheckUtils]: 67: Hoare triple {7620#false} assume !(~i~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {7620#false} ~i~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 72: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 73: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 74: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,349 INFO L273 TraceCheckUtils]: 75: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 78: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 79: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 80: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 81: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 82: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 83: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,350 INFO L273 TraceCheckUtils]: 84: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 86: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 87: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 88: Hoare triple {7620#false} assume !(~i~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 89: Hoare triple {7620#false} havoc ~x~0;~x~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 90: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L273 TraceCheckUtils]: 91: Hoare triple {7620#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7620#false} is VALID [2018-11-18 22:50:44,351 INFO L256 TraceCheckUtils]: 92: Hoare triple {7620#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {7620#false} is VALID [2018-11-18 22:50:44,352 INFO L273 TraceCheckUtils]: 93: Hoare triple {7620#false} ~cond := #in~cond; {7620#false} is VALID [2018-11-18 22:50:44,352 INFO L273 TraceCheckUtils]: 94: Hoare triple {7620#false} assume 0 == ~cond; {7620#false} is VALID [2018-11-18 22:50:44,352 INFO L273 TraceCheckUtils]: 95: Hoare triple {7620#false} assume !false; {7620#false} is VALID [2018-11-18 22:50:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:50:44,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:44,358 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:50:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:44,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:44,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {7619#true} call ULTIMATE.init(); {7619#true} is VALID [2018-11-18 22:50:44,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {7619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7619#true} is VALID [2018-11-18 22:50:44,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {7619#true} assume true; {7619#true} is VALID [2018-11-18 22:50:44,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7619#true} {7619#true} #81#return; {7619#true} is VALID [2018-11-18 22:50:44,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {7619#true} call #t~ret9 := main(); {7619#true} is VALID [2018-11-18 22:50:44,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {7619#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7653#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:44,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {7653#(<= main_~a~0 0)} assume true; {7653#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:44,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {7653#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7653#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:44,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {7653#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {7622#(<= main_~a~0 1)} assume true; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {7622#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7622#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:44,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {7622#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {7623#(<= main_~a~0 2)} assume true; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {7623#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7623#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:44,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {7623#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {7624#(<= main_~a~0 3)} assume true; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {7624#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7624#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:44,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {7624#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {7625#(<= main_~a~0 4)} assume true; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {7625#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7625#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:44,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {7625#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {7626#(<= main_~a~0 5)} assume true; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {7626#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7626#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:44,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {7626#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {7627#(<= main_~a~0 6)} assume true; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {7627#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7627#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:44,659 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {7628#(<= main_~a~0 7)} assume true; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,660 INFO L273 TraceCheckUtils]: 28: Hoare triple {7628#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7628#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:44,661 INFO L273 TraceCheckUtils]: 29: Hoare triple {7628#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,661 INFO L273 TraceCheckUtils]: 30: Hoare triple {7629#(<= main_~a~0 8)} assume true; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {7629#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7629#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:44,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {7629#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {7630#(<= main_~a~0 9)} assume true; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {7630#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7630#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:44,664 INFO L273 TraceCheckUtils]: 35: Hoare triple {7630#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {7631#(<= main_~a~0 10)} assume true; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {7631#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7631#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:44,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {7631#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,667 INFO L273 TraceCheckUtils]: 39: Hoare triple {7632#(<= main_~a~0 11)} assume true; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,667 INFO L273 TraceCheckUtils]: 40: Hoare triple {7632#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7632#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:44,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {7632#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {7633#(<= main_~a~0 12)} assume true; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {7633#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7633#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:44,670 INFO L273 TraceCheckUtils]: 44: Hoare triple {7633#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7634#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:44,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {7634#(<= main_~a~0 13)} assume true; {7634#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:44,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {7634#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,671 INFO L273 TraceCheckUtils]: 47: Hoare triple {7620#false} havoc ~i~0;~i~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,672 INFO L273 TraceCheckUtils]: 49: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,672 INFO L273 TraceCheckUtils]: 50: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,672 INFO L273 TraceCheckUtils]: 51: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,672 INFO L273 TraceCheckUtils]: 52: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,674 INFO L273 TraceCheckUtils]: 61: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {7620#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {7620#false} assume !(~i~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {7620#false} ~i~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 85: Hoare triple {7620#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {7620#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {7620#false} assume !(~i~0 < 100000); {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L273 TraceCheckUtils]: 89: Hoare triple {7620#false} havoc ~x~0;~x~0 := 0; {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L273 TraceCheckUtils]: 90: Hoare triple {7620#false} assume true; {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L273 TraceCheckUtils]: 91: Hoare triple {7620#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L256 TraceCheckUtils]: 92: Hoare triple {7620#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {7620#false} ~cond := #in~cond; {7620#false} is VALID [2018-11-18 22:50:44,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {7620#false} assume 0 == ~cond; {7620#false} is VALID [2018-11-18 22:50:44,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {7620#false} assume !false; {7620#false} is VALID [2018-11-18 22:50:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:50:44,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:44,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:50:44,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-18 22:50:44,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:44,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:50:44,769 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:50:44,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:50:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:50:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:50:44,771 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 17 states. [2018-11-18 22:50:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:45,229 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-11-18 22:50:45,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:50:45,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-18 22:50:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:50:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2018-11-18 22:50:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:50:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2018-11-18 22:50:45,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 97 transitions. [2018-11-18 22:50:45,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:45,352 INFO L225 Difference]: With dead ends: 159 [2018-11-18 22:50:45,352 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 22:50:45,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:50:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 22:50:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-18 22:50:45,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:45,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-18 22:50:45,579 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-18 22:50:45,579 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-18 22:50:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:45,582 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-18 22:50:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-18 22:50:45,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:45,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:45,583 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-18 22:50:45,583 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-18 22:50:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:45,585 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-18 22:50:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-18 22:50:45,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:45,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:45,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:45,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 22:50:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-18 22:50:45,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 96 [2018-11-18 22:50:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:45,589 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-18 22:50:45,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:50:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-18 22:50:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 22:50:45,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:45,591 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:45,591 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:45,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -309112028, now seen corresponding path program 14 times [2018-11-18 22:50:45,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:45,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:45,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:45,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:46,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {8485#true} call ULTIMATE.init(); {8485#true} is VALID [2018-11-18 22:50:46,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {8485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8485#true} is VALID [2018-11-18 22:50:46,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {8485#true} assume true; {8485#true} is VALID [2018-11-18 22:50:46,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8485#true} {8485#true} #81#return; {8485#true} is VALID [2018-11-18 22:50:46,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {8485#true} call #t~ret9 := main(); {8485#true} is VALID [2018-11-18 22:50:46,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {8485#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8487#(= main_~a~0 0)} is VALID [2018-11-18 22:50:46,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {8487#(= main_~a~0 0)} assume true; {8487#(= main_~a~0 0)} is VALID [2018-11-18 22:50:46,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {8487#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8487#(= main_~a~0 0)} is VALID [2018-11-18 22:50:46,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {8487#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:46,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {8488#(<= main_~a~0 1)} assume true; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:46,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {8488#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:46,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {8488#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:46,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {8489#(<= main_~a~0 2)} assume true; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:46,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {8489#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:46,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {8489#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:46,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {8490#(<= main_~a~0 3)} assume true; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:46,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {8490#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:46,601 INFO L273 TraceCheckUtils]: 17: Hoare triple {8490#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:46,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {8491#(<= main_~a~0 4)} assume true; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:46,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {8491#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:46,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {8491#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:46,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {8492#(<= main_~a~0 5)} assume true; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:46,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {8492#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:46,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {8492#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:46,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {8493#(<= main_~a~0 6)} assume true; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:46,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {8493#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:46,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {8493#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:46,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {8494#(<= main_~a~0 7)} assume true; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:46,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {8494#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:46,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {8494#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:46,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {8495#(<= main_~a~0 8)} assume true; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:46,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {8495#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:46,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {8495#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:46,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {8496#(<= main_~a~0 9)} assume true; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:46,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {8496#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:46,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {8496#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:46,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {8497#(<= main_~a~0 10)} assume true; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:46,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {8497#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:46,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {8497#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:46,615 INFO L273 TraceCheckUtils]: 39: Hoare triple {8498#(<= main_~a~0 11)} assume true; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:46,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {8498#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:46,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {8498#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:46,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {8499#(<= main_~a~0 12)} assume true; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:46,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {8499#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:46,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {8499#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:46,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {8500#(<= main_~a~0 13)} assume true; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:46,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {8500#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:46,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {8500#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8501#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:46,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {8501#(<= main_~a~0 14)} assume true; {8501#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:46,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {8501#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:46,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {8486#false} havoc ~i~0;~i~0 := 0; {8486#false} is VALID [2018-11-18 22:50:46,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 61: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 67: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 68: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 69: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {8486#false} assume !(~i~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {8486#false} ~i~0 := 0; {8486#false} is VALID [2018-11-18 22:50:46,626 INFO L273 TraceCheckUtils]: 72: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 73: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 74: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 75: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 76: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 77: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 78: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 80: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 81: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 82: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 83: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 84: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 85: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,628 INFO L273 TraceCheckUtils]: 86: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 87: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 88: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 89: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 90: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 91: Hoare triple {8486#false} assume !(~i~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:46,629 INFO L273 TraceCheckUtils]: 92: Hoare triple {8486#false} havoc ~x~0;~x~0 := 0; {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L273 TraceCheckUtils]: 93: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L273 TraceCheckUtils]: 94: Hoare triple {8486#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L256 TraceCheckUtils]: 95: Hoare triple {8486#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L273 TraceCheckUtils]: 96: Hoare triple {8486#false} ~cond := #in~cond; {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L273 TraceCheckUtils]: 97: Hoare triple {8486#false} assume 0 == ~cond; {8486#false} is VALID [2018-11-18 22:50:46,630 INFO L273 TraceCheckUtils]: 98: Hoare triple {8486#false} assume !false; {8486#false} is VALID [2018-11-18 22:50:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:50:46,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:46,640 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:50:46,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:46,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:46,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:46,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:47,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {8485#true} call ULTIMATE.init(); {8485#true} is VALID [2018-11-18 22:50:47,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {8485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8485#true} is VALID [2018-11-18 22:50:47,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {8485#true} assume true; {8485#true} is VALID [2018-11-18 22:50:47,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8485#true} {8485#true} #81#return; {8485#true} is VALID [2018-11-18 22:50:47,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {8485#true} call #t~ret9 := main(); {8485#true} is VALID [2018-11-18 22:50:47,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {8485#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8520#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:47,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {8520#(<= main_~a~0 0)} assume true; {8520#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:47,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {8520#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8520#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:47,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {8520#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:47,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {8488#(<= main_~a~0 1)} assume true; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:47,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {8488#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8488#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:47,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {8488#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:47,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {8489#(<= main_~a~0 2)} assume true; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:47,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {8489#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8489#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:47,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {8489#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:47,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {8490#(<= main_~a~0 3)} assume true; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:47,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {8490#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8490#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:47,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {8490#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:47,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {8491#(<= main_~a~0 4)} assume true; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:47,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {8491#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8491#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:47,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {8491#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:47,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {8492#(<= main_~a~0 5)} assume true; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:47,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {8492#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8492#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:47,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {8492#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:47,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {8493#(<= main_~a~0 6)} assume true; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:47,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {8493#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8493#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:47,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {8493#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:47,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {8494#(<= main_~a~0 7)} assume true; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:47,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {8494#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8494#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:47,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {8494#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:47,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {8495#(<= main_~a~0 8)} assume true; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:47,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {8495#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8495#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:47,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {8495#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:47,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {8496#(<= main_~a~0 9)} assume true; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:47,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {8496#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8496#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:47,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {8496#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:47,208 INFO L273 TraceCheckUtils]: 36: Hoare triple {8497#(<= main_~a~0 10)} assume true; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:47,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {8497#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8497#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:47,211 INFO L273 TraceCheckUtils]: 38: Hoare triple {8497#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:47,211 INFO L273 TraceCheckUtils]: 39: Hoare triple {8498#(<= main_~a~0 11)} assume true; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:47,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {8498#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8498#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:47,214 INFO L273 TraceCheckUtils]: 41: Hoare triple {8498#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:47,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {8499#(<= main_~a~0 12)} assume true; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:47,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {8499#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8499#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:47,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {8499#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:47,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {8500#(<= main_~a~0 13)} assume true; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:47,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {8500#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8500#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:47,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {8500#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8501#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:47,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {8501#(<= main_~a~0 14)} assume true; {8501#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:47,226 INFO L273 TraceCheckUtils]: 49: Hoare triple {8501#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:47,226 INFO L273 TraceCheckUtils]: 50: Hoare triple {8486#false} havoc ~i~0;~i~0 := 0; {8486#false} is VALID [2018-11-18 22:50:47,226 INFO L273 TraceCheckUtils]: 51: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,226 INFO L273 TraceCheckUtils]: 52: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 54: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 55: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 56: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 57: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 58: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 59: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 60: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 62: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 63: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 64: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 65: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 66: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 67: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 68: Hoare triple {8486#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 69: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,228 INFO L273 TraceCheckUtils]: 70: Hoare triple {8486#false} assume !(~i~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 71: Hoare triple {8486#false} ~i~0 := 0; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 72: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 73: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 74: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 75: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 76: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 77: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,229 INFO L273 TraceCheckUtils]: 78: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 79: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 80: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 81: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 82: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 83: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 84: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 85: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 86: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 88: Hoare triple {8486#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 89: Hoare triple {8486#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 90: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 91: Hoare triple {8486#false} assume !(~i~0 < 100000); {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 92: Hoare triple {8486#false} havoc ~x~0;~x~0 := 0; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 93: Hoare triple {8486#false} assume true; {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L273 TraceCheckUtils]: 94: Hoare triple {8486#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8486#false} is VALID [2018-11-18 22:50:47,231 INFO L256 TraceCheckUtils]: 95: Hoare triple {8486#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {8486#false} is VALID [2018-11-18 22:50:47,232 INFO L273 TraceCheckUtils]: 96: Hoare triple {8486#false} ~cond := #in~cond; {8486#false} is VALID [2018-11-18 22:50:47,232 INFO L273 TraceCheckUtils]: 97: Hoare triple {8486#false} assume 0 == ~cond; {8486#false} is VALID [2018-11-18 22:50:47,232 INFO L273 TraceCheckUtils]: 98: Hoare triple {8486#false} assume !false; {8486#false} is VALID [2018-11-18 22:50:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:50:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:47,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:50:47,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-11-18 22:50:47,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:47,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:50:47,322 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:50:47,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:50:47,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:50:47,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:50:47,323 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 18 states. [2018-11-18 22:50:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:47,726 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-18 22:50:47,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:50:47,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-11-18 22:50:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:50:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2018-11-18 22:50:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:50:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2018-11-18 22:50:47,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 100 transitions. [2018-11-18 22:50:47,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:47,853 INFO L225 Difference]: With dead ends: 162 [2018-11-18 22:50:47,853 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 22:50:47,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:50:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 22:50:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-18 22:50:47,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:47,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-18 22:50:47,882 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-18 22:50:47,882 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-18 22:50:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:47,885 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-18 22:50:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-18 22:50:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:47,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:47,886 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-18 22:50:47,886 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-18 22:50:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:47,888 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-18 22:50:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-18 22:50:47,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:47,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:47,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:47,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 22:50:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-18 22:50:47,891 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2018-11-18 22:50:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:47,892 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-18 22:50:47,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:50:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-18 22:50:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 22:50:47,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:47,893 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:47,893 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:47,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922527, now seen corresponding path program 15 times [2018-11-18 22:50:47,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:47,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:47,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:48,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {9375#true} call ULTIMATE.init(); {9375#true} is VALID [2018-11-18 22:50:48,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {9375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9375#true} is VALID [2018-11-18 22:50:48,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9375#true} {9375#true} #81#return; {9375#true} is VALID [2018-11-18 22:50:48,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {9375#true} call #t~ret9 := main(); {9375#true} is VALID [2018-11-18 22:50:48,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {9375#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9377#(= main_~a~0 0)} is VALID [2018-11-18 22:50:48,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {9377#(= main_~a~0 0)} assume true; {9377#(= main_~a~0 0)} is VALID [2018-11-18 22:50:48,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {9377#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9377#(= main_~a~0 0)} is VALID [2018-11-18 22:50:48,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {9377#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9378#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:48,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {9378#(<= main_~a~0 1)} assume true; {9378#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:48,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {9378#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9378#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:48,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {9378#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9379#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:48,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {9379#(<= main_~a~0 2)} assume true; {9379#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:48,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {9379#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9379#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:48,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {9379#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9380#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:48,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {9380#(<= main_~a~0 3)} assume true; {9380#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:48,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {9380#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9380#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:48,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {9380#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9381#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:48,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {9381#(<= main_~a~0 4)} assume true; {9381#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:48,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {9381#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9381#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:48,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {9381#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9382#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:48,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {9382#(<= main_~a~0 5)} assume true; {9382#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:48,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {9382#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9382#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:48,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {9382#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9383#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:48,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {9383#(<= main_~a~0 6)} assume true; {9383#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:48,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {9383#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9383#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:48,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {9383#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9384#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:48,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {9384#(<= main_~a~0 7)} assume true; {9384#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:48,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {9384#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9384#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:48,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {9384#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9385#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:48,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {9385#(<= main_~a~0 8)} assume true; {9385#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:48,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {9385#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9385#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:48,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {9385#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9386#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:48,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {9386#(<= main_~a~0 9)} assume true; {9386#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:48,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {9386#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9386#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:48,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {9386#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9387#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:48,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {9387#(<= main_~a~0 10)} assume true; {9387#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:48,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {9387#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9387#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:48,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {9387#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9388#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:48,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {9388#(<= main_~a~0 11)} assume true; {9388#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:48,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {9388#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9388#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:48,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {9388#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9389#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:48,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {9389#(<= main_~a~0 12)} assume true; {9389#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:48,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {9389#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9389#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:48,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {9389#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9390#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:48,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {9390#(<= main_~a~0 13)} assume true; {9390#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:48,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {9390#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9390#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:48,288 INFO L273 TraceCheckUtils]: 47: Hoare triple {9390#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9391#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:48,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {9391#(<= main_~a~0 14)} assume true; {9391#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:48,289 INFO L273 TraceCheckUtils]: 49: Hoare triple {9391#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9391#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:48,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {9391#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9392#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:48,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {9392#(<= main_~a~0 15)} assume true; {9392#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:48,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {9392#(<= main_~a~0 15)} assume !(~a~0 < 100000); {9376#false} is VALID [2018-11-18 22:50:48,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {9376#false} havoc ~i~0;~i~0 := 0; {9376#false} is VALID [2018-11-18 22:50:48,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,292 INFO L273 TraceCheckUtils]: 61: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 65: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 66: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 67: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 68: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,293 INFO L273 TraceCheckUtils]: 69: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 70: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 71: Hoare triple {9376#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {9376#false} assume !(~i~0 < 100000); {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {9376#false} ~i~0 := 0; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 81: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 83: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 84: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 85: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,295 INFO L273 TraceCheckUtils]: 86: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {9376#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {9376#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 93: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 94: Hoare triple {9376#false} assume !(~i~0 < 100000); {9376#false} is VALID [2018-11-18 22:50:48,296 INFO L273 TraceCheckUtils]: 95: Hoare triple {9376#false} havoc ~x~0;~x~0 := 0; {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {9376#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L256 TraceCheckUtils]: 98: Hoare triple {9376#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L273 TraceCheckUtils]: 99: Hoare triple {9376#false} ~cond := #in~cond; {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L273 TraceCheckUtils]: 100: Hoare triple {9376#false} assume 0 == ~cond; {9376#false} is VALID [2018-11-18 22:50:48,297 INFO L273 TraceCheckUtils]: 101: Hoare triple {9376#false} assume !false; {9376#false} is VALID [2018-11-18 22:50:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:50:48,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:48,303 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:50:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:48,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 22:50:48,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:48,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:48,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {9375#true} call ULTIMATE.init(); {9375#true} is VALID [2018-11-18 22:50:48,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {9375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9375#true} is VALID [2018-11-18 22:50:48,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9375#true} {9375#true} #81#return; {9375#true} is VALID [2018-11-18 22:50:48,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {9375#true} call #t~ret9 := main(); {9375#true} is VALID [2018-11-18 22:50:48,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {9375#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9375#true} is VALID [2018-11-18 22:50:48,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 32: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 37: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {9375#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {9375#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {9375#true} assume !(~a~0 < 100000); {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {9375#true} havoc ~i~0;~i~0 := 0; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 62: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 66: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 67: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 68: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {9375#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9375#true} is VALID [2018-11-18 22:50:48,766 INFO L273 TraceCheckUtils]: 71: Hoare triple {9375#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9375#true} is VALID [2018-11-18 22:50:48,766 INFO L273 TraceCheckUtils]: 72: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-18 22:50:48,766 INFO L273 TraceCheckUtils]: 73: Hoare triple {9375#true} assume !(~i~0 < 100000); {9375#true} is VALID [2018-11-18 22:50:48,766 INFO L273 TraceCheckUtils]: 74: Hoare triple {9375#true} ~i~0 := 0; {9618#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:48,767 INFO L273 TraceCheckUtils]: 75: Hoare triple {9618#(<= main_~i~0 0)} assume true; {9618#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:48,767 INFO L273 TraceCheckUtils]: 76: Hoare triple {9618#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9618#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:48,767 INFO L273 TraceCheckUtils]: 77: Hoare triple {9618#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9628#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:48,768 INFO L273 TraceCheckUtils]: 78: Hoare triple {9628#(<= main_~i~0 1)} assume true; {9628#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:48,768 INFO L273 TraceCheckUtils]: 79: Hoare triple {9628#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9628#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:48,768 INFO L273 TraceCheckUtils]: 80: Hoare triple {9628#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9638#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:48,769 INFO L273 TraceCheckUtils]: 81: Hoare triple {9638#(<= main_~i~0 2)} assume true; {9638#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:48,769 INFO L273 TraceCheckUtils]: 82: Hoare triple {9638#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9638#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:48,770 INFO L273 TraceCheckUtils]: 83: Hoare triple {9638#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9648#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:48,770 INFO L273 TraceCheckUtils]: 84: Hoare triple {9648#(<= main_~i~0 3)} assume true; {9648#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:48,771 INFO L273 TraceCheckUtils]: 85: Hoare triple {9648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9648#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:48,772 INFO L273 TraceCheckUtils]: 86: Hoare triple {9648#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9658#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:48,772 INFO L273 TraceCheckUtils]: 87: Hoare triple {9658#(<= main_~i~0 4)} assume true; {9658#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:48,773 INFO L273 TraceCheckUtils]: 88: Hoare triple {9658#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9658#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:48,773 INFO L273 TraceCheckUtils]: 89: Hoare triple {9658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9668#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:48,774 INFO L273 TraceCheckUtils]: 90: Hoare triple {9668#(<= main_~i~0 5)} assume true; {9668#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:48,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {9668#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9668#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:48,775 INFO L273 TraceCheckUtils]: 92: Hoare triple {9668#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:48,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {9678#(<= main_~i~0 6)} assume true; {9678#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:48,776 INFO L273 TraceCheckUtils]: 94: Hoare triple {9678#(<= main_~i~0 6)} assume !(~i~0 < 100000); {9376#false} is VALID [2018-11-18 22:50:48,777 INFO L273 TraceCheckUtils]: 95: Hoare triple {9376#false} havoc ~x~0;~x~0 := 0; {9376#false} is VALID [2018-11-18 22:50:48,777 INFO L273 TraceCheckUtils]: 96: Hoare triple {9376#false} assume true; {9376#false} is VALID [2018-11-18 22:50:48,777 INFO L273 TraceCheckUtils]: 97: Hoare triple {9376#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9376#false} is VALID [2018-11-18 22:50:48,777 INFO L256 TraceCheckUtils]: 98: Hoare triple {9376#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {9376#false} is VALID [2018-11-18 22:50:48,777 INFO L273 TraceCheckUtils]: 99: Hoare triple {9376#false} ~cond := #in~cond; {9376#false} is VALID [2018-11-18 22:50:48,778 INFO L273 TraceCheckUtils]: 100: Hoare triple {9376#false} assume 0 == ~cond; {9376#false} is VALID [2018-11-18 22:50:48,778 INFO L273 TraceCheckUtils]: 101: Hoare triple {9376#false} assume !false; {9376#false} is VALID [2018-11-18 22:50:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2018-11-18 22:50:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-11-18 22:50:48,804 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-18 22:50:48,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:48,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:50:48,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:48,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:50:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:50:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:50:48,897 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 25 states. [2018-11-18 22:50:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:49,632 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-11-18 22:50:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:50:49,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-18 22:50:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:50:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 147 transitions. [2018-11-18 22:50:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:50:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 147 transitions. [2018-11-18 22:50:49,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 147 transitions. [2018-11-18 22:50:49,775 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:50:49,778 INFO L225 Difference]: With dead ends: 173 [2018-11-18 22:50:49,778 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 22:50:49,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:50:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 22:50:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-11-18 22:50:49,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:49,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 116 states. [2018-11-18 22:50:49,811 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 116 states. [2018-11-18 22:50:49,811 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 116 states. [2018-11-18 22:50:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:49,814 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-18 22:50:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-18 22:50:49,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:49,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:49,815 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 119 states. [2018-11-18 22:50:49,815 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 119 states. [2018-11-18 22:50:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:49,817 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-11-18 22:50:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-18 22:50:49,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:49,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:49,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:49,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 22:50:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-11-18 22:50:49,820 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 102 [2018-11-18 22:50:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:49,820 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-11-18 22:50:49,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:50:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-18 22:50:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 22:50:49,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:49,822 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:49,822 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:49,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1323307199, now seen corresponding path program 16 times [2018-11-18 22:50:49,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:49,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:49,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:50,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {10329#true} call ULTIMATE.init(); {10329#true} is VALID [2018-11-18 22:50:50,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {10329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10329#true} is VALID [2018-11-18 22:50:50,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {10329#true} assume true; {10329#true} is VALID [2018-11-18 22:50:50,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10329#true} {10329#true} #81#return; {10329#true} is VALID [2018-11-18 22:50:50,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {10329#true} call #t~ret9 := main(); {10329#true} is VALID [2018-11-18 22:50:50,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {10329#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10331#(= main_~a~0 0)} is VALID [2018-11-18 22:50:50,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {10331#(= main_~a~0 0)} assume true; {10331#(= main_~a~0 0)} is VALID [2018-11-18 22:50:50,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {10331#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10331#(= main_~a~0 0)} is VALID [2018-11-18 22:50:50,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {10331#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {10332#(<= main_~a~0 1)} assume true; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {10332#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {10332#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {10333#(<= main_~a~0 2)} assume true; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {10333#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {10333#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {10334#(<= main_~a~0 3)} assume true; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {10334#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {10334#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {10335#(<= main_~a~0 4)} assume true; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {10335#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {10335#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {10336#(<= main_~a~0 5)} assume true; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {10336#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {10336#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#(<= main_~a~0 6)} assume true; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {10338#(<= main_~a~0 7)} assume true; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {10338#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {10338#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {10339#(<= main_~a~0 8)} assume true; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {10339#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {10339#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {10340#(<= main_~a~0 9)} assume true; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {10340#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {10340#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:50,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {10341#(<= main_~a~0 10)} assume true; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:50,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {10341#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:50,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {10341#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:50,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {10342#(<= main_~a~0 11)} assume true; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:50,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {10342#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:50,670 INFO L273 TraceCheckUtils]: 41: Hoare triple {10342#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:50,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {10343#(<= main_~a~0 12)} assume true; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:50,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {10343#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:50,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {10343#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:50,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {10344#(<= main_~a~0 13)} assume true; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:50,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {10344#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:50,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {10344#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:50,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {10345#(<= main_~a~0 14)} assume true; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:50,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {10345#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:50,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {10345#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:50,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {10346#(<= main_~a~0 15)} assume true; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:50,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {10346#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:50,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {10346#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10347#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:50,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {10347#(<= main_~a~0 16)} assume true; {10347#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:50,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {10347#(<= main_~a~0 16)} assume !(~a~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:50,679 INFO L273 TraceCheckUtils]: 56: Hoare triple {10330#false} havoc ~i~0;~i~0 := 0; {10330#false} is VALID [2018-11-18 22:50:50,679 INFO L273 TraceCheckUtils]: 57: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,680 INFO L273 TraceCheckUtils]: 59: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,680 INFO L273 TraceCheckUtils]: 60: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,680 INFO L273 TraceCheckUtils]: 63: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,681 INFO L273 TraceCheckUtils]: 65: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,681 INFO L273 TraceCheckUtils]: 66: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,681 INFO L273 TraceCheckUtils]: 67: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,681 INFO L273 TraceCheckUtils]: 68: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 69: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 70: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 71: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 72: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 73: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,682 INFO L273 TraceCheckUtils]: 74: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 75: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 76: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 77: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 78: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 79: Hoare triple {10330#false} assume !(~i~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 80: Hoare triple {10330#false} ~i~0 := 0; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 81: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,683 INFO L273 TraceCheckUtils]: 82: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 83: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 84: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 85: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 86: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 87: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 88: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 89: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 90: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,684 INFO L273 TraceCheckUtils]: 91: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 92: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 93: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 94: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 96: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 97: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 98: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 99: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,685 INFO L273 TraceCheckUtils]: 100: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 101: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 102: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 103: Hoare triple {10330#false} assume !(~i~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 104: Hoare triple {10330#false} havoc ~x~0;~x~0 := 0; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 105: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 106: Hoare triple {10330#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L256 TraceCheckUtils]: 107: Hoare triple {10330#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 108: Hoare triple {10330#false} ~cond := #in~cond; {10330#false} is VALID [2018-11-18 22:50:50,686 INFO L273 TraceCheckUtils]: 109: Hoare triple {10330#false} assume 0 == ~cond; {10330#false} is VALID [2018-11-18 22:50:50,687 INFO L273 TraceCheckUtils]: 110: Hoare triple {10330#false} assume !false; {10330#false} is VALID [2018-11-18 22:50:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 22:50:50,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:50,693 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:50:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:50:50,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:50:50,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:50,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:50,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {10329#true} call ULTIMATE.init(); {10329#true} is VALID [2018-11-18 22:50:50,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {10329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10329#true} is VALID [2018-11-18 22:50:50,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {10329#true} assume true; {10329#true} is VALID [2018-11-18 22:50:50,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10329#true} {10329#true} #81#return; {10329#true} is VALID [2018-11-18 22:50:50,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {10329#true} call #t~ret9 := main(); {10329#true} is VALID [2018-11-18 22:50:50,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {10329#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10366#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:50,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {10366#(<= main_~a~0 0)} assume true; {10366#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:50,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {10366#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10366#(<= main_~a~0 0)} is VALID [2018-11-18 22:50:50,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {10366#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {10332#(<= main_~a~0 1)} assume true; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {10332#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10332#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:50,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {10332#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {10333#(<= main_~a~0 2)} assume true; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {10333#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10333#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:50,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {10333#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {10334#(<= main_~a~0 3)} assume true; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {10334#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10334#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:50,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {10334#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {10335#(<= main_~a~0 4)} assume true; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {10335#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10335#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:50,990 INFO L273 TraceCheckUtils]: 20: Hoare triple {10335#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {10336#(<= main_~a~0 5)} assume true; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {10336#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10336#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:50,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {10336#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#(<= main_~a~0 6)} assume true; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10337#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:50,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {10338#(<= main_~a~0 7)} assume true; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {10338#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10338#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:50,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {10338#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {10339#(<= main_~a~0 8)} assume true; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {10339#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10339#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:50,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {10339#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {10340#(<= main_~a~0 9)} assume true; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {10340#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10340#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:50,999 INFO L273 TraceCheckUtils]: 35: Hoare triple {10340#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:51,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {10341#(<= main_~a~0 10)} assume true; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:51,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {10341#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10341#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:51,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {10341#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:51,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {10342#(<= main_~a~0 11)} assume true; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:51,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {10342#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10342#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:51,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {10342#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:51,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {10343#(<= main_~a~0 12)} assume true; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:51,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {10343#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10343#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:51,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {10343#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:51,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {10344#(<= main_~a~0 13)} assume true; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:51,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {10344#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10344#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:51,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {10344#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:51,007 INFO L273 TraceCheckUtils]: 48: Hoare triple {10345#(<= main_~a~0 14)} assume true; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:51,008 INFO L273 TraceCheckUtils]: 49: Hoare triple {10345#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10345#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:51,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {10345#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:51,009 INFO L273 TraceCheckUtils]: 51: Hoare triple {10346#(<= main_~a~0 15)} assume true; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:51,009 INFO L273 TraceCheckUtils]: 52: Hoare triple {10346#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10346#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:51,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {10346#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10347#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:51,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {10347#(<= main_~a~0 16)} assume true; {10347#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:51,011 INFO L273 TraceCheckUtils]: 55: Hoare triple {10347#(<= main_~a~0 16)} assume !(~a~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:51,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {10330#false} havoc ~i~0;~i~0 := 0; {10330#false} is VALID [2018-11-18 22:50:51,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,012 INFO L273 TraceCheckUtils]: 58: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,012 INFO L273 TraceCheckUtils]: 59: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,013 INFO L273 TraceCheckUtils]: 64: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,013 INFO L273 TraceCheckUtils]: 65: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,014 INFO L273 TraceCheckUtils]: 67: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,014 INFO L273 TraceCheckUtils]: 68: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 73: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 74: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 75: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,015 INFO L273 TraceCheckUtils]: 76: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 77: Hoare triple {10330#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 78: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 79: Hoare triple {10330#false} assume !(~i~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 80: Hoare triple {10330#false} ~i~0 := 0; {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 81: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,016 INFO L273 TraceCheckUtils]: 82: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 83: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 84: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 87: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 88: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 90: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,017 INFO L273 TraceCheckUtils]: 91: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 92: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 94: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 95: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 96: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 97: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 98: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,018 INFO L273 TraceCheckUtils]: 100: Hoare triple {10330#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {10330#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 102: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 103: Hoare triple {10330#false} assume !(~i~0 < 100000); {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 104: Hoare triple {10330#false} havoc ~x~0;~x~0 := 0; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 105: Hoare triple {10330#false} assume true; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 106: Hoare triple {10330#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L256 TraceCheckUtils]: 107: Hoare triple {10330#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 108: Hoare triple {10330#false} ~cond := #in~cond; {10330#false} is VALID [2018-11-18 22:50:51,019 INFO L273 TraceCheckUtils]: 109: Hoare triple {10330#false} assume 0 == ~cond; {10330#false} is VALID [2018-11-18 22:50:51,020 INFO L273 TraceCheckUtils]: 110: Hoare triple {10330#false} assume !false; {10330#false} is VALID [2018-11-18 22:50:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 22:50:51,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:50:51,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-11-18 22:50:51,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:51,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:50:51,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:51,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:50:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:50:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:50:51,115 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 20 states. [2018-11-18 22:50:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:51,598 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-11-18 22:50:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:50:51,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-11-18 22:50:51,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:50:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 106 transitions. [2018-11-18 22:50:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:50:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 106 transitions. [2018-11-18 22:50:51,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 106 transitions. [2018-11-18 22:50:51,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:51,703 INFO L225 Difference]: With dead ends: 180 [2018-11-18 22:50:51,704 INFO L226 Difference]: Without dead ends: 120 [2018-11-18 22:50:51,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:50:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-18 22:50:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-18 22:50:51,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:51,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 119 states. [2018-11-18 22:50:51,734 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 119 states. [2018-11-18 22:50:51,735 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 119 states. [2018-11-18 22:50:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:51,738 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-11-18 22:50:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-18 22:50:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:51,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:51,739 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 120 states. [2018-11-18 22:50:51,739 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 120 states. [2018-11-18 22:50:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:51,741 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-11-18 22:50:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-18 22:50:51,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:51,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:51,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:51,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 22:50:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-11-18 22:50:51,744 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 111 [2018-11-18 22:50:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:51,745 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-11-18 22:50:51,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:50:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-18 22:50:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:50:51,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:51,746 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:51,746 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:51,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1010521662, now seen corresponding path program 17 times [2018-11-18 22:50:51,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:51,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:52,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {11321#true} call ULTIMATE.init(); {11321#true} is VALID [2018-11-18 22:50:52,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {11321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11321#true} is VALID [2018-11-18 22:50:52,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:50:52,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11321#true} {11321#true} #81#return; {11321#true} is VALID [2018-11-18 22:50:52,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {11321#true} call #t~ret9 := main(); {11321#true} is VALID [2018-11-18 22:50:52,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {11321#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11323#(= main_~a~0 0)} is VALID [2018-11-18 22:50:52,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {11323#(= main_~a~0 0)} assume true; {11323#(= main_~a~0 0)} is VALID [2018-11-18 22:50:52,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {11323#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11323#(= main_~a~0 0)} is VALID [2018-11-18 22:50:52,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {11323#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11324#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:52,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {11324#(<= main_~a~0 1)} assume true; {11324#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:52,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {11324#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11324#(<= main_~a~0 1)} is VALID [2018-11-18 22:50:52,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {11324#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11325#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:52,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {11325#(<= main_~a~0 2)} assume true; {11325#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:52,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {11325#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11325#(<= main_~a~0 2)} is VALID [2018-11-18 22:50:52,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {11325#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11326#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:52,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {11326#(<= main_~a~0 3)} assume true; {11326#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:52,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {11326#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11326#(<= main_~a~0 3)} is VALID [2018-11-18 22:50:52,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {11326#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11327#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:52,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {11327#(<= main_~a~0 4)} assume true; {11327#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:52,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {11327#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11327#(<= main_~a~0 4)} is VALID [2018-11-18 22:50:52,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {11327#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11328#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:52,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {11328#(<= main_~a~0 5)} assume true; {11328#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:52,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {11328#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11328#(<= main_~a~0 5)} is VALID [2018-11-18 22:50:52,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {11328#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11329#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:52,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {11329#(<= main_~a~0 6)} assume true; {11329#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:52,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {11329#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11329#(<= main_~a~0 6)} is VALID [2018-11-18 22:50:52,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {11329#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11330#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:52,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {11330#(<= main_~a~0 7)} assume true; {11330#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:52,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {11330#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11330#(<= main_~a~0 7)} is VALID [2018-11-18 22:50:52,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {11330#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11331#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:52,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {11331#(<= main_~a~0 8)} assume true; {11331#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:52,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {11331#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11331#(<= main_~a~0 8)} is VALID [2018-11-18 22:50:52,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {11331#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11332#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:52,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {11332#(<= main_~a~0 9)} assume true; {11332#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:52,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {11332#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11332#(<= main_~a~0 9)} is VALID [2018-11-18 22:50:52,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {11332#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11333#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:52,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {11333#(<= main_~a~0 10)} assume true; {11333#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:52,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {11333#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11333#(<= main_~a~0 10)} is VALID [2018-11-18 22:50:52,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {11333#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11334#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:52,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {11334#(<= main_~a~0 11)} assume true; {11334#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:52,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {11334#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11334#(<= main_~a~0 11)} is VALID [2018-11-18 22:50:52,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {11334#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11335#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:52,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {11335#(<= main_~a~0 12)} assume true; {11335#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:52,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {11335#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11335#(<= main_~a~0 12)} is VALID [2018-11-18 22:50:52,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {11335#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11336#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:52,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {11336#(<= main_~a~0 13)} assume true; {11336#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:52,310 INFO L273 TraceCheckUtils]: 46: Hoare triple {11336#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11336#(<= main_~a~0 13)} is VALID [2018-11-18 22:50:52,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {11336#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11337#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:52,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {11337#(<= main_~a~0 14)} assume true; {11337#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:52,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {11337#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11337#(<= main_~a~0 14)} is VALID [2018-11-18 22:50:52,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {11337#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11338#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:52,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {11338#(<= main_~a~0 15)} assume true; {11338#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:52,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {11338#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11338#(<= main_~a~0 15)} is VALID [2018-11-18 22:50:52,314 INFO L273 TraceCheckUtils]: 53: Hoare triple {11338#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11339#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:52,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {11339#(<= main_~a~0 16)} assume true; {11339#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:52,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {11339#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11339#(<= main_~a~0 16)} is VALID [2018-11-18 22:50:52,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {11339#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11340#(<= main_~a~0 17)} is VALID [2018-11-18 22:50:52,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {11340#(<= main_~a~0 17)} assume true; {11340#(<= main_~a~0 17)} is VALID [2018-11-18 22:50:52,317 INFO L273 TraceCheckUtils]: 58: Hoare triple {11340#(<= main_~a~0 17)} assume !(~a~0 < 100000); {11322#false} is VALID [2018-11-18 22:50:52,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {11322#false} havoc ~i~0;~i~0 := 0; {11322#false} is VALID [2018-11-18 22:50:52,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,317 INFO L273 TraceCheckUtils]: 61: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,317 INFO L273 TraceCheckUtils]: 62: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,318 INFO L273 TraceCheckUtils]: 63: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,318 INFO L273 TraceCheckUtils]: 64: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,318 INFO L273 TraceCheckUtils]: 66: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,318 INFO L273 TraceCheckUtils]: 67: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,319 INFO L273 TraceCheckUtils]: 68: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 73: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 78: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 79: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11322#false} is VALID [2018-11-18 22:50:52,320 INFO L273 TraceCheckUtils]: 80: Hoare triple {11322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 81: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 82: Hoare triple {11322#false} assume !(~i~0 < 100000); {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 83: Hoare triple {11322#false} ~i~0 := 0; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 91: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 92: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 95: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 96: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 97: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,322 INFO L273 TraceCheckUtils]: 98: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 99: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 100: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 101: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 102: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 103: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 104: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 105: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 106: Hoare triple {11322#false} assume !(~i~0 < 100000); {11322#false} is VALID [2018-11-18 22:50:52,323 INFO L273 TraceCheckUtils]: 107: Hoare triple {11322#false} havoc ~x~0;~x~0 := 0; {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L273 TraceCheckUtils]: 108: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L273 TraceCheckUtils]: 109: Hoare triple {11322#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L256 TraceCheckUtils]: 110: Hoare triple {11322#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L273 TraceCheckUtils]: 111: Hoare triple {11322#false} ~cond := #in~cond; {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L273 TraceCheckUtils]: 112: Hoare triple {11322#false} assume 0 == ~cond; {11322#false} is VALID [2018-11-18 22:50:52,324 INFO L273 TraceCheckUtils]: 113: Hoare triple {11322#false} assume !false; {11322#false} is VALID [2018-11-18 22:50:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 22:50:52,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:52,331 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:50:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:51:06,622 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:51:06,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:06,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:07,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {11321#true} call ULTIMATE.init(); {11321#true} is VALID [2018-11-18 22:51:07,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {11321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11321#true} is VALID [2018-11-18 22:51:07,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11321#true} {11321#true} #81#return; {11321#true} is VALID [2018-11-18 22:51:07,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {11321#true} call #t~ret9 := main(); {11321#true} is VALID [2018-11-18 22:51:07,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {11321#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11321#true} is VALID [2018-11-18 22:51:07,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 48: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 49: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 54: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 55: Hoare triple {11321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 56: Hoare triple {11321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {11321#true} assume true; {11321#true} is VALID [2018-11-18 22:51:07,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {11321#true} assume !(~a~0 < 100000); {11321#true} is VALID [2018-11-18 22:51:07,014 INFO L273 TraceCheckUtils]: 59: Hoare triple {11321#true} havoc ~i~0;~i~0 := 0; {11521#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:07,014 INFO L273 TraceCheckUtils]: 60: Hoare triple {11521#(<= main_~i~0 0)} assume true; {11521#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:07,014 INFO L273 TraceCheckUtils]: 61: Hoare triple {11521#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11521#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:07,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {11521#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11531#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:07,016 INFO L273 TraceCheckUtils]: 63: Hoare triple {11531#(<= main_~i~0 1)} assume true; {11531#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:07,016 INFO L273 TraceCheckUtils]: 64: Hoare triple {11531#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11531#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:07,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {11531#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11541#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:07,017 INFO L273 TraceCheckUtils]: 66: Hoare triple {11541#(<= main_~i~0 2)} assume true; {11541#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:07,017 INFO L273 TraceCheckUtils]: 67: Hoare triple {11541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11541#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:07,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {11541#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11551#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:07,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {11551#(<= main_~i~0 3)} assume true; {11551#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:07,019 INFO L273 TraceCheckUtils]: 70: Hoare triple {11551#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11551#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:07,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {11551#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11561#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:07,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {11561#(<= main_~i~0 4)} assume true; {11561#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:07,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {11561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11561#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:07,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {11561#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11571#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:07,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {11571#(<= main_~i~0 5)} assume true; {11571#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:07,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {11571#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11571#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:07,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {11571#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11581#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:07,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {11581#(<= main_~i~0 6)} assume true; {11581#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:07,024 INFO L273 TraceCheckUtils]: 79: Hoare triple {11581#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11581#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:07,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {11581#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11591#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:07,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {11591#(<= main_~i~0 7)} assume true; {11591#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:07,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {11591#(<= main_~i~0 7)} assume !(~i~0 < 100000); {11322#false} is VALID [2018-11-18 22:51:07,026 INFO L273 TraceCheckUtils]: 83: Hoare triple {11322#false} ~i~0 := 0; {11322#false} is VALID [2018-11-18 22:51:07,026 INFO L273 TraceCheckUtils]: 84: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,027 INFO L273 TraceCheckUtils]: 85: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,027 INFO L273 TraceCheckUtils]: 86: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,027 INFO L273 TraceCheckUtils]: 89: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,028 INFO L273 TraceCheckUtils]: 90: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,028 INFO L273 TraceCheckUtils]: 91: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,028 INFO L273 TraceCheckUtils]: 92: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,028 INFO L273 TraceCheckUtils]: 93: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,028 INFO L273 TraceCheckUtils]: 94: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 95: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 96: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 98: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 99: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 100: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 101: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 102: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,029 INFO L273 TraceCheckUtils]: 103: Hoare triple {11322#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 104: Hoare triple {11322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 105: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 106: Hoare triple {11322#false} assume !(~i~0 < 100000); {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 107: Hoare triple {11322#false} havoc ~x~0;~x~0 := 0; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 108: Hoare triple {11322#false} assume true; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 109: Hoare triple {11322#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L256 TraceCheckUtils]: 110: Hoare triple {11322#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 111: Hoare triple {11322#false} ~cond := #in~cond; {11322#false} is VALID [2018-11-18 22:51:07,030 INFO L273 TraceCheckUtils]: 112: Hoare triple {11322#false} assume 0 == ~cond; {11322#false} is VALID [2018-11-18 22:51:07,031 INFO L273 TraceCheckUtils]: 113: Hoare triple {11322#false} assume !false; {11322#false} is VALID [2018-11-18 22:51:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-18 22:51:07,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:07,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2018-11-18 22:51:07,059 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-18 22:51:07,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:07,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:51:07,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:07,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:51:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:51:07,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:51:07,164 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 28 states. [2018-11-18 22:51:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:08,028 INFO L93 Difference]: Finished difference Result 191 states and 199 transitions. [2018-11-18 22:51:08,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:51:08,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-18 22:51:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:51:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 159 transitions. [2018-11-18 22:51:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:51:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 159 transitions. [2018-11-18 22:51:08,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 159 transitions. [2018-11-18 22:51:08,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:08,179 INFO L225 Difference]: With dead ends: 191 [2018-11-18 22:51:08,179 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 22:51:08,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:51:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 22:51:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-11-18 22:51:08,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:08,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 128 states. [2018-11-18 22:51:08,212 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 128 states. [2018-11-18 22:51:08,212 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 128 states. [2018-11-18 22:51:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:08,215 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-11-18 22:51:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2018-11-18 22:51:08,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:08,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:08,216 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 131 states. [2018-11-18 22:51:08,216 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 131 states. [2018-11-18 22:51:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:08,218 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-11-18 22:51:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2018-11-18 22:51:08,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:08,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:08,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:08,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:51:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-11-18 22:51:08,221 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 114 [2018-11-18 22:51:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:08,222 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-11-18 22:51:08,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:51:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-11-18 22:51:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 22:51:08,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:08,223 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:08,224 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash 631821252, now seen corresponding path program 18 times [2018-11-18 22:51:08,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:08,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:08,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {12378#true} call ULTIMATE.init(); {12378#true} is VALID [2018-11-18 22:51:08,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {12378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12378#true} is VALID [2018-11-18 22:51:08,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:08,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12378#true} {12378#true} #81#return; {12378#true} is VALID [2018-11-18 22:51:08,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {12378#true} call #t~ret9 := main(); {12378#true} is VALID [2018-11-18 22:51:08,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {12378#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12380#(= main_~a~0 0)} is VALID [2018-11-18 22:51:08,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {12380#(= main_~a~0 0)} assume true; {12380#(= main_~a~0 0)} is VALID [2018-11-18 22:51:08,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {12380#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12380#(= main_~a~0 0)} is VALID [2018-11-18 22:51:08,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {12380#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12381#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:08,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {12381#(<= main_~a~0 1)} assume true; {12381#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:08,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {12381#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12381#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:08,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {12381#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12382#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:08,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {12382#(<= main_~a~0 2)} assume true; {12382#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:08,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {12382#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12382#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:08,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {12382#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12383#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:08,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {12383#(<= main_~a~0 3)} assume true; {12383#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:08,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {12383#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12383#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:08,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {12383#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12384#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:08,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {12384#(<= main_~a~0 4)} assume true; {12384#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:08,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {12384#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12384#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:08,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {12384#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12385#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:08,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {12385#(<= main_~a~0 5)} assume true; {12385#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:08,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {12385#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12385#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:08,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {12385#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12386#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:08,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {12386#(<= main_~a~0 6)} assume true; {12386#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:08,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {12386#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12386#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:08,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {12386#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12387#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:08,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {12387#(<= main_~a~0 7)} assume true; {12387#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:08,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {12387#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12387#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:08,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {12387#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12388#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:08,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {12388#(<= main_~a~0 8)} assume true; {12388#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:08,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {12388#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12388#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:08,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {12388#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12389#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:08,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {12389#(<= main_~a~0 9)} assume true; {12389#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:08,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {12389#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12389#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:08,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {12389#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12390#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:08,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {12390#(<= main_~a~0 10)} assume true; {12390#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:08,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {12390#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12390#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:08,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {12390#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12391#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:08,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {12391#(<= main_~a~0 11)} assume true; {12391#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:08,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {12391#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12391#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:08,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {12391#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12392#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:08,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {12392#(<= main_~a~0 12)} assume true; {12392#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:08,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {12392#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12392#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:08,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {12392#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12393#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:08,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {12393#(<= main_~a~0 13)} assume true; {12393#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:08,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {12393#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12393#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:08,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {12393#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12394#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:08,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {12394#(<= main_~a~0 14)} assume true; {12394#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:08,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {12394#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12394#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:08,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {12394#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12395#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:08,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {12395#(<= main_~a~0 15)} assume true; {12395#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:08,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {12395#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12395#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:08,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {12395#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12396#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:08,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {12396#(<= main_~a~0 16)} assume true; {12396#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:08,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {12396#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12396#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:08,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {12396#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12397#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:08,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {12397#(<= main_~a~0 17)} assume true; {12397#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:08,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {12397#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12397#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:08,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {12397#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12398#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:08,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {12398#(<= main_~a~0 18)} assume true; {12398#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:08,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {12398#(<= main_~a~0 18)} assume !(~a~0 < 100000); {12379#false} is VALID [2018-11-18 22:51:08,709 INFO L273 TraceCheckUtils]: 62: Hoare triple {12379#false} havoc ~i~0;~i~0 := 0; {12379#false} is VALID [2018-11-18 22:51:08,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,710 INFO L273 TraceCheckUtils]: 64: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,710 INFO L273 TraceCheckUtils]: 67: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,710 INFO L273 TraceCheckUtils]: 68: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,711 INFO L273 TraceCheckUtils]: 69: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,711 INFO L273 TraceCheckUtils]: 70: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,711 INFO L273 TraceCheckUtils]: 71: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,711 INFO L273 TraceCheckUtils]: 72: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,711 INFO L273 TraceCheckUtils]: 73: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 74: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 75: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 76: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 77: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 78: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 79: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 80: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,712 INFO L273 TraceCheckUtils]: 81: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 82: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 83: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 84: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 85: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 86: Hoare triple {12379#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 87: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 88: Hoare triple {12379#false} assume !(~i~0 < 100000); {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 89: Hoare triple {12379#false} ~i~0 := 0; {12379#false} is VALID [2018-11-18 22:51:08,713 INFO L273 TraceCheckUtils]: 90: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 91: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 92: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 93: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 94: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 95: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,714 INFO L273 TraceCheckUtils]: 96: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 97: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 98: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 99: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 100: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 101: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,715 INFO L273 TraceCheckUtils]: 102: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 103: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 104: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 105: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 108: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,716 INFO L273 TraceCheckUtils]: 109: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 110: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 111: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 112: Hoare triple {12379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 113: Hoare triple {12379#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 114: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,717 INFO L273 TraceCheckUtils]: 115: Hoare triple {12379#false} assume !(~i~0 < 100000); {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L273 TraceCheckUtils]: 116: Hoare triple {12379#false} havoc ~x~0;~x~0 := 0; {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L273 TraceCheckUtils]: 117: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L273 TraceCheckUtils]: 118: Hoare triple {12379#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L256 TraceCheckUtils]: 119: Hoare triple {12379#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L273 TraceCheckUtils]: 120: Hoare triple {12379#false} ~cond := #in~cond; {12379#false} is VALID [2018-11-18 22:51:08,718 INFO L273 TraceCheckUtils]: 121: Hoare triple {12379#false} assume 0 == ~cond; {12379#false} is VALID [2018-11-18 22:51:08,719 INFO L273 TraceCheckUtils]: 122: Hoare triple {12379#false} assume !false; {12379#false} is VALID [2018-11-18 22:51:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 22:51:08,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:08,729 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:51:08,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:51:16,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-18 22:51:16,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:16,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:16,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {12378#true} call ULTIMATE.init(); {12378#true} is VALID [2018-11-18 22:51:16,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {12378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12378#true} is VALID [2018-11-18 22:51:16,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12378#true} {12378#true} #81#return; {12378#true} is VALID [2018-11-18 22:51:16,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {12378#true} call #t~ret9 := main(); {12378#true} is VALID [2018-11-18 22:51:16,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {12378#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12378#true} is VALID [2018-11-18 22:51:16,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 28: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 29: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 42: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 45: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 48: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 49: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 50: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 51: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 52: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 58: Hoare triple {12378#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 59: Hoare triple {12378#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 60: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 61: Hoare triple {12378#true} assume !(~a~0 < 100000); {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 62: Hoare triple {12378#true} havoc ~i~0;~i~0 := 0; {12378#true} is VALID [2018-11-18 22:51:16,359 INFO L273 TraceCheckUtils]: 63: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,360 INFO L273 TraceCheckUtils]: 65: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,360 INFO L273 TraceCheckUtils]: 66: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,360 INFO L273 TraceCheckUtils]: 67: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,360 INFO L273 TraceCheckUtils]: 68: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 69: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 70: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 71: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 72: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 73: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,361 INFO L273 TraceCheckUtils]: 74: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 75: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 76: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 77: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 78: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 79: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 80: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 81: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 82: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,362 INFO L273 TraceCheckUtils]: 83: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,363 INFO L273 TraceCheckUtils]: 84: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,363 INFO L273 TraceCheckUtils]: 85: Hoare triple {12378#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12378#true} is VALID [2018-11-18 22:51:16,363 INFO L273 TraceCheckUtils]: 86: Hoare triple {12378#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12378#true} is VALID [2018-11-18 22:51:16,363 INFO L273 TraceCheckUtils]: 87: Hoare triple {12378#true} assume true; {12378#true} is VALID [2018-11-18 22:51:16,363 INFO L273 TraceCheckUtils]: 88: Hoare triple {12378#true} assume !(~i~0 < 100000); {12378#true} is VALID [2018-11-18 22:51:16,364 INFO L273 TraceCheckUtils]: 89: Hoare triple {12378#true} ~i~0 := 0; {12669#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:16,364 INFO L273 TraceCheckUtils]: 90: Hoare triple {12669#(<= main_~i~0 0)} assume true; {12669#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:16,364 INFO L273 TraceCheckUtils]: 91: Hoare triple {12669#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12669#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:16,365 INFO L273 TraceCheckUtils]: 92: Hoare triple {12669#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12679#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:16,365 INFO L273 TraceCheckUtils]: 93: Hoare triple {12679#(<= main_~i~0 1)} assume true; {12679#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:16,365 INFO L273 TraceCheckUtils]: 94: Hoare triple {12679#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12679#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:16,366 INFO L273 TraceCheckUtils]: 95: Hoare triple {12679#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12689#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:16,366 INFO L273 TraceCheckUtils]: 96: Hoare triple {12689#(<= main_~i~0 2)} assume true; {12689#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:16,367 INFO L273 TraceCheckUtils]: 97: Hoare triple {12689#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12689#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:16,367 INFO L273 TraceCheckUtils]: 98: Hoare triple {12689#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12699#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:16,368 INFO L273 TraceCheckUtils]: 99: Hoare triple {12699#(<= main_~i~0 3)} assume true; {12699#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:16,368 INFO L273 TraceCheckUtils]: 100: Hoare triple {12699#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12699#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:16,369 INFO L273 TraceCheckUtils]: 101: Hoare triple {12699#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12709#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:16,370 INFO L273 TraceCheckUtils]: 102: Hoare triple {12709#(<= main_~i~0 4)} assume true; {12709#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:16,370 INFO L273 TraceCheckUtils]: 103: Hoare triple {12709#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12709#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:16,371 INFO L273 TraceCheckUtils]: 104: Hoare triple {12709#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12719#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:16,372 INFO L273 TraceCheckUtils]: 105: Hoare triple {12719#(<= main_~i~0 5)} assume true; {12719#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:16,372 INFO L273 TraceCheckUtils]: 106: Hoare triple {12719#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12719#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:16,373 INFO L273 TraceCheckUtils]: 107: Hoare triple {12719#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12729#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:16,373 INFO L273 TraceCheckUtils]: 108: Hoare triple {12729#(<= main_~i~0 6)} assume true; {12729#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:16,374 INFO L273 TraceCheckUtils]: 109: Hoare triple {12729#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12729#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:16,375 INFO L273 TraceCheckUtils]: 110: Hoare triple {12729#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12739#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:16,375 INFO L273 TraceCheckUtils]: 111: Hoare triple {12739#(<= main_~i~0 7)} assume true; {12739#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:16,376 INFO L273 TraceCheckUtils]: 112: Hoare triple {12739#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12739#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:16,376 INFO L273 TraceCheckUtils]: 113: Hoare triple {12739#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:16,377 INFO L273 TraceCheckUtils]: 114: Hoare triple {12749#(<= main_~i~0 8)} assume true; {12749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:16,377 INFO L273 TraceCheckUtils]: 115: Hoare triple {12749#(<= main_~i~0 8)} assume !(~i~0 < 100000); {12379#false} is VALID [2018-11-18 22:51:16,378 INFO L273 TraceCheckUtils]: 116: Hoare triple {12379#false} havoc ~x~0;~x~0 := 0; {12379#false} is VALID [2018-11-18 22:51:16,378 INFO L273 TraceCheckUtils]: 117: Hoare triple {12379#false} assume true; {12379#false} is VALID [2018-11-18 22:51:16,378 INFO L273 TraceCheckUtils]: 118: Hoare triple {12379#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {12379#false} is VALID [2018-11-18 22:51:16,378 INFO L256 TraceCheckUtils]: 119: Hoare triple {12379#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {12379#false} is VALID [2018-11-18 22:51:16,379 INFO L273 TraceCheckUtils]: 120: Hoare triple {12379#false} ~cond := #in~cond; {12379#false} is VALID [2018-11-18 22:51:16,379 INFO L273 TraceCheckUtils]: 121: Hoare triple {12379#false} assume 0 == ~cond; {12379#false} is VALID [2018-11-18 22:51:16,379 INFO L273 TraceCheckUtils]: 122: Hoare triple {12379#false} assume !false; {12379#false} is VALID [2018-11-18 22:51:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-11-18 22:51:16,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:16,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2018-11-18 22:51:16,408 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 123 [2018-11-18 22:51:16,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:16,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:51:16,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:16,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:51:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:51:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:51:16,543 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 30 states. [2018-11-18 22:51:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:17,796 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2018-11-18 22:51:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:51:17,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 123 [2018-11-18 22:51:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:51:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 168 transitions. [2018-11-18 22:51:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:51:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 168 transitions. [2018-11-18 22:51:17,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 168 transitions. [2018-11-18 22:51:17,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:17,991 INFO L225 Difference]: With dead ends: 206 [2018-11-18 22:51:17,992 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 22:51:17,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:51:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 22:51:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-11-18 22:51:18,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:18,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 137 states. [2018-11-18 22:51:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 137 states. [2018-11-18 22:51:18,044 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 137 states. [2018-11-18 22:51:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:18,046 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-11-18 22:51:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-11-18 22:51:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:18,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:18,047 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 140 states. [2018-11-18 22:51:18,047 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 140 states. [2018-11-18 22:51:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:18,049 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-11-18 22:51:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-11-18 22:51:18,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:18,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:18,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:18,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 22:51:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-11-18 22:51:18,051 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 123 [2018-11-18 22:51:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:18,051 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-11-18 22:51:18,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:51:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-11-18 22:51:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 22:51:18,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:18,052 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:18,052 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:18,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash -402385666, now seen corresponding path program 19 times [2018-11-18 22:51:18,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:18,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:18,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:18,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {13514#true} call ULTIMATE.init(); {13514#true} is VALID [2018-11-18 22:51:18,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {13514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13514#true} is VALID [2018-11-18 22:51:18,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {13514#true} assume true; {13514#true} is VALID [2018-11-18 22:51:18,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13514#true} {13514#true} #81#return; {13514#true} is VALID [2018-11-18 22:51:18,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {13514#true} call #t~ret9 := main(); {13514#true} is VALID [2018-11-18 22:51:18,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {13514#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13516#(= main_~a~0 0)} is VALID [2018-11-18 22:51:18,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {13516#(= main_~a~0 0)} assume true; {13516#(= main_~a~0 0)} is VALID [2018-11-18 22:51:18,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {13516#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13516#(= main_~a~0 0)} is VALID [2018-11-18 22:51:18,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {13516#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {13517#(<= main_~a~0 1)} assume true; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {13517#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {13517#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {13518#(<= main_~a~0 2)} assume true; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {13518#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {13518#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {13519#(<= main_~a~0 3)} assume true; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {13519#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {13519#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {13520#(<= main_~a~0 4)} assume true; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {13520#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {13520#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {13521#(<= main_~a~0 5)} assume true; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {13521#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {13521#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {13522#(<= main_~a~0 6)} assume true; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {13522#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {13522#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {13523#(<= main_~a~0 7)} assume true; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {13523#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {13523#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {13524#(<= main_~a~0 8)} assume true; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {13524#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {13525#(<= main_~a~0 9)} assume true; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~a~0 10)} assume true; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {13526#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~a~0 11)} assume true; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {13527#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {13527#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,455 INFO L273 TraceCheckUtils]: 42: Hoare triple {13528#(<= main_~a~0 12)} assume true; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {13528#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {13528#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {13529#(<= main_~a~0 13)} assume true; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {13529#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,458 INFO L273 TraceCheckUtils]: 47: Hoare triple {13529#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {13530#(<= main_~a~0 14)} assume true; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,459 INFO L273 TraceCheckUtils]: 49: Hoare triple {13530#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {13530#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,460 INFO L273 TraceCheckUtils]: 51: Hoare triple {13531#(<= main_~a~0 15)} assume true; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {13531#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {13531#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,462 INFO L273 TraceCheckUtils]: 54: Hoare triple {13532#(<= main_~a~0 16)} assume true; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {13532#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,463 INFO L273 TraceCheckUtils]: 56: Hoare triple {13532#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,464 INFO L273 TraceCheckUtils]: 57: Hoare triple {13533#(<= main_~a~0 17)} assume true; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {13533#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {13533#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {13534#(<= main_~a~0 18)} assume true; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {13534#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {13534#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13535#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:18,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {13535#(<= main_~a~0 19)} assume true; {13535#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:18,468 INFO L273 TraceCheckUtils]: 64: Hoare triple {13535#(<= main_~a~0 19)} assume !(~a~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {13515#false} havoc ~i~0;~i~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,469 INFO L273 TraceCheckUtils]: 67: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,469 INFO L273 TraceCheckUtils]: 68: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,469 INFO L273 TraceCheckUtils]: 69: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,470 INFO L273 TraceCheckUtils]: 70: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,470 INFO L273 TraceCheckUtils]: 71: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,470 INFO L273 TraceCheckUtils]: 73: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,471 INFO L273 TraceCheckUtils]: 75: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,471 INFO L273 TraceCheckUtils]: 78: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,471 INFO L273 TraceCheckUtils]: 79: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 80: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 81: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 82: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 83: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 84: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 85: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 86: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,472 INFO L273 TraceCheckUtils]: 87: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 88: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 89: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 90: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 91: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 94: Hoare triple {13515#false} assume !(~i~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,473 INFO L273 TraceCheckUtils]: 95: Hoare triple {13515#false} ~i~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 96: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 97: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 98: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 99: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 100: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 101: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 102: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 103: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,474 INFO L273 TraceCheckUtils]: 104: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 105: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 106: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 107: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 108: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 109: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 110: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 111: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 112: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,475 INFO L273 TraceCheckUtils]: 113: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 114: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 115: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 116: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 117: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 118: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 119: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 120: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 121: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,476 INFO L273 TraceCheckUtils]: 122: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 123: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 124: Hoare triple {13515#false} assume !(~i~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 125: Hoare triple {13515#false} havoc ~x~0;~x~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 126: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 127: Hoare triple {13515#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L256 TraceCheckUtils]: 128: Hoare triple {13515#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 129: Hoare triple {13515#false} ~cond := #in~cond; {13515#false} is VALID [2018-11-18 22:51:18,477 INFO L273 TraceCheckUtils]: 130: Hoare triple {13515#false} assume 0 == ~cond; {13515#false} is VALID [2018-11-18 22:51:18,478 INFO L273 TraceCheckUtils]: 131: Hoare triple {13515#false} assume !false; {13515#false} is VALID [2018-11-18 22:51:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:51:18,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:18,486 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:51:18,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:51:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:18,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:18,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {13514#true} call ULTIMATE.init(); {13514#true} is VALID [2018-11-18 22:51:18,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {13514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13514#true} is VALID [2018-11-18 22:51:18,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {13514#true} assume true; {13514#true} is VALID [2018-11-18 22:51:18,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13514#true} {13514#true} #81#return; {13514#true} is VALID [2018-11-18 22:51:18,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {13514#true} call #t~ret9 := main(); {13514#true} is VALID [2018-11-18 22:51:18,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {13514#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13554#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:18,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {13554#(<= main_~a~0 0)} assume true; {13554#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:18,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {13554#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13554#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:18,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {13554#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {13517#(<= main_~a~0 1)} assume true; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {13517#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13517#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:18,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {13517#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {13518#(<= main_~a~0 2)} assume true; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {13518#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13518#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:18,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {13518#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {13519#(<= main_~a~0 3)} assume true; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {13519#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13519#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:18,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {13519#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {13520#(<= main_~a~0 4)} assume true; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {13520#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13520#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:18,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {13520#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {13521#(<= main_~a~0 5)} assume true; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {13521#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13521#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:18,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {13521#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {13522#(<= main_~a~0 6)} assume true; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {13522#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13522#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:18,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {13522#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {13523#(<= main_~a~0 7)} assume true; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {13523#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13523#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:18,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {13523#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {13524#(<= main_~a~0 8)} assume true; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {13524#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13524#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:18,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {13525#(<= main_~a~0 9)} assume true; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13525#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:18,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~a~0 10)} assume true; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13526#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:18,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {13526#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~a~0 11)} assume true; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {13527#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13527#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:18,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {13527#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {13528#(<= main_~a~0 12)} assume true; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {13528#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13528#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:18,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {13528#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {13529#(<= main_~a~0 13)} assume true; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {13529#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13529#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:18,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {13529#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {13530#(<= main_~a~0 14)} assume true; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,791 INFO L273 TraceCheckUtils]: 49: Hoare triple {13530#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13530#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:18,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {13530#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {13531#(<= main_~a~0 15)} assume true; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {13531#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13531#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:18,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {13531#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,794 INFO L273 TraceCheckUtils]: 54: Hoare triple {13532#(<= main_~a~0 16)} assume true; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {13532#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13532#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:18,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {13532#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {13533#(<= main_~a~0 17)} assume true; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {13533#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13533#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:18,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {13533#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {13534#(<= main_~a~0 18)} assume true; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {13534#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13534#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:18,799 INFO L273 TraceCheckUtils]: 62: Hoare triple {13534#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13535#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:18,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {13535#(<= main_~a~0 19)} assume true; {13535#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:18,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {13535#(<= main_~a~0 19)} assume !(~a~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {13515#false} havoc ~i~0;~i~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,802 INFO L273 TraceCheckUtils]: 72: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,802 INFO L273 TraceCheckUtils]: 73: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,802 INFO L273 TraceCheckUtils]: 74: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,802 INFO L273 TraceCheckUtils]: 75: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,802 INFO L273 TraceCheckUtils]: 76: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 77: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 78: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 79: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 80: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 81: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 82: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 83: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 84: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,803 INFO L273 TraceCheckUtils]: 85: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 86: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 87: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 88: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 89: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 90: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 91: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 92: Hoare triple {13515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13515#false} is VALID [2018-11-18 22:51:18,804 INFO L273 TraceCheckUtils]: 93: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 94: Hoare triple {13515#false} assume !(~i~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 95: Hoare triple {13515#false} ~i~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 96: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 97: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 98: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 99: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 100: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 101: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,805 INFO L273 TraceCheckUtils]: 102: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 103: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 104: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 105: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 106: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 107: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 108: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 109: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 110: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,806 INFO L273 TraceCheckUtils]: 111: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 112: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 113: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 114: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 115: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 116: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 117: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 118: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 119: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 121: Hoare triple {13515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 122: Hoare triple {13515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 123: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 124: Hoare triple {13515#false} assume !(~i~0 < 100000); {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 125: Hoare triple {13515#false} havoc ~x~0;~x~0 := 0; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 126: Hoare triple {13515#false} assume true; {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L273 TraceCheckUtils]: 127: Hoare triple {13515#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {13515#false} is VALID [2018-11-18 22:51:18,808 INFO L256 TraceCheckUtils]: 128: Hoare triple {13515#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {13515#false} is VALID [2018-11-18 22:51:18,809 INFO L273 TraceCheckUtils]: 129: Hoare triple {13515#false} ~cond := #in~cond; {13515#false} is VALID [2018-11-18 22:51:18,809 INFO L273 TraceCheckUtils]: 130: Hoare triple {13515#false} assume 0 == ~cond; {13515#false} is VALID [2018-11-18 22:51:18,809 INFO L273 TraceCheckUtils]: 131: Hoare triple {13515#false} assume !false; {13515#false} is VALID [2018-11-18 22:51:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:51:18,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:18,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:51:18,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 132 [2018-11-18 22:51:18,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:18,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:51:18,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:18,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:51:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:51:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:51:18,917 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 23 states. [2018-11-18 22:51:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:19,462 INFO L93 Difference]: Finished difference Result 213 states and 219 transitions. [2018-11-18 22:51:19,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:51:19,462 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 132 [2018-11-18 22:51:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:51:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2018-11-18 22:51:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:51:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2018-11-18 22:51:19,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 115 transitions. [2018-11-18 22:51:19,583 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:51:19,586 INFO L225 Difference]: With dead ends: 213 [2018-11-18 22:51:19,586 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 22:51:19,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 132 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:51:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 22:51:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-18 22:51:19,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:19,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 140 states. [2018-11-18 22:51:19,683 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 140 states. [2018-11-18 22:51:19,683 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 140 states. [2018-11-18 22:51:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:19,685 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-11-18 22:51:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-11-18 22:51:19,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:19,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:19,686 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 141 states. [2018-11-18 22:51:19,686 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 141 states. [2018-11-18 22:51:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:19,689 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-11-18 22:51:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-11-18 22:51:19,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:19,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:19,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:19,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 22:51:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-11-18 22:51:19,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 132 [2018-11-18 22:51:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:19,693 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-11-18 22:51:19,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:51:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-11-18 22:51:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 22:51:19,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:19,694 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:19,694 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:19,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 642637345, now seen corresponding path program 20 times [2018-11-18 22:51:19,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:19,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:51:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:20,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {14686#true} call ULTIMATE.init(); {14686#true} is VALID [2018-11-18 22:51:20,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {14686#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14686#true} is VALID [2018-11-18 22:51:20,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {14686#true} assume true; {14686#true} is VALID [2018-11-18 22:51:20,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14686#true} {14686#true} #81#return; {14686#true} is VALID [2018-11-18 22:51:20,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {14686#true} call #t~ret9 := main(); {14686#true} is VALID [2018-11-18 22:51:20,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {14686#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14688#(= main_~a~0 0)} is VALID [2018-11-18 22:51:20,754 INFO L273 TraceCheckUtils]: 6: Hoare triple {14688#(= main_~a~0 0)} assume true; {14688#(= main_~a~0 0)} is VALID [2018-11-18 22:51:20,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {14688#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14688#(= main_~a~0 0)} is VALID [2018-11-18 22:51:20,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {14688#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:20,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {14689#(<= main_~a~0 1)} assume true; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:20,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {14689#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:20,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {14689#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:20,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {14690#(<= main_~a~0 2)} assume true; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:20,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {14690#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:20,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:20,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {14691#(<= main_~a~0 3)} assume true; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:20,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {14691#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:20,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {14691#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:20,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {14692#(<= main_~a~0 4)} assume true; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:20,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {14692#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:20,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {14692#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:20,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {14693#(<= main_~a~0 5)} assume true; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:20,764 INFO L273 TraceCheckUtils]: 22: Hoare triple {14693#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:20,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {14693#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:20,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {14694#(<= main_~a~0 6)} assume true; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:20,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {14694#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:20,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {14694#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:20,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {14695#(<= main_~a~0 7)} assume true; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:20,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {14695#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:20,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {14695#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:20,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {14696#(<= main_~a~0 8)} assume true; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:20,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {14696#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:20,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {14696#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:20,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {14697#(<= main_~a~0 9)} assume true; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:20,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {14697#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:20,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {14697#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:20,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {14698#(<= main_~a~0 10)} assume true; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:20,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {14698#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:20,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {14698#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:20,774 INFO L273 TraceCheckUtils]: 39: Hoare triple {14699#(<= main_~a~0 11)} assume true; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:20,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {14699#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:20,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {14699#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:20,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {14700#(<= main_~a~0 12)} assume true; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:20,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {14700#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:20,777 INFO L273 TraceCheckUtils]: 44: Hoare triple {14700#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:20,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {14701#(<= main_~a~0 13)} assume true; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:20,778 INFO L273 TraceCheckUtils]: 46: Hoare triple {14701#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:20,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {14701#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:20,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {14702#(<= main_~a~0 14)} assume true; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:20,780 INFO L273 TraceCheckUtils]: 49: Hoare triple {14702#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:20,780 INFO L273 TraceCheckUtils]: 50: Hoare triple {14702#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:20,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {14703#(<= main_~a~0 15)} assume true; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:20,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {14703#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:20,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {14703#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:20,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {14704#(<= main_~a~0 16)} assume true; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:20,783 INFO L273 TraceCheckUtils]: 55: Hoare triple {14704#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:20,784 INFO L273 TraceCheckUtils]: 56: Hoare triple {14704#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:20,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {14705#(<= main_~a~0 17)} assume true; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:20,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {14705#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:20,786 INFO L273 TraceCheckUtils]: 59: Hoare triple {14705#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:20,786 INFO L273 TraceCheckUtils]: 60: Hoare triple {14706#(<= main_~a~0 18)} assume true; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:20,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {14706#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:20,788 INFO L273 TraceCheckUtils]: 62: Hoare triple {14706#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:20,788 INFO L273 TraceCheckUtils]: 63: Hoare triple {14707#(<= main_~a~0 19)} assume true; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:20,789 INFO L273 TraceCheckUtils]: 64: Hoare triple {14707#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:20,789 INFO L273 TraceCheckUtils]: 65: Hoare triple {14707#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14708#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:20,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {14708#(<= main_~a~0 20)} assume true; {14708#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:20,791 INFO L273 TraceCheckUtils]: 67: Hoare triple {14708#(<= main_~a~0 20)} assume !(~a~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:20,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {14687#false} havoc ~i~0;~i~0 := 0; {14687#false} is VALID [2018-11-18 22:51:20,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,791 INFO L273 TraceCheckUtils]: 71: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,792 INFO L273 TraceCheckUtils]: 76: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,793 INFO L273 TraceCheckUtils]: 79: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,793 INFO L273 TraceCheckUtils]: 80: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,794 INFO L273 TraceCheckUtils]: 82: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,794 INFO L273 TraceCheckUtils]: 84: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,794 INFO L273 TraceCheckUtils]: 85: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,794 INFO L273 TraceCheckUtils]: 86: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 87: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 88: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 89: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 90: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 91: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,795 INFO L273 TraceCheckUtils]: 92: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 93: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 94: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 95: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 96: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 97: Hoare triple {14687#false} assume !(~i~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 98: Hoare triple {14687#false} ~i~0 := 0; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 99: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 100: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,796 INFO L273 TraceCheckUtils]: 101: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 102: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 103: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 104: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 105: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 106: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 107: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 108: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 109: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,797 INFO L273 TraceCheckUtils]: 110: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 111: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 112: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 113: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 114: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 115: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 116: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 117: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,798 INFO L273 TraceCheckUtils]: 118: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 119: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 120: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 121: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 122: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 123: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 124: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 125: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 126: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,799 INFO L273 TraceCheckUtils]: 127: Hoare triple {14687#false} assume !(~i~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 128: Hoare triple {14687#false} havoc ~x~0;~x~0 := 0; {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 129: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 130: Hoare triple {14687#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L256 TraceCheckUtils]: 131: Hoare triple {14687#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 132: Hoare triple {14687#false} ~cond := #in~cond; {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 133: Hoare triple {14687#false} assume 0 == ~cond; {14687#false} is VALID [2018-11-18 22:51:20,800 INFO L273 TraceCheckUtils]: 134: Hoare triple {14687#false} assume !false; {14687#false} is VALID [2018-11-18 22:51:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:51:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:20,809 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:51:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:51:20,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:51:20,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:20,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:21,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {14686#true} call ULTIMATE.init(); {14686#true} is VALID [2018-11-18 22:51:21,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {14686#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14686#true} is VALID [2018-11-18 22:51:21,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {14686#true} assume true; {14686#true} is VALID [2018-11-18 22:51:21,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14686#true} {14686#true} #81#return; {14686#true} is VALID [2018-11-18 22:51:21,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {14686#true} call #t~ret9 := main(); {14686#true} is VALID [2018-11-18 22:51:21,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {14686#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14727#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:21,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {14727#(<= main_~a~0 0)} assume true; {14727#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:21,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {14727#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14727#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:21,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {14727#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:21,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {14689#(<= main_~a~0 1)} assume true; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:21,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {14689#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14689#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:21,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {14689#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:21,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {14690#(<= main_~a~0 2)} assume true; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:21,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {14690#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14690#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:21,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:21,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {14691#(<= main_~a~0 3)} assume true; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:21,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {14691#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14691#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:21,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {14691#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:21,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {14692#(<= main_~a~0 4)} assume true; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:21,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {14692#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14692#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:21,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {14692#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:21,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {14693#(<= main_~a~0 5)} assume true; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:21,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {14693#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14693#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:21,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {14693#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:21,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {14694#(<= main_~a~0 6)} assume true; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:21,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {14694#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14694#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:21,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {14694#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:21,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {14695#(<= main_~a~0 7)} assume true; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:21,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {14695#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14695#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:21,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {14695#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:21,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {14696#(<= main_~a~0 8)} assume true; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:21,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {14696#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14696#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:21,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {14696#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:21,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {14697#(<= main_~a~0 9)} assume true; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:21,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {14697#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14697#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:21,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {14697#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:21,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {14698#(<= main_~a~0 10)} assume true; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:21,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {14698#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14698#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:21,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {14698#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:21,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {14699#(<= main_~a~0 11)} assume true; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:21,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {14699#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14699#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:21,131 INFO L273 TraceCheckUtils]: 41: Hoare triple {14699#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:21,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {14700#(<= main_~a~0 12)} assume true; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:21,132 INFO L273 TraceCheckUtils]: 43: Hoare triple {14700#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14700#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:21,133 INFO L273 TraceCheckUtils]: 44: Hoare triple {14700#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:21,133 INFO L273 TraceCheckUtils]: 45: Hoare triple {14701#(<= main_~a~0 13)} assume true; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:21,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {14701#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14701#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:21,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {14701#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:21,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {14702#(<= main_~a~0 14)} assume true; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:21,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {14702#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14702#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:21,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {14702#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:21,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {14703#(<= main_~a~0 15)} assume true; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:21,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {14703#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14703#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:21,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {14703#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:21,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {14704#(<= main_~a~0 16)} assume true; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:21,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {14704#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14704#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:21,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {14704#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:21,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {14705#(<= main_~a~0 17)} assume true; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:21,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {14705#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14705#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:21,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {14705#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:21,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {14706#(<= main_~a~0 18)} assume true; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:21,175 INFO L273 TraceCheckUtils]: 61: Hoare triple {14706#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14706#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:21,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {14706#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:21,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {14707#(<= main_~a~0 19)} assume true; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:21,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {14707#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14707#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:21,223 INFO L273 TraceCheckUtils]: 65: Hoare triple {14707#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14708#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:21,232 INFO L273 TraceCheckUtils]: 66: Hoare triple {14708#(<= main_~a~0 20)} assume true; {14708#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:21,244 INFO L273 TraceCheckUtils]: 67: Hoare triple {14708#(<= main_~a~0 20)} assume !(~a~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:21,245 INFO L273 TraceCheckUtils]: 68: Hoare triple {14687#false} havoc ~i~0;~i~0 := 0; {14687#false} is VALID [2018-11-18 22:51:21,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,245 INFO L273 TraceCheckUtils]: 71: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,245 INFO L273 TraceCheckUtils]: 72: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,246 INFO L273 TraceCheckUtils]: 73: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,246 INFO L273 TraceCheckUtils]: 74: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,246 INFO L273 TraceCheckUtils]: 75: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,246 INFO L273 TraceCheckUtils]: 76: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,246 INFO L273 TraceCheckUtils]: 77: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 80: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 81: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 82: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 83: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,247 INFO L273 TraceCheckUtils]: 84: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 86: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 87: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 88: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 89: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,248 INFO L273 TraceCheckUtils]: 90: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 91: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 92: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 95: Hoare triple {14687#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14687#false} is VALID [2018-11-18 22:51:21,249 INFO L273 TraceCheckUtils]: 96: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 97: Hoare triple {14687#false} assume !(~i~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 98: Hoare triple {14687#false} ~i~0 := 0; {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 99: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 100: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 101: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,250 INFO L273 TraceCheckUtils]: 102: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 103: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 104: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 105: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 106: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 107: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,251 INFO L273 TraceCheckUtils]: 108: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 109: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 110: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 111: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 112: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 113: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,252 INFO L273 TraceCheckUtils]: 114: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 115: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 116: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 117: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 118: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 119: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 120: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,253 INFO L273 TraceCheckUtils]: 121: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 122: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 123: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 124: Hoare triple {14687#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 125: Hoare triple {14687#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 126: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,254 INFO L273 TraceCheckUtils]: 127: Hoare triple {14687#false} assume !(~i~0 < 100000); {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L273 TraceCheckUtils]: 128: Hoare triple {14687#false} havoc ~x~0;~x~0 := 0; {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L273 TraceCheckUtils]: 129: Hoare triple {14687#false} assume true; {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L273 TraceCheckUtils]: 130: Hoare triple {14687#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L256 TraceCheckUtils]: 131: Hoare triple {14687#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L273 TraceCheckUtils]: 132: Hoare triple {14687#false} ~cond := #in~cond; {14687#false} is VALID [2018-11-18 22:51:21,255 INFO L273 TraceCheckUtils]: 133: Hoare triple {14687#false} assume 0 == ~cond; {14687#false} is VALID [2018-11-18 22:51:21,256 INFO L273 TraceCheckUtils]: 134: Hoare triple {14687#false} assume !false; {14687#false} is VALID [2018-11-18 22:51:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:51:21,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:51:21,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-11-18 22:51:21,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:21,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:51:21,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:21,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:51:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:51:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:51:21,555 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 24 states. [2018-11-18 22:51:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:22,269 INFO L93 Difference]: Finished difference Result 216 states and 222 transitions. [2018-11-18 22:51:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:51:22,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-11-18 22:51:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:51:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-18 22:51:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:51:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-18 22:51:22,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2018-11-18 22:51:22,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:22,476 INFO L225 Difference]: With dead ends: 216 [2018-11-18 22:51:22,476 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 22:51:22,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:51:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 22:51:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-18 22:51:22,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:22,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 143 states. [2018-11-18 22:51:22,513 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 143 states. [2018-11-18 22:51:22,513 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 143 states. [2018-11-18 22:51:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:22,516 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-11-18 22:51:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-11-18 22:51:22,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:22,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:22,518 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 144 states. [2018-11-18 22:51:22,518 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 144 states. [2018-11-18 22:51:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:22,520 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-11-18 22:51:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-11-18 22:51:22,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:22,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:22,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:22,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 22:51:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-11-18 22:51:22,523 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 135 [2018-11-18 22:51:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:22,524 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-11-18 22:51:22,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:51:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-11-18 22:51:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 22:51:22,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:22,525 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:22,525 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:22,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1294770658, now seen corresponding path program 21 times [2018-11-18 22:51:22,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:22,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:22,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:23,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {15882#true} call ULTIMATE.init(); {15882#true} is VALID [2018-11-18 22:51:23,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {15882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15882#true} is VALID [2018-11-18 22:51:23,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:23,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15882#true} {15882#true} #81#return; {15882#true} is VALID [2018-11-18 22:51:23,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {15882#true} call #t~ret9 := main(); {15882#true} is VALID [2018-11-18 22:51:23,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {15882#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15884#(= main_~a~0 0)} is VALID [2018-11-18 22:51:23,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {15884#(= main_~a~0 0)} assume true; {15884#(= main_~a~0 0)} is VALID [2018-11-18 22:51:23,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {15884#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15884#(= main_~a~0 0)} is VALID [2018-11-18 22:51:23,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {15884#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15885#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:23,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {15885#(<= main_~a~0 1)} assume true; {15885#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:23,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {15885#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15885#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:23,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {15885#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15886#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:23,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {15886#(<= main_~a~0 2)} assume true; {15886#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:23,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {15886#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15886#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:23,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {15886#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15887#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:23,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {15887#(<= main_~a~0 3)} assume true; {15887#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:23,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {15887#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15887#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:23,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {15887#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15888#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:23,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {15888#(<= main_~a~0 4)} assume true; {15888#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:23,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {15888#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15888#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:23,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {15888#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15889#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:23,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {15889#(<= main_~a~0 5)} assume true; {15889#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:23,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {15889#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15889#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:23,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {15889#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15890#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:23,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {15890#(<= main_~a~0 6)} assume true; {15890#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:23,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {15890#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15890#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:23,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {15890#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15891#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:23,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {15891#(<= main_~a~0 7)} assume true; {15891#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:23,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {15891#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15891#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:23,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {15891#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15892#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:23,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {15892#(<= main_~a~0 8)} assume true; {15892#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:23,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {15892#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15892#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:23,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {15892#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15893#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:23,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {15893#(<= main_~a~0 9)} assume true; {15893#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:23,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {15893#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15893#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:23,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {15893#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15894#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:23,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {15894#(<= main_~a~0 10)} assume true; {15894#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:23,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {15894#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15894#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:23,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {15894#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15895#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:23,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {15895#(<= main_~a~0 11)} assume true; {15895#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:23,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {15895#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15895#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:23,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {15895#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15896#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:23,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {15896#(<= main_~a~0 12)} assume true; {15896#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:23,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {15896#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15896#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:23,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {15896#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15897#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:23,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {15897#(<= main_~a~0 13)} assume true; {15897#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:23,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {15897#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15897#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:23,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {15897#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15898#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:23,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {15898#(<= main_~a~0 14)} assume true; {15898#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:23,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {15898#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15898#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:23,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {15898#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15899#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:23,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {15899#(<= main_~a~0 15)} assume true; {15899#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:23,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {15899#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15899#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:23,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {15899#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15900#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:23,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {15900#(<= main_~a~0 16)} assume true; {15900#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:23,111 INFO L273 TraceCheckUtils]: 55: Hoare triple {15900#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15900#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:23,111 INFO L273 TraceCheckUtils]: 56: Hoare triple {15900#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15901#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:23,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {15901#(<= main_~a~0 17)} assume true; {15901#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:23,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {15901#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15901#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:23,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {15901#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15902#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:23,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {15902#(<= main_~a~0 18)} assume true; {15902#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:23,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {15902#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15902#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:23,115 INFO L273 TraceCheckUtils]: 62: Hoare triple {15902#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15903#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:23,115 INFO L273 TraceCheckUtils]: 63: Hoare triple {15903#(<= main_~a~0 19)} assume true; {15903#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:23,115 INFO L273 TraceCheckUtils]: 64: Hoare triple {15903#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15903#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:23,116 INFO L273 TraceCheckUtils]: 65: Hoare triple {15903#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15904#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:23,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {15904#(<= main_~a~0 20)} assume true; {15904#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:23,117 INFO L273 TraceCheckUtils]: 67: Hoare triple {15904#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15904#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:23,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {15904#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15905#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:23,118 INFO L273 TraceCheckUtils]: 69: Hoare triple {15905#(<= main_~a~0 21)} assume true; {15905#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:23,119 INFO L273 TraceCheckUtils]: 70: Hoare triple {15905#(<= main_~a~0 21)} assume !(~a~0 < 100000); {15883#false} is VALID [2018-11-18 22:51:23,119 INFO L273 TraceCheckUtils]: 71: Hoare triple {15883#false} havoc ~i~0;~i~0 := 0; {15883#false} is VALID [2018-11-18 22:51:23,119 INFO L273 TraceCheckUtils]: 72: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,119 INFO L273 TraceCheckUtils]: 73: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,120 INFO L273 TraceCheckUtils]: 74: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,120 INFO L273 TraceCheckUtils]: 75: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,120 INFO L273 TraceCheckUtils]: 76: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,120 INFO L273 TraceCheckUtils]: 77: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,120 INFO L273 TraceCheckUtils]: 78: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 79: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 80: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 81: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 82: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 83: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,121 INFO L273 TraceCheckUtils]: 84: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 85: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 86: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 87: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 88: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 89: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 90: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 91: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,122 INFO L273 TraceCheckUtils]: 92: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 93: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 94: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 95: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 96: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 97: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 98: Hoare triple {15883#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 99: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 100: Hoare triple {15883#false} assume !(~i~0 < 100000); {15883#false} is VALID [2018-11-18 22:51:23,123 INFO L273 TraceCheckUtils]: 101: Hoare triple {15883#false} ~i~0 := 0; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 102: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 103: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 104: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 105: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 106: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 107: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 108: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 109: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,124 INFO L273 TraceCheckUtils]: 110: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 111: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 112: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 113: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 114: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 115: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 116: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 117: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 118: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 119: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,125 INFO L273 TraceCheckUtils]: 120: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 121: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 122: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 123: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 124: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 125: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 126: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 127: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:23,126 INFO L273 TraceCheckUtils]: 128: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L273 TraceCheckUtils]: 129: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L273 TraceCheckUtils]: 130: Hoare triple {15883#false} assume !(~i~0 < 100000); {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L273 TraceCheckUtils]: 131: Hoare triple {15883#false} havoc ~x~0;~x~0 := 0; {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L273 TraceCheckUtils]: 132: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L273 TraceCheckUtils]: 133: Hoare triple {15883#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {15883#false} is VALID [2018-11-18 22:51:23,127 INFO L256 TraceCheckUtils]: 134: Hoare triple {15883#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {15883#false} is VALID [2018-11-18 22:51:23,128 INFO L273 TraceCheckUtils]: 135: Hoare triple {15883#false} ~cond := #in~cond; {15883#false} is VALID [2018-11-18 22:51:23,128 INFO L273 TraceCheckUtils]: 136: Hoare triple {15883#false} assume 0 == ~cond; {15883#false} is VALID [2018-11-18 22:51:23,128 INFO L273 TraceCheckUtils]: 137: Hoare triple {15883#false} assume !false; {15883#false} is VALID [2018-11-18 22:51:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:51:23,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:23,137 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:51:23,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:51:25,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:51:25,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:25,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:26,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {15882#true} call ULTIMATE.init(); {15882#true} is VALID [2018-11-18 22:51:26,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {15882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15882#true} is VALID [2018-11-18 22:51:26,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15882#true} {15882#true} #81#return; {15882#true} is VALID [2018-11-18 22:51:26,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {15882#true} call #t~ret9 := main(); {15882#true} is VALID [2018-11-18 22:51:26,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {15882#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15882#true} is VALID [2018-11-18 22:51:26,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 48: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 50: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,674 INFO L273 TraceCheckUtils]: 52: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 53: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 54: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 55: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 56: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 57: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 59: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 60: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 61: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 63: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,676 INFO L273 TraceCheckUtils]: 64: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15882#true} is VALID [2018-11-18 22:51:26,677 INFO L273 TraceCheckUtils]: 65: Hoare triple {15882#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15882#true} is VALID [2018-11-18 22:51:26,677 INFO L273 TraceCheckUtils]: 66: Hoare triple {15882#true} assume true; {15882#true} is VALID [2018-11-18 22:51:26,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {15882#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16110#(< main_~a~0 100000)} is VALID [2018-11-18 22:51:26,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {16110#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16114#(<= main_~a~0 100000)} is VALID [2018-11-18 22:51:26,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {16114#(<= main_~a~0 100000)} assume true; {16114#(<= main_~a~0 100000)} is VALID [2018-11-18 22:51:26,714 INFO L273 TraceCheckUtils]: 70: Hoare triple {16114#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {15882#true} is VALID [2018-11-18 22:51:26,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {15882#true} havoc ~i~0;~i~0 := 0; {16124#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:26,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {16124#(<= main_~i~0 0)} assume true; {16124#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:26,725 INFO L273 TraceCheckUtils]: 73: Hoare triple {16124#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16124#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:26,725 INFO L273 TraceCheckUtils]: 74: Hoare triple {16124#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16134#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:26,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {16134#(<= main_~i~0 1)} assume true; {16134#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:26,727 INFO L273 TraceCheckUtils]: 76: Hoare triple {16134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16134#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:26,727 INFO L273 TraceCheckUtils]: 77: Hoare triple {16134#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16144#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:26,728 INFO L273 TraceCheckUtils]: 78: Hoare triple {16144#(<= main_~i~0 2)} assume true; {16144#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:26,728 INFO L273 TraceCheckUtils]: 79: Hoare triple {16144#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16144#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:26,728 INFO L273 TraceCheckUtils]: 80: Hoare triple {16144#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16154#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:26,729 INFO L273 TraceCheckUtils]: 81: Hoare triple {16154#(<= main_~i~0 3)} assume true; {16154#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:26,729 INFO L273 TraceCheckUtils]: 82: Hoare triple {16154#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16154#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:26,729 INFO L273 TraceCheckUtils]: 83: Hoare triple {16154#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16164#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:26,730 INFO L273 TraceCheckUtils]: 84: Hoare triple {16164#(<= main_~i~0 4)} assume true; {16164#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:26,730 INFO L273 TraceCheckUtils]: 85: Hoare triple {16164#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16164#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:26,731 INFO L273 TraceCheckUtils]: 86: Hoare triple {16164#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16174#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:26,732 INFO L273 TraceCheckUtils]: 87: Hoare triple {16174#(<= main_~i~0 5)} assume true; {16174#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:26,732 INFO L273 TraceCheckUtils]: 88: Hoare triple {16174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16174#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:26,733 INFO L273 TraceCheckUtils]: 89: Hoare triple {16174#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16184#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:26,733 INFO L273 TraceCheckUtils]: 90: Hoare triple {16184#(<= main_~i~0 6)} assume true; {16184#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:26,734 INFO L273 TraceCheckUtils]: 91: Hoare triple {16184#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16184#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:26,735 INFO L273 TraceCheckUtils]: 92: Hoare triple {16184#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16194#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:26,735 INFO L273 TraceCheckUtils]: 93: Hoare triple {16194#(<= main_~i~0 7)} assume true; {16194#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:26,736 INFO L273 TraceCheckUtils]: 94: Hoare triple {16194#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16194#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:26,736 INFO L273 TraceCheckUtils]: 95: Hoare triple {16194#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16204#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:26,737 INFO L273 TraceCheckUtils]: 96: Hoare triple {16204#(<= main_~i~0 8)} assume true; {16204#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:26,737 INFO L273 TraceCheckUtils]: 97: Hoare triple {16204#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16204#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:26,738 INFO L273 TraceCheckUtils]: 98: Hoare triple {16204#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16214#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:26,739 INFO L273 TraceCheckUtils]: 99: Hoare triple {16214#(<= main_~i~0 9)} assume true; {16214#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:26,739 INFO L273 TraceCheckUtils]: 100: Hoare triple {16214#(<= main_~i~0 9)} assume !(~i~0 < 100000); {15883#false} is VALID [2018-11-18 22:51:26,739 INFO L273 TraceCheckUtils]: 101: Hoare triple {15883#false} ~i~0 := 0; {15883#false} is VALID [2018-11-18 22:51:26,740 INFO L273 TraceCheckUtils]: 102: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,740 INFO L273 TraceCheckUtils]: 103: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,740 INFO L273 TraceCheckUtils]: 104: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,740 INFO L273 TraceCheckUtils]: 105: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,740 INFO L273 TraceCheckUtils]: 106: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 107: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 108: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 109: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 110: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 111: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 112: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 113: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,743 INFO L273 TraceCheckUtils]: 114: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 115: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 116: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 117: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 118: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 119: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,744 INFO L273 TraceCheckUtils]: 120: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 121: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 122: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 123: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 125: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 126: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,745 INFO L273 TraceCheckUtils]: 127: Hoare triple {15883#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 128: Hoare triple {15883#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 129: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 130: Hoare triple {15883#false} assume !(~i~0 < 100000); {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 131: Hoare triple {15883#false} havoc ~x~0;~x~0 := 0; {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 132: Hoare triple {15883#false} assume true; {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L273 TraceCheckUtils]: 133: Hoare triple {15883#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {15883#false} is VALID [2018-11-18 22:51:26,746 INFO L256 TraceCheckUtils]: 134: Hoare triple {15883#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {15883#false} is VALID [2018-11-18 22:51:26,747 INFO L273 TraceCheckUtils]: 135: Hoare triple {15883#false} ~cond := #in~cond; {15883#false} is VALID [2018-11-18 22:51:26,747 INFO L273 TraceCheckUtils]: 136: Hoare triple {15883#false} assume 0 == ~cond; {15883#false} is VALID [2018-11-18 22:51:26,747 INFO L273 TraceCheckUtils]: 137: Hoare triple {15883#false} assume !false; {15883#false} is VALID [2018-11-18 22:51:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 62 proven. 126 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2018-11-18 22:51:26,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:26,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 36 [2018-11-18 22:51:26,778 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-11-18 22:51:26,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:26,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-18 22:51:26,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:26,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 22:51:26,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 22:51:26,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:51:26,907 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 36 states. [2018-11-18 22:51:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:28,752 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-11-18 22:51:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 22:51:28,752 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-11-18 22:51:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:51:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 186 transitions. [2018-11-18 22:51:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:51:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 186 transitions. [2018-11-18 22:51:28,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 186 transitions. [2018-11-18 22:51:29,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:29,870 INFO L225 Difference]: With dead ends: 229 [2018-11-18 22:51:29,870 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 22:51:29,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=520, Invalid=1550, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:51:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 22:51:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-18 22:51:29,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:29,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2018-11-18 22:51:29,925 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2018-11-18 22:51:29,926 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2018-11-18 22:51:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:29,929 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-11-18 22:51:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-11-18 22:51:29,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:29,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:29,930 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2018-11-18 22:51:29,930 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2018-11-18 22:51:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:29,933 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-11-18 22:51:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-11-18 22:51:29,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:29,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:29,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:29,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 22:51:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-11-18 22:51:29,937 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 138 [2018-11-18 22:51:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:29,937 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-11-18 22:51:29,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 22:51:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-11-18 22:51:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 22:51:29,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:29,939 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:29,939 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:29,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -480560927, now seen corresponding path program 22 times [2018-11-18 22:51:29,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:29,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:29,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:30,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {17178#true} call ULTIMATE.init(); {17178#true} is VALID [2018-11-18 22:51:30,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {17178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17178#true} is VALID [2018-11-18 22:51:30,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {17178#true} assume true; {17178#true} is VALID [2018-11-18 22:51:30,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17178#true} {17178#true} #81#return; {17178#true} is VALID [2018-11-18 22:51:30,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {17178#true} call #t~ret9 := main(); {17178#true} is VALID [2018-11-18 22:51:30,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {17178#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17180#(= main_~a~0 0)} is VALID [2018-11-18 22:51:30,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {17180#(= main_~a~0 0)} assume true; {17180#(= main_~a~0 0)} is VALID [2018-11-18 22:51:30,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {17180#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17180#(= main_~a~0 0)} is VALID [2018-11-18 22:51:30,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {17180#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:30,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {17181#(<= main_~a~0 1)} assume true; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:30,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {17181#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:30,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {17181#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:30,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {17182#(<= main_~a~0 2)} assume true; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:30,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {17182#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:30,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {17182#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:30,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {17183#(<= main_~a~0 3)} assume true; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:30,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {17183#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:30,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {17183#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:30,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {17184#(<= main_~a~0 4)} assume true; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:30,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {17184#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:30,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {17184#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:30,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {17185#(<= main_~a~0 5)} assume true; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:30,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {17185#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:30,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {17185#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:30,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {17186#(<= main_~a~0 6)} assume true; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:30,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {17186#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:30,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {17186#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:30,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {17187#(<= main_~a~0 7)} assume true; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:30,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {17187#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:30,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {17187#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:30,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {17188#(<= main_~a~0 8)} assume true; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:30,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {17188#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:30,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {17188#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:30,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {17189#(<= main_~a~0 9)} assume true; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:30,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {17189#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:30,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {17189#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:30,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {17190#(<= main_~a~0 10)} assume true; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:30,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {17190#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:30,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {17190#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:30,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {17191#(<= main_~a~0 11)} assume true; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:30,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {17191#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:30,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {17191#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:30,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {17192#(<= main_~a~0 12)} assume true; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:30,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {17192#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:30,972 INFO L273 TraceCheckUtils]: 44: Hoare triple {17192#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:30,972 INFO L273 TraceCheckUtils]: 45: Hoare triple {17193#(<= main_~a~0 13)} assume true; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:30,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {17193#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:30,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {17193#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:30,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {17194#(<= main_~a~0 14)} assume true; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:30,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {17194#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:30,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {17194#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:30,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {17195#(<= main_~a~0 15)} assume true; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:30,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {17195#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:30,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {17195#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:30,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {17196#(<= main_~a~0 16)} assume true; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:30,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {17196#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:30,979 INFO L273 TraceCheckUtils]: 56: Hoare triple {17196#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:30,979 INFO L273 TraceCheckUtils]: 57: Hoare triple {17197#(<= main_~a~0 17)} assume true; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:30,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {17197#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:30,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {17197#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:30,981 INFO L273 TraceCheckUtils]: 60: Hoare triple {17198#(<= main_~a~0 18)} assume true; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:30,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {17198#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:30,982 INFO L273 TraceCheckUtils]: 62: Hoare triple {17198#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:30,983 INFO L273 TraceCheckUtils]: 63: Hoare triple {17199#(<= main_~a~0 19)} assume true; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:30,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {17199#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:30,984 INFO L273 TraceCheckUtils]: 65: Hoare triple {17199#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:30,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {17200#(<= main_~a~0 20)} assume true; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:30,985 INFO L273 TraceCheckUtils]: 67: Hoare triple {17200#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:30,985 INFO L273 TraceCheckUtils]: 68: Hoare triple {17200#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:30,986 INFO L273 TraceCheckUtils]: 69: Hoare triple {17201#(<= main_~a~0 21)} assume true; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:30,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {17201#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:30,987 INFO L273 TraceCheckUtils]: 71: Hoare triple {17201#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:30,988 INFO L273 TraceCheckUtils]: 72: Hoare triple {17202#(<= main_~a~0 22)} assume true; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:30,988 INFO L273 TraceCheckUtils]: 73: Hoare triple {17202#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:30,989 INFO L273 TraceCheckUtils]: 74: Hoare triple {17202#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17203#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:30,990 INFO L273 TraceCheckUtils]: 75: Hoare triple {17203#(<= main_~a~0 23)} assume true; {17203#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:30,990 INFO L273 TraceCheckUtils]: 76: Hoare triple {17203#(<= main_~a~0 23)} assume !(~a~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:30,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {17179#false} havoc ~i~0;~i~0 := 0; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 80: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 81: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 82: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,991 INFO L273 TraceCheckUtils]: 83: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,992 INFO L273 TraceCheckUtils]: 84: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,992 INFO L273 TraceCheckUtils]: 85: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,992 INFO L273 TraceCheckUtils]: 86: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,992 INFO L273 TraceCheckUtils]: 87: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,992 INFO L273 TraceCheckUtils]: 88: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 89: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 91: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 92: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 93: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 94: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 95: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 96: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,993 INFO L273 TraceCheckUtils]: 97: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 98: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 99: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 100: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 101: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 102: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 103: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 104: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 105: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,994 INFO L273 TraceCheckUtils]: 106: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 107: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 108: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 109: Hoare triple {17179#false} assume !(~i~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 110: Hoare triple {17179#false} ~i~0 := 0; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 111: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 112: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 113: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 114: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 115: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,995 INFO L273 TraceCheckUtils]: 116: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 117: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 118: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 119: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 120: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 121: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 122: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 123: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 124: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,996 INFO L273 TraceCheckUtils]: 125: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 126: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 127: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 128: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 129: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 130: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 131: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 132: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,997 INFO L273 TraceCheckUtils]: 133: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 134: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 135: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 136: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 137: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 138: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 139: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 140: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 141: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,998 INFO L273 TraceCheckUtils]: 142: Hoare triple {17179#false} assume !(~i~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:30,999 INFO L273 TraceCheckUtils]: 143: Hoare triple {17179#false} havoc ~x~0;~x~0 := 0; {17179#false} is VALID [2018-11-18 22:51:30,999 INFO L273 TraceCheckUtils]: 144: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:30,999 INFO L273 TraceCheckUtils]: 145: Hoare triple {17179#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {17179#false} is VALID [2018-11-18 22:51:30,999 INFO L256 TraceCheckUtils]: 146: Hoare triple {17179#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {17179#false} is VALID [2018-11-18 22:51:30,999 INFO L273 TraceCheckUtils]: 147: Hoare triple {17179#false} ~cond := #in~cond; {17179#false} is VALID [2018-11-18 22:51:31,000 INFO L273 TraceCheckUtils]: 148: Hoare triple {17179#false} assume 0 == ~cond; {17179#false} is VALID [2018-11-18 22:51:31,000 INFO L273 TraceCheckUtils]: 149: Hoare triple {17179#false} assume !false; {17179#false} is VALID [2018-11-18 22:51:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:51:31,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:31,015 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:51:31,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:51:31,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:51:31,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:31,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:31,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {17178#true} call ULTIMATE.init(); {17178#true} is VALID [2018-11-18 22:51:31,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {17178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17178#true} is VALID [2018-11-18 22:51:31,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {17178#true} assume true; {17178#true} is VALID [2018-11-18 22:51:31,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17178#true} {17178#true} #81#return; {17178#true} is VALID [2018-11-18 22:51:31,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {17178#true} call #t~ret9 := main(); {17178#true} is VALID [2018-11-18 22:51:31,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {17178#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17222#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:31,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {17222#(<= main_~a~0 0)} assume true; {17222#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:31,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {17222#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17222#(<= main_~a~0 0)} is VALID [2018-11-18 22:51:31,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {17222#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:31,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {17181#(<= main_~a~0 1)} assume true; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:31,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {17181#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17181#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:31,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {17181#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:31,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {17182#(<= main_~a~0 2)} assume true; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:31,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {17182#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17182#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:31,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {17182#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:31,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {17183#(<= main_~a~0 3)} assume true; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:31,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {17183#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17183#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:31,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {17183#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:31,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {17184#(<= main_~a~0 4)} assume true; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:31,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {17184#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17184#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:31,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {17184#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:31,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {17185#(<= main_~a~0 5)} assume true; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:31,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {17185#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17185#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:31,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {17185#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:31,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {17186#(<= main_~a~0 6)} assume true; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:31,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {17186#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17186#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:31,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {17186#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:31,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {17187#(<= main_~a~0 7)} assume true; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:31,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {17187#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17187#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:31,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {17187#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:31,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {17188#(<= main_~a~0 8)} assume true; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:31,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {17188#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17188#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:31,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {17188#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:31,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {17189#(<= main_~a~0 9)} assume true; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:31,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {17189#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17189#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:31,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {17189#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:31,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {17190#(<= main_~a~0 10)} assume true; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:31,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {17190#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17190#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:31,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {17190#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:31,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {17191#(<= main_~a~0 11)} assume true; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:31,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {17191#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17191#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:31,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {17191#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:31,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {17192#(<= main_~a~0 12)} assume true; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:31,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {17192#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17192#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:31,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {17192#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:31,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {17193#(<= main_~a~0 13)} assume true; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:31,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {17193#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17193#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:31,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {17193#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:31,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {17194#(<= main_~a~0 14)} assume true; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:31,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {17194#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17194#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:31,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {17194#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:31,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {17195#(<= main_~a~0 15)} assume true; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:31,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {17195#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17195#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:31,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {17195#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:31,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {17196#(<= main_~a~0 16)} assume true; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:31,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {17196#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17196#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:31,426 INFO L273 TraceCheckUtils]: 56: Hoare triple {17196#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:31,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {17197#(<= main_~a~0 17)} assume true; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:31,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {17197#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17197#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:31,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {17197#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:31,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {17198#(<= main_~a~0 18)} assume true; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:31,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {17198#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17198#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:31,430 INFO L273 TraceCheckUtils]: 62: Hoare triple {17198#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:31,430 INFO L273 TraceCheckUtils]: 63: Hoare triple {17199#(<= main_~a~0 19)} assume true; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:31,431 INFO L273 TraceCheckUtils]: 64: Hoare triple {17199#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17199#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:31,431 INFO L273 TraceCheckUtils]: 65: Hoare triple {17199#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:31,432 INFO L273 TraceCheckUtils]: 66: Hoare triple {17200#(<= main_~a~0 20)} assume true; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:31,432 INFO L273 TraceCheckUtils]: 67: Hoare triple {17200#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17200#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:31,433 INFO L273 TraceCheckUtils]: 68: Hoare triple {17200#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:31,434 INFO L273 TraceCheckUtils]: 69: Hoare triple {17201#(<= main_~a~0 21)} assume true; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:31,434 INFO L273 TraceCheckUtils]: 70: Hoare triple {17201#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17201#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:31,435 INFO L273 TraceCheckUtils]: 71: Hoare triple {17201#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:31,435 INFO L273 TraceCheckUtils]: 72: Hoare triple {17202#(<= main_~a~0 22)} assume true; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:31,436 INFO L273 TraceCheckUtils]: 73: Hoare triple {17202#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17202#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:31,437 INFO L273 TraceCheckUtils]: 74: Hoare triple {17202#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17203#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:31,437 INFO L273 TraceCheckUtils]: 75: Hoare triple {17203#(<= main_~a~0 23)} assume true; {17203#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:31,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {17203#(<= main_~a~0 23)} assume !(~a~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:31,438 INFO L273 TraceCheckUtils]: 77: Hoare triple {17179#false} havoc ~i~0;~i~0 := 0; {17179#false} is VALID [2018-11-18 22:51:31,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,438 INFO L273 TraceCheckUtils]: 79: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,438 INFO L273 TraceCheckUtils]: 80: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,439 INFO L273 TraceCheckUtils]: 83: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,439 INFO L273 TraceCheckUtils]: 85: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 86: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 87: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 89: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 90: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,440 INFO L273 TraceCheckUtils]: 91: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 92: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 93: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 94: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 95: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 96: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 98: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 99: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,441 INFO L273 TraceCheckUtils]: 100: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 101: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 102: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 103: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 104: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 105: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 106: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 107: Hoare triple {17179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 108: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 109: Hoare triple {17179#false} assume !(~i~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:31,442 INFO L273 TraceCheckUtils]: 110: Hoare triple {17179#false} ~i~0 := 0; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 111: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 112: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 113: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 114: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 115: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 116: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 117: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 118: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,443 INFO L273 TraceCheckUtils]: 119: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 120: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 121: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 122: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 123: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 124: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 125: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 126: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 127: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 128: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,444 INFO L273 TraceCheckUtils]: 129: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 130: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 131: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 132: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 133: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 134: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 135: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 136: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 137: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,445 INFO L273 TraceCheckUtils]: 138: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 139: Hoare triple {17179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 140: Hoare triple {17179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 141: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 142: Hoare triple {17179#false} assume !(~i~0 < 100000); {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 143: Hoare triple {17179#false} havoc ~x~0;~x~0 := 0; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 144: Hoare triple {17179#false} assume true; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 145: Hoare triple {17179#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L256 TraceCheckUtils]: 146: Hoare triple {17179#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 147: Hoare triple {17179#false} ~cond := #in~cond; {17179#false} is VALID [2018-11-18 22:51:31,446 INFO L273 TraceCheckUtils]: 148: Hoare triple {17179#false} assume 0 == ~cond; {17179#false} is VALID [2018-11-18 22:51:31,447 INFO L273 TraceCheckUtils]: 149: Hoare triple {17179#false} assume !false; {17179#false} is VALID [2018-11-18 22:51:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:51:31,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:31,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:51:31,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-11-18 22:51:31,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:31,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:51:31,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:31,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:51:31,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:51:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:51:31,625 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 27 states. [2018-11-18 22:51:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:32,271 INFO L93 Difference]: Finished difference Result 237 states and 243 transitions. [2018-11-18 22:51:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:51:32,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-11-18 22:51:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:51:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 127 transitions. [2018-11-18 22:51:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:51:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 127 transitions. [2018-11-18 22:51:32,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 127 transitions. [2018-11-18 22:51:32,401 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:51:32,404 INFO L225 Difference]: With dead ends: 237 [2018-11-18 22:51:32,404 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 22:51:32,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:51:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 22:51:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-18 22:51:32,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:32,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 158 states. [2018-11-18 22:51:32,459 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 158 states. [2018-11-18 22:51:32,459 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 158 states. [2018-11-18 22:51:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:32,462 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-11-18 22:51:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2018-11-18 22:51:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:32,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:32,462 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 159 states. [2018-11-18 22:51:32,462 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 159 states. [2018-11-18 22:51:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:32,465 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-11-18 22:51:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2018-11-18 22:51:32,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:32,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:32,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:32,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:51:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-11-18 22:51:32,469 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 150 [2018-11-18 22:51:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-11-18 22:51:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:51:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-11-18 22:51:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 22:51:32,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:32,470 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:32,471 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:32,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1718624068, now seen corresponding path program 23 times [2018-11-18 22:51:32,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:32,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:34,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {18500#true} call ULTIMATE.init(); {18500#true} is VALID [2018-11-18 22:51:34,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {18500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18500#true} is VALID [2018-11-18 22:51:34,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {18500#true} assume true; {18500#true} is VALID [2018-11-18 22:51:34,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18500#true} {18500#true} #81#return; {18500#true} is VALID [2018-11-18 22:51:34,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {18500#true} call #t~ret9 := main(); {18500#true} is VALID [2018-11-18 22:51:34,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {18500#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18502#(= main_~a~0 0)} is VALID [2018-11-18 22:51:34,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {18502#(= main_~a~0 0)} assume true; {18502#(= main_~a~0 0)} is VALID [2018-11-18 22:51:34,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {18502#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18502#(= main_~a~0 0)} is VALID [2018-11-18 22:51:34,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {18502#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:34,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {18503#(<= main_~a~0 1)} assume true; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:34,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {18503#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:51:34,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {18503#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:34,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {18504#(<= main_~a~0 2)} assume true; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:34,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {18504#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:51:34,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {18504#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:34,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {18505#(<= main_~a~0 3)} assume true; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:34,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {18505#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:51:34,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {18505#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:34,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {18506#(<= main_~a~0 4)} assume true; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:34,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {18506#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:51:34,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {18506#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:34,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {18507#(<= main_~a~0 5)} assume true; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:34,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {18507#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:51:34,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {18507#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:34,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {18508#(<= main_~a~0 6)} assume true; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:34,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {18508#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:51:34,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {18508#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:34,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {18509#(<= main_~a~0 7)} assume true; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:34,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {18509#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:51:34,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {18509#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:34,054 INFO L273 TraceCheckUtils]: 30: Hoare triple {18510#(<= main_~a~0 8)} assume true; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:34,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {18510#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:51:34,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {18510#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:34,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {18511#(<= main_~a~0 9)} assume true; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:34,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {18511#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:51:34,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {18511#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:34,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {18512#(<= main_~a~0 10)} assume true; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:34,058 INFO L273 TraceCheckUtils]: 37: Hoare triple {18512#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:51:34,059 INFO L273 TraceCheckUtils]: 38: Hoare triple {18512#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:34,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {18513#(<= main_~a~0 11)} assume true; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:34,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {18513#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:51:34,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {18513#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:34,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {18514#(<= main_~a~0 12)} assume true; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:34,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {18514#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:51:34,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {18514#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:34,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {18515#(<= main_~a~0 13)} assume true; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:34,064 INFO L273 TraceCheckUtils]: 46: Hoare triple {18515#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:51:34,064 INFO L273 TraceCheckUtils]: 47: Hoare triple {18515#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:34,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {18516#(<= main_~a~0 14)} assume true; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:34,066 INFO L273 TraceCheckUtils]: 49: Hoare triple {18516#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:51:34,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {18516#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:34,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {18517#(<= main_~a~0 15)} assume true; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:34,067 INFO L273 TraceCheckUtils]: 52: Hoare triple {18517#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:51:34,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {18517#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:34,068 INFO L273 TraceCheckUtils]: 54: Hoare triple {18518#(<= main_~a~0 16)} assume true; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:34,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {18518#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:51:34,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {18518#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:34,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {18519#(<= main_~a~0 17)} assume true; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:34,071 INFO L273 TraceCheckUtils]: 58: Hoare triple {18519#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:51:34,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {18519#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:34,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {18520#(<= main_~a~0 18)} assume true; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:34,073 INFO L273 TraceCheckUtils]: 61: Hoare triple {18520#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:51:34,073 INFO L273 TraceCheckUtils]: 62: Hoare triple {18520#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:34,074 INFO L273 TraceCheckUtils]: 63: Hoare triple {18521#(<= main_~a~0 19)} assume true; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:34,074 INFO L273 TraceCheckUtils]: 64: Hoare triple {18521#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:51:34,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {18521#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:34,076 INFO L273 TraceCheckUtils]: 66: Hoare triple {18522#(<= main_~a~0 20)} assume true; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:34,076 INFO L273 TraceCheckUtils]: 67: Hoare triple {18522#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:51:34,077 INFO L273 TraceCheckUtils]: 68: Hoare triple {18522#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:34,077 INFO L273 TraceCheckUtils]: 69: Hoare triple {18523#(<= main_~a~0 21)} assume true; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:34,078 INFO L273 TraceCheckUtils]: 70: Hoare triple {18523#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:51:34,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {18523#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:34,079 INFO L273 TraceCheckUtils]: 72: Hoare triple {18524#(<= main_~a~0 22)} assume true; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:34,080 INFO L273 TraceCheckUtils]: 73: Hoare triple {18524#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:51:34,080 INFO L273 TraceCheckUtils]: 74: Hoare triple {18524#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:34,081 INFO L273 TraceCheckUtils]: 75: Hoare triple {18525#(<= main_~a~0 23)} assume true; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:34,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {18525#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:51:34,082 INFO L273 TraceCheckUtils]: 77: Hoare triple {18525#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18526#(<= main_~a~0 24)} is VALID [2018-11-18 22:51:34,083 INFO L273 TraceCheckUtils]: 78: Hoare triple {18526#(<= main_~a~0 24)} assume true; {18526#(<= main_~a~0 24)} is VALID [2018-11-18 22:51:34,083 INFO L273 TraceCheckUtils]: 79: Hoare triple {18526#(<= main_~a~0 24)} assume !(~a~0 < 100000); {18501#false} is VALID [2018-11-18 22:51:34,083 INFO L273 TraceCheckUtils]: 80: Hoare triple {18501#false} havoc ~i~0;~i~0 := 0; {18501#false} is VALID [2018-11-18 22:51:34,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,084 INFO L273 TraceCheckUtils]: 82: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,084 INFO L273 TraceCheckUtils]: 83: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,084 INFO L273 TraceCheckUtils]: 84: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 86: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 89: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,085 INFO L273 TraceCheckUtils]: 91: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,086 INFO L273 TraceCheckUtils]: 92: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 97: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 98: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 99: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 100: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 101: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,087 INFO L273 TraceCheckUtils]: 102: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 103: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 104: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 105: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 106: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 107: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 108: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 109: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:51:34,088 INFO L273 TraceCheckUtils]: 111: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 112: Hoare triple {18501#false} assume !(~i~0 < 100000); {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 113: Hoare triple {18501#false} ~i~0 := 0; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 114: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 115: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 116: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 117: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 118: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 119: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 120: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,089 INFO L273 TraceCheckUtils]: 121: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 122: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 123: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 124: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 125: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 126: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 127: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 128: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 129: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,090 INFO L273 TraceCheckUtils]: 130: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 131: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 132: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 133: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 134: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 135: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 136: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 137: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 138: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,091 INFO L273 TraceCheckUtils]: 139: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 140: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 141: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 142: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 143: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 144: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 145: Hoare triple {18501#false} assume !(~i~0 < 100000); {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 146: Hoare triple {18501#false} havoc ~x~0;~x~0 := 0; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 147: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L273 TraceCheckUtils]: 148: Hoare triple {18501#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {18501#false} is VALID [2018-11-18 22:51:34,092 INFO L256 TraceCheckUtils]: 149: Hoare triple {18501#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {18501#false} is VALID [2018-11-18 22:51:34,093 INFO L273 TraceCheckUtils]: 150: Hoare triple {18501#false} ~cond := #in~cond; {18501#false} is VALID [2018-11-18 22:51:34,093 INFO L273 TraceCheckUtils]: 151: Hoare triple {18501#false} assume 0 == ~cond; {18501#false} is VALID [2018-11-18 22:51:34,093 INFO L273 TraceCheckUtils]: 152: Hoare triple {18501#false} assume !false; {18501#false} is VALID [2018-11-18 22:51:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:51:34,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:34,105 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:51:34,113 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:52:43,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-11-18 22:52:43,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:52:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:52:43,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:52:43,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {18500#true} call ULTIMATE.init(); {18500#true} is VALID [2018-11-18 22:52:43,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {18500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18500#true} is VALID [2018-11-18 22:52:43,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {18500#true} assume true; {18500#true} is VALID [2018-11-18 22:52:43,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18500#true} {18500#true} #81#return; {18500#true} is VALID [2018-11-18 22:52:43,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {18500#true} call #t~ret9 := main(); {18500#true} is VALID [2018-11-18 22:52:43,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {18500#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18545#(<= main_~a~0 0)} is VALID [2018-11-18 22:52:43,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {18545#(<= main_~a~0 0)} assume true; {18545#(<= main_~a~0 0)} is VALID [2018-11-18 22:52:43,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {18545#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18545#(<= main_~a~0 0)} is VALID [2018-11-18 22:52:43,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {18545#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:43,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {18503#(<= main_~a~0 1)} assume true; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:43,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {18503#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18503#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:43,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {18503#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:43,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {18504#(<= main_~a~0 2)} assume true; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:43,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {18504#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18504#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:43,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {18504#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:43,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {18505#(<= main_~a~0 3)} assume true; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:43,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {18505#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18505#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:43,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {18505#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:43,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {18506#(<= main_~a~0 4)} assume true; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:43,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {18506#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18506#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:43,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {18506#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:43,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {18507#(<= main_~a~0 5)} assume true; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:43,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {18507#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18507#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:43,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {18507#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:43,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {18508#(<= main_~a~0 6)} assume true; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:43,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {18508#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18508#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:43,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {18508#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:43,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {18509#(<= main_~a~0 7)} assume true; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:43,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {18509#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18509#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:43,785 INFO L273 TraceCheckUtils]: 29: Hoare triple {18509#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:43,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {18510#(<= main_~a~0 8)} assume true; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:43,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {18510#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18510#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:43,787 INFO L273 TraceCheckUtils]: 32: Hoare triple {18510#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:43,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {18511#(<= main_~a~0 9)} assume true; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:43,788 INFO L273 TraceCheckUtils]: 34: Hoare triple {18511#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18511#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:43,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {18511#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:43,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {18512#(<= main_~a~0 10)} assume true; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:43,790 INFO L273 TraceCheckUtils]: 37: Hoare triple {18512#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18512#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:43,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {18512#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:43,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {18513#(<= main_~a~0 11)} assume true; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:43,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {18513#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18513#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:43,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {18513#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:43,793 INFO L273 TraceCheckUtils]: 42: Hoare triple {18514#(<= main_~a~0 12)} assume true; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:43,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {18514#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18514#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:43,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {18514#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:43,794 INFO L273 TraceCheckUtils]: 45: Hoare triple {18515#(<= main_~a~0 13)} assume true; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:43,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {18515#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18515#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:43,796 INFO L273 TraceCheckUtils]: 47: Hoare triple {18515#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:43,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {18516#(<= main_~a~0 14)} assume true; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:43,797 INFO L273 TraceCheckUtils]: 49: Hoare triple {18516#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18516#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:43,797 INFO L273 TraceCheckUtils]: 50: Hoare triple {18516#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:43,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {18517#(<= main_~a~0 15)} assume true; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:43,798 INFO L273 TraceCheckUtils]: 52: Hoare triple {18517#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18517#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:43,799 INFO L273 TraceCheckUtils]: 53: Hoare triple {18517#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:43,800 INFO L273 TraceCheckUtils]: 54: Hoare triple {18518#(<= main_~a~0 16)} assume true; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:43,800 INFO L273 TraceCheckUtils]: 55: Hoare triple {18518#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18518#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:43,801 INFO L273 TraceCheckUtils]: 56: Hoare triple {18518#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:43,802 INFO L273 TraceCheckUtils]: 57: Hoare triple {18519#(<= main_~a~0 17)} assume true; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:43,802 INFO L273 TraceCheckUtils]: 58: Hoare triple {18519#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18519#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:43,803 INFO L273 TraceCheckUtils]: 59: Hoare triple {18519#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:43,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {18520#(<= main_~a~0 18)} assume true; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:43,804 INFO L273 TraceCheckUtils]: 61: Hoare triple {18520#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18520#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:43,805 INFO L273 TraceCheckUtils]: 62: Hoare triple {18520#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:43,805 INFO L273 TraceCheckUtils]: 63: Hoare triple {18521#(<= main_~a~0 19)} assume true; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:43,806 INFO L273 TraceCheckUtils]: 64: Hoare triple {18521#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18521#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:43,806 INFO L273 TraceCheckUtils]: 65: Hoare triple {18521#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:43,807 INFO L273 TraceCheckUtils]: 66: Hoare triple {18522#(<= main_~a~0 20)} assume true; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:43,807 INFO L273 TraceCheckUtils]: 67: Hoare triple {18522#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18522#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:43,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {18522#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:43,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {18523#(<= main_~a~0 21)} assume true; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:43,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {18523#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18523#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:43,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {18523#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:43,810 INFO L273 TraceCheckUtils]: 72: Hoare triple {18524#(<= main_~a~0 22)} assume true; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:43,811 INFO L273 TraceCheckUtils]: 73: Hoare triple {18524#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18524#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:43,812 INFO L273 TraceCheckUtils]: 74: Hoare triple {18524#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:43,812 INFO L273 TraceCheckUtils]: 75: Hoare triple {18525#(<= main_~a~0 23)} assume true; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:43,813 INFO L273 TraceCheckUtils]: 76: Hoare triple {18525#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18525#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:43,813 INFO L273 TraceCheckUtils]: 77: Hoare triple {18525#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18526#(<= main_~a~0 24)} is VALID [2018-11-18 22:52:43,814 INFO L273 TraceCheckUtils]: 78: Hoare triple {18526#(<= main_~a~0 24)} assume true; {18526#(<= main_~a~0 24)} is VALID [2018-11-18 22:52:43,814 INFO L273 TraceCheckUtils]: 79: Hoare triple {18526#(<= main_~a~0 24)} assume !(~a~0 < 100000); {18501#false} is VALID [2018-11-18 22:52:43,815 INFO L273 TraceCheckUtils]: 80: Hoare triple {18501#false} havoc ~i~0;~i~0 := 0; {18501#false} is VALID [2018-11-18 22:52:43,815 INFO L273 TraceCheckUtils]: 81: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,815 INFO L273 TraceCheckUtils]: 82: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,815 INFO L273 TraceCheckUtils]: 83: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,815 INFO L273 TraceCheckUtils]: 84: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,816 INFO L273 TraceCheckUtils]: 85: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,816 INFO L273 TraceCheckUtils]: 86: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,816 INFO L273 TraceCheckUtils]: 87: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,816 INFO L273 TraceCheckUtils]: 88: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,816 INFO L273 TraceCheckUtils]: 89: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 90: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 91: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 92: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 93: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 94: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,817 INFO L273 TraceCheckUtils]: 95: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 96: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 97: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 98: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 99: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 100: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 101: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 102: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 103: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 104: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,818 INFO L273 TraceCheckUtils]: 105: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 106: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 107: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 108: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 109: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 110: Hoare triple {18501#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 111: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 112: Hoare triple {18501#false} assume !(~i~0 < 100000); {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 113: Hoare triple {18501#false} ~i~0 := 0; {18501#false} is VALID [2018-11-18 22:52:43,819 INFO L273 TraceCheckUtils]: 114: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 115: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 116: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 117: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 118: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 119: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 120: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 121: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 122: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 123: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,820 INFO L273 TraceCheckUtils]: 124: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 125: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 126: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 127: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 128: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 129: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 130: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 131: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 132: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,821 INFO L273 TraceCheckUtils]: 133: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 134: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 135: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 136: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 137: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 138: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 139: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 140: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 141: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 142: Hoare triple {18501#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18501#false} is VALID [2018-11-18 22:52:43,822 INFO L273 TraceCheckUtils]: 143: Hoare triple {18501#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 144: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 145: Hoare triple {18501#false} assume !(~i~0 < 100000); {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 146: Hoare triple {18501#false} havoc ~x~0;~x~0 := 0; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 147: Hoare triple {18501#false} assume true; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 148: Hoare triple {18501#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L256 TraceCheckUtils]: 149: Hoare triple {18501#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 150: Hoare triple {18501#false} ~cond := #in~cond; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 151: Hoare triple {18501#false} assume 0 == ~cond; {18501#false} is VALID [2018-11-18 22:52:43,823 INFO L273 TraceCheckUtils]: 152: Hoare triple {18501#false} assume !false; {18501#false} is VALID [2018-11-18 22:52:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:52:43,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:52:43,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-18 22:52:43,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 153 [2018-11-18 22:52:43,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:52:43,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:52:43,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:52:43,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:52:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:52:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:52:43,965 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 28 states. [2018-11-18 22:52:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:52:44,968 INFO L93 Difference]: Finished difference Result 240 states and 246 transitions. [2018-11-18 22:52:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:52:44,968 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 153 [2018-11-18 22:52:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:52:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:52:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 130 transitions. [2018-11-18 22:52:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:52:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 130 transitions. [2018-11-18 22:52:44,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 130 transitions. [2018-11-18 22:52:45,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:52:45,093 INFO L225 Difference]: With dead ends: 240 [2018-11-18 22:52:45,094 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 22:52:45,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:52:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 22:52:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-18 22:52:45,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:52:45,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-18 22:52:45,152 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-18 22:52:45,153 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-18 22:52:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:52:45,156 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-11-18 22:52:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2018-11-18 22:52:45,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:52:45,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:52:45,157 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-18 22:52:45,157 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-18 22:52:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:52:45,160 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-11-18 22:52:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2018-11-18 22:52:45,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:52:45,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:52:45,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:52:45,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:52:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 22:52:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 164 transitions. [2018-11-18 22:52:45,164 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 164 transitions. Word has length 153 [2018-11-18 22:52:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:52:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 164 transitions. [2018-11-18 22:52:45,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:52:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2018-11-18 22:52:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 22:52:45,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:52:45,166 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:52:45,166 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:52:45,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:52:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2087290367, now seen corresponding path program 24 times [2018-11-18 22:52:45,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:52:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:52:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:52:45,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:52:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:52:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:52:45,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {19846#true} call ULTIMATE.init(); {19846#true} is VALID [2018-11-18 22:52:45,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {19846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19846#true} is VALID [2018-11-18 22:52:45,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:52:45,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19846#true} {19846#true} #81#return; {19846#true} is VALID [2018-11-18 22:52:45,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {19846#true} call #t~ret9 := main(); {19846#true} is VALID [2018-11-18 22:52:45,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {19846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19848#(= main_~a~0 0)} is VALID [2018-11-18 22:52:45,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {19848#(= main_~a~0 0)} assume true; {19848#(= main_~a~0 0)} is VALID [2018-11-18 22:52:45,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {19848#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19848#(= main_~a~0 0)} is VALID [2018-11-18 22:52:45,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {19848#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19849#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:45,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {19849#(<= main_~a~0 1)} assume true; {19849#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:45,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {19849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19849#(<= main_~a~0 1)} is VALID [2018-11-18 22:52:45,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {19849#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19850#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:45,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {19850#(<= main_~a~0 2)} assume true; {19850#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:45,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {19850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19850#(<= main_~a~0 2)} is VALID [2018-11-18 22:52:45,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {19850#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19851#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:45,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {19851#(<= main_~a~0 3)} assume true; {19851#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:45,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {19851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19851#(<= main_~a~0 3)} is VALID [2018-11-18 22:52:45,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {19851#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19852#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:45,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {19852#(<= main_~a~0 4)} assume true; {19852#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:45,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {19852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19852#(<= main_~a~0 4)} is VALID [2018-11-18 22:52:45,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {19852#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19853#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:45,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {19853#(<= main_~a~0 5)} assume true; {19853#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:45,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {19853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19853#(<= main_~a~0 5)} is VALID [2018-11-18 22:52:45,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {19853#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19854#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:45,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {19854#(<= main_~a~0 6)} assume true; {19854#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:45,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {19854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19854#(<= main_~a~0 6)} is VALID [2018-11-18 22:52:45,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {19854#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19855#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:45,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {19855#(<= main_~a~0 7)} assume true; {19855#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:45,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {19855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19855#(<= main_~a~0 7)} is VALID [2018-11-18 22:52:45,647 INFO L273 TraceCheckUtils]: 29: Hoare triple {19855#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19856#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:45,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {19856#(<= main_~a~0 8)} assume true; {19856#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:45,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {19856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19856#(<= main_~a~0 8)} is VALID [2018-11-18 22:52:45,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {19856#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19857#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:45,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {19857#(<= main_~a~0 9)} assume true; {19857#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:45,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {19857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19857#(<= main_~a~0 9)} is VALID [2018-11-18 22:52:45,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {19857#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19858#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:45,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {19858#(<= main_~a~0 10)} assume true; {19858#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:45,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {19858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19858#(<= main_~a~0 10)} is VALID [2018-11-18 22:52:45,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {19858#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19859#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:45,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {19859#(<= main_~a~0 11)} assume true; {19859#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:45,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {19859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19859#(<= main_~a~0 11)} is VALID [2018-11-18 22:52:45,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {19859#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19860#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:45,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {19860#(<= main_~a~0 12)} assume true; {19860#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:45,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {19860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19860#(<= main_~a~0 12)} is VALID [2018-11-18 22:52:45,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {19860#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19861#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:45,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {19861#(<= main_~a~0 13)} assume true; {19861#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:45,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {19861#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19861#(<= main_~a~0 13)} is VALID [2018-11-18 22:52:45,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {19861#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19862#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:45,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {19862#(<= main_~a~0 14)} assume true; {19862#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:45,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {19862#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19862#(<= main_~a~0 14)} is VALID [2018-11-18 22:52:45,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {19862#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19863#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:45,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {19863#(<= main_~a~0 15)} assume true; {19863#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:45,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {19863#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19863#(<= main_~a~0 15)} is VALID [2018-11-18 22:52:45,661 INFO L273 TraceCheckUtils]: 53: Hoare triple {19863#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19864#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:45,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {19864#(<= main_~a~0 16)} assume true; {19864#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:45,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {19864#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19864#(<= main_~a~0 16)} is VALID [2018-11-18 22:52:45,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {19864#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19865#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:45,663 INFO L273 TraceCheckUtils]: 57: Hoare triple {19865#(<= main_~a~0 17)} assume true; {19865#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:45,663 INFO L273 TraceCheckUtils]: 58: Hoare triple {19865#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19865#(<= main_~a~0 17)} is VALID [2018-11-18 22:52:45,664 INFO L273 TraceCheckUtils]: 59: Hoare triple {19865#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19866#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:45,665 INFO L273 TraceCheckUtils]: 60: Hoare triple {19866#(<= main_~a~0 18)} assume true; {19866#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:45,665 INFO L273 TraceCheckUtils]: 61: Hoare triple {19866#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19866#(<= main_~a~0 18)} is VALID [2018-11-18 22:52:45,666 INFO L273 TraceCheckUtils]: 62: Hoare triple {19866#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19867#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:45,666 INFO L273 TraceCheckUtils]: 63: Hoare triple {19867#(<= main_~a~0 19)} assume true; {19867#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:45,667 INFO L273 TraceCheckUtils]: 64: Hoare triple {19867#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19867#(<= main_~a~0 19)} is VALID [2018-11-18 22:52:45,668 INFO L273 TraceCheckUtils]: 65: Hoare triple {19867#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19868#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:45,668 INFO L273 TraceCheckUtils]: 66: Hoare triple {19868#(<= main_~a~0 20)} assume true; {19868#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:45,669 INFO L273 TraceCheckUtils]: 67: Hoare triple {19868#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19868#(<= main_~a~0 20)} is VALID [2018-11-18 22:52:45,669 INFO L273 TraceCheckUtils]: 68: Hoare triple {19868#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19869#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:45,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {19869#(<= main_~a~0 21)} assume true; {19869#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:45,670 INFO L273 TraceCheckUtils]: 70: Hoare triple {19869#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19869#(<= main_~a~0 21)} is VALID [2018-11-18 22:52:45,671 INFO L273 TraceCheckUtils]: 71: Hoare triple {19869#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19870#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:45,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {19870#(<= main_~a~0 22)} assume true; {19870#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:45,672 INFO L273 TraceCheckUtils]: 73: Hoare triple {19870#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19870#(<= main_~a~0 22)} is VALID [2018-11-18 22:52:45,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {19870#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19871#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:45,673 INFO L273 TraceCheckUtils]: 75: Hoare triple {19871#(<= main_~a~0 23)} assume true; {19871#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:45,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {19871#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19871#(<= main_~a~0 23)} is VALID [2018-11-18 22:52:45,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {19871#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19872#(<= main_~a~0 24)} is VALID [2018-11-18 22:52:45,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {19872#(<= main_~a~0 24)} assume true; {19872#(<= main_~a~0 24)} is VALID [2018-11-18 22:52:45,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {19872#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19872#(<= main_~a~0 24)} is VALID [2018-11-18 22:52:45,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {19872#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19873#(<= main_~a~0 25)} is VALID [2018-11-18 22:52:45,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {19873#(<= main_~a~0 25)} assume true; {19873#(<= main_~a~0 25)} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {19873#(<= main_~a~0 25)} assume !(~a~0 < 100000); {19847#false} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {19847#false} havoc ~i~0;~i~0 := 0; {19847#false} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 85: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,679 INFO L273 TraceCheckUtils]: 88: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,679 INFO L273 TraceCheckUtils]: 89: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,679 INFO L273 TraceCheckUtils]: 90: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,679 INFO L273 TraceCheckUtils]: 91: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,679 INFO L273 TraceCheckUtils]: 92: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,680 INFO L273 TraceCheckUtils]: 93: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,680 INFO L273 TraceCheckUtils]: 94: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,680 INFO L273 TraceCheckUtils]: 96: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,680 INFO L273 TraceCheckUtils]: 97: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 98: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 99: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 100: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 101: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 102: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,681 INFO L273 TraceCheckUtils]: 103: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,682 INFO L273 TraceCheckUtils]: 104: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,682 INFO L273 TraceCheckUtils]: 105: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,682 INFO L273 TraceCheckUtils]: 106: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,682 INFO L273 TraceCheckUtils]: 107: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,682 INFO L273 TraceCheckUtils]: 108: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 109: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 110: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 111: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 112: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 113: Hoare triple {19847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 114: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 115: Hoare triple {19847#false} assume !(~i~0 < 100000); {19847#false} is VALID [2018-11-18 22:52:45,683 INFO L273 TraceCheckUtils]: 116: Hoare triple {19847#false} ~i~0 := 0; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 117: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 118: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 119: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 120: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 121: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 122: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 123: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 124: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 125: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,684 INFO L273 TraceCheckUtils]: 126: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 127: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 128: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 129: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 130: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 131: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 132: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 133: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 134: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,685 INFO L273 TraceCheckUtils]: 135: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 136: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 137: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 138: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 139: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 140: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 141: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 142: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 143: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 144: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,686 INFO L273 TraceCheckUtils]: 145: Hoare triple {19847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 146: Hoare triple {19847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 147: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 148: Hoare triple {19847#false} assume !(~i~0 < 100000); {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 149: Hoare triple {19847#false} havoc ~x~0;~x~0 := 0; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 150: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 151: Hoare triple {19847#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L256 TraceCheckUtils]: 152: Hoare triple {19847#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 153: Hoare triple {19847#false} ~cond := #in~cond; {19847#false} is VALID [2018-11-18 22:52:45,687 INFO L273 TraceCheckUtils]: 154: Hoare triple {19847#false} assume 0 == ~cond; {19847#false} is VALID [2018-11-18 22:52:45,688 INFO L273 TraceCheckUtils]: 155: Hoare triple {19847#false} assume !false; {19847#false} is VALID [2018-11-18 22:52:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:52:45,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:52:45,700 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:52:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:53:24,173 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-18 22:53:24,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:24,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:24,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {19846#true} call ULTIMATE.init(); {19846#true} is VALID [2018-11-18 22:53:24,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {19846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19846#true} is VALID [2018-11-18 22:53:24,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19846#true} {19846#true} #81#return; {19846#true} is VALID [2018-11-18 22:53:24,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {19846#true} call #t~ret9 := main(); {19846#true} is VALID [2018-11-18 22:53:24,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {19846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19846#true} is VALID [2018-11-18 22:53:24,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 44: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 45: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 46: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 47: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,698 INFO L273 TraceCheckUtils]: 49: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 51: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 52: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 56: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 57: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,699 INFO L273 TraceCheckUtils]: 59: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 60: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 61: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 62: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 65: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 66: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 67: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 69: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 70: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 71: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 72: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 73: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 74: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 75: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 76: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {19846#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19846#true} is VALID [2018-11-18 22:53:24,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,702 INFO L273 TraceCheckUtils]: 79: Hoare triple {19846#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {20114#(< main_~a~0 100000)} is VALID [2018-11-18 22:53:24,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {20114#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20118#(<= main_~a~0 100000)} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 81: Hoare triple {20118#(<= main_~a~0 100000)} assume true; {20118#(<= main_~a~0 100000)} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 82: Hoare triple {20118#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {19846#true} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 83: Hoare triple {19846#true} havoc ~i~0;~i~0 := 0; {19846#true} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 84: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 85: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 86: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,703 INFO L273 TraceCheckUtils]: 87: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 88: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 89: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 90: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 91: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 94: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 95: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,704 INFO L273 TraceCheckUtils]: 96: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 97: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 98: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 99: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 100: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 101: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,705 INFO L273 TraceCheckUtils]: 102: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 103: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 104: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 105: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 106: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 107: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 108: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 109: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {19846#true} is VALID [2018-11-18 22:53:24,706 INFO L273 TraceCheckUtils]: 110: Hoare triple {19846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19846#true} is VALID [2018-11-18 22:53:24,707 INFO L273 TraceCheckUtils]: 111: Hoare triple {19846#true} assume true; {19846#true} is VALID [2018-11-18 22:53:24,707 INFO L273 TraceCheckUtils]: 112: Hoare triple {19846#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20215#(< main_~i~0 100000)} is VALID [2018-11-18 22:53:24,707 INFO L273 TraceCheckUtils]: 113: Hoare triple {20215#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20219#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:24,708 INFO L273 TraceCheckUtils]: 114: Hoare triple {20219#(<= main_~i~0 100000)} assume true; {20219#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:24,708 INFO L273 TraceCheckUtils]: 115: Hoare triple {20219#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {19846#true} is VALID [2018-11-18 22:53:24,708 INFO L273 TraceCheckUtils]: 116: Hoare triple {19846#true} ~i~0 := 0; {20229#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:24,708 INFO L273 TraceCheckUtils]: 117: Hoare triple {20229#(<= main_~i~0 0)} assume true; {20229#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:24,709 INFO L273 TraceCheckUtils]: 118: Hoare triple {20229#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20229#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:24,709 INFO L273 TraceCheckUtils]: 119: Hoare triple {20229#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20239#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,709 INFO L273 TraceCheckUtils]: 120: Hoare triple {20239#(<= main_~i~0 1)} assume true; {20239#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,710 INFO L273 TraceCheckUtils]: 121: Hoare triple {20239#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20239#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,711 INFO L273 TraceCheckUtils]: 122: Hoare triple {20239#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20249#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:24,711 INFO L273 TraceCheckUtils]: 123: Hoare triple {20249#(<= main_~i~0 2)} assume true; {20249#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:24,712 INFO L273 TraceCheckUtils]: 124: Hoare triple {20249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20249#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:24,712 INFO L273 TraceCheckUtils]: 125: Hoare triple {20249#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20259#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:24,713 INFO L273 TraceCheckUtils]: 126: Hoare triple {20259#(<= main_~i~0 3)} assume true; {20259#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:24,713 INFO L273 TraceCheckUtils]: 127: Hoare triple {20259#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20259#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:24,714 INFO L273 TraceCheckUtils]: 128: Hoare triple {20259#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20269#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:24,715 INFO L273 TraceCheckUtils]: 129: Hoare triple {20269#(<= main_~i~0 4)} assume true; {20269#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:24,715 INFO L273 TraceCheckUtils]: 130: Hoare triple {20269#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20269#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:24,716 INFO L273 TraceCheckUtils]: 131: Hoare triple {20269#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20279#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:24,716 INFO L273 TraceCheckUtils]: 132: Hoare triple {20279#(<= main_~i~0 5)} assume true; {20279#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:24,717 INFO L273 TraceCheckUtils]: 133: Hoare triple {20279#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20279#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:24,717 INFO L273 TraceCheckUtils]: 134: Hoare triple {20279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20289#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:24,718 INFO L273 TraceCheckUtils]: 135: Hoare triple {20289#(<= main_~i~0 6)} assume true; {20289#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:24,718 INFO L273 TraceCheckUtils]: 136: Hoare triple {20289#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20289#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:24,719 INFO L273 TraceCheckUtils]: 137: Hoare triple {20289#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20299#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:24,720 INFO L273 TraceCheckUtils]: 138: Hoare triple {20299#(<= main_~i~0 7)} assume true; {20299#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:24,720 INFO L273 TraceCheckUtils]: 139: Hoare triple {20299#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20299#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:24,721 INFO L273 TraceCheckUtils]: 140: Hoare triple {20299#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20309#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:24,721 INFO L273 TraceCheckUtils]: 141: Hoare triple {20309#(<= main_~i~0 8)} assume true; {20309#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:24,722 INFO L273 TraceCheckUtils]: 142: Hoare triple {20309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20309#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:24,723 INFO L273 TraceCheckUtils]: 143: Hoare triple {20309#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20319#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:24,723 INFO L273 TraceCheckUtils]: 144: Hoare triple {20319#(<= main_~i~0 9)} assume true; {20319#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:24,724 INFO L273 TraceCheckUtils]: 145: Hoare triple {20319#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20319#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:24,724 INFO L273 TraceCheckUtils]: 146: Hoare triple {20319#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20329#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:24,725 INFO L273 TraceCheckUtils]: 147: Hoare triple {20329#(<= main_~i~0 10)} assume true; {20329#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:24,726 INFO L273 TraceCheckUtils]: 148: Hoare triple {20329#(<= main_~i~0 10)} assume !(~i~0 < 100000); {19847#false} is VALID [2018-11-18 22:53:24,726 INFO L273 TraceCheckUtils]: 149: Hoare triple {19847#false} havoc ~x~0;~x~0 := 0; {19847#false} is VALID [2018-11-18 22:53:24,726 INFO L273 TraceCheckUtils]: 150: Hoare triple {19847#false} assume true; {19847#false} is VALID [2018-11-18 22:53:24,726 INFO L273 TraceCheckUtils]: 151: Hoare triple {19847#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {19847#false} is VALID [2018-11-18 22:53:24,726 INFO L256 TraceCheckUtils]: 152: Hoare triple {19847#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {19847#false} is VALID [2018-11-18 22:53:24,727 INFO L273 TraceCheckUtils]: 153: Hoare triple {19847#false} ~cond := #in~cond; {19847#false} is VALID [2018-11-18 22:53:24,727 INFO L273 TraceCheckUtils]: 154: Hoare triple {19847#false} assume 0 == ~cond; {19847#false} is VALID [2018-11-18 22:53:24,727 INFO L273 TraceCheckUtils]: 155: Hoare triple {19847#false} assume !false; {19847#false} is VALID [2018-11-18 22:53:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 103 proven. 155 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2018-11-18 22:53:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 43 [2018-11-18 22:53:24,765 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 156 [2018-11-18 22:53:24,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:24,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-18 22:53:24,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:24,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 22:53:24,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 22:53:24,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:53:24,998 INFO L87 Difference]: Start difference. First operand 161 states and 164 transitions. Second operand 43 states. [2018-11-18 22:53:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:26,924 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-11-18 22:53:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 22:53:26,924 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 156 [2018-11-18 22:53:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:53:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 210 transitions. [2018-11-18 22:53:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:53:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 210 transitions. [2018-11-18 22:53:26,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 210 transitions. [2018-11-18 22:53:27,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:27,130 INFO L225 Difference]: With dead ends: 257 [2018-11-18 22:53:27,130 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 22:53:27,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=747, Invalid=2333, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 22:53:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 22:53:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-11-18 22:53:27,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:27,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 179 states. [2018-11-18 22:53:27,217 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 179 states. [2018-11-18 22:53:27,217 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 179 states. [2018-11-18 22:53:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:27,221 INFO L93 Difference]: Finished difference Result 179 states and 182 transitions. [2018-11-18 22:53:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 182 transitions. [2018-11-18 22:53:27,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:27,221 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 179 states. [2018-11-18 22:53:27,221 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 179 states. [2018-11-18 22:53:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:27,224 INFO L93 Difference]: Finished difference Result 179 states and 182 transitions. [2018-11-18 22:53:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 182 transitions. [2018-11-18 22:53:27,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:27,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:27,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:27,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 22:53:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 182 transitions. [2018-11-18 22:53:27,227 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 182 transitions. Word has length 156 [2018-11-18 22:53:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:27,227 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 182 transitions. [2018-11-18 22:53:27,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 22:53:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 182 transitions. [2018-11-18 22:53:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 22:53:27,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:27,229 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:27,229 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 3228289, now seen corresponding path program 25 times [2018-11-18 22:53:27,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:27,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:28,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {21336#true} call ULTIMATE.init(); {21336#true} is VALID [2018-11-18 22:53:28,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {21336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21336#true} is VALID [2018-11-18 22:53:28,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {21336#true} assume true; {21336#true} is VALID [2018-11-18 22:53:28,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21336#true} {21336#true} #81#return; {21336#true} is VALID [2018-11-18 22:53:28,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {21336#true} call #t~ret9 := main(); {21336#true} is VALID [2018-11-18 22:53:28,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {21336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {21338#(= main_~a~0 0)} is VALID [2018-11-18 22:53:28,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {21338#(= main_~a~0 0)} assume true; {21338#(= main_~a~0 0)} is VALID [2018-11-18 22:53:28,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {21338#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21338#(= main_~a~0 0)} is VALID [2018-11-18 22:53:28,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {21338#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:28,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {21339#(<= main_~a~0 1)} assume true; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:28,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {21339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:28,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {21339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:28,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {21340#(<= main_~a~0 2)} assume true; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:28,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {21340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:28,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {21340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:28,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {21341#(<= main_~a~0 3)} assume true; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:28,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {21341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:28,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {21341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:28,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {21342#(<= main_~a~0 4)} assume true; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:28,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {21342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:28,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {21342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:28,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {21343#(<= main_~a~0 5)} assume true; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:28,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {21343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:28,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {21343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:28,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {21344#(<= main_~a~0 6)} assume true; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:28,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {21344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:28,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {21344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:28,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {21345#(<= main_~a~0 7)} assume true; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:28,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {21345#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:28,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {21345#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:28,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {21346#(<= main_~a~0 8)} assume true; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:28,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {21346#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:28,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {21346#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:28,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {21347#(<= main_~a~0 9)} assume true; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:28,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {21347#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:28,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {21347#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:28,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {21348#(<= main_~a~0 10)} assume true; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:28,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {21348#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:28,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {21348#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:28,441 INFO L273 TraceCheckUtils]: 39: Hoare triple {21349#(<= main_~a~0 11)} assume true; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:28,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {21349#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:28,442 INFO L273 TraceCheckUtils]: 41: Hoare triple {21349#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:28,442 INFO L273 TraceCheckUtils]: 42: Hoare triple {21350#(<= main_~a~0 12)} assume true; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:28,443 INFO L273 TraceCheckUtils]: 43: Hoare triple {21350#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:28,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {21350#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:28,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {21351#(<= main_~a~0 13)} assume true; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:28,444 INFO L273 TraceCheckUtils]: 46: Hoare triple {21351#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:28,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {21351#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:28,446 INFO L273 TraceCheckUtils]: 48: Hoare triple {21352#(<= main_~a~0 14)} assume true; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:28,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {21352#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:28,447 INFO L273 TraceCheckUtils]: 50: Hoare triple {21352#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:28,447 INFO L273 TraceCheckUtils]: 51: Hoare triple {21353#(<= main_~a~0 15)} assume true; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:28,448 INFO L273 TraceCheckUtils]: 52: Hoare triple {21353#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:28,449 INFO L273 TraceCheckUtils]: 53: Hoare triple {21353#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:28,449 INFO L273 TraceCheckUtils]: 54: Hoare triple {21354#(<= main_~a~0 16)} assume true; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:28,450 INFO L273 TraceCheckUtils]: 55: Hoare triple {21354#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:28,450 INFO L273 TraceCheckUtils]: 56: Hoare triple {21354#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:28,451 INFO L273 TraceCheckUtils]: 57: Hoare triple {21355#(<= main_~a~0 17)} assume true; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:28,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {21355#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:28,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {21355#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:28,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {21356#(<= main_~a~0 18)} assume true; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:28,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {21356#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:28,454 INFO L273 TraceCheckUtils]: 62: Hoare triple {21356#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:28,454 INFO L273 TraceCheckUtils]: 63: Hoare triple {21357#(<= main_~a~0 19)} assume true; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:28,455 INFO L273 TraceCheckUtils]: 64: Hoare triple {21357#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:28,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {21357#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:28,456 INFO L273 TraceCheckUtils]: 66: Hoare triple {21358#(<= main_~a~0 20)} assume true; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:28,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {21358#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:28,457 INFO L273 TraceCheckUtils]: 68: Hoare triple {21358#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:28,458 INFO L273 TraceCheckUtils]: 69: Hoare triple {21359#(<= main_~a~0 21)} assume true; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:28,458 INFO L273 TraceCheckUtils]: 70: Hoare triple {21359#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:28,459 INFO L273 TraceCheckUtils]: 71: Hoare triple {21359#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:28,460 INFO L273 TraceCheckUtils]: 72: Hoare triple {21360#(<= main_~a~0 22)} assume true; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:28,460 INFO L273 TraceCheckUtils]: 73: Hoare triple {21360#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:28,461 INFO L273 TraceCheckUtils]: 74: Hoare triple {21360#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:28,461 INFO L273 TraceCheckUtils]: 75: Hoare triple {21361#(<= main_~a~0 23)} assume true; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:28,462 INFO L273 TraceCheckUtils]: 76: Hoare triple {21361#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:28,463 INFO L273 TraceCheckUtils]: 77: Hoare triple {21361#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:28,463 INFO L273 TraceCheckUtils]: 78: Hoare triple {21362#(<= main_~a~0 24)} assume true; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:28,464 INFO L273 TraceCheckUtils]: 79: Hoare triple {21362#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:28,464 INFO L273 TraceCheckUtils]: 80: Hoare triple {21362#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:28,465 INFO L273 TraceCheckUtils]: 81: Hoare triple {21363#(<= main_~a~0 25)} assume true; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:28,465 INFO L273 TraceCheckUtils]: 82: Hoare triple {21363#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:28,466 INFO L273 TraceCheckUtils]: 83: Hoare triple {21363#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:28,467 INFO L273 TraceCheckUtils]: 84: Hoare triple {21364#(<= main_~a~0 26)} assume true; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:28,467 INFO L273 TraceCheckUtils]: 85: Hoare triple {21364#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:28,468 INFO L273 TraceCheckUtils]: 86: Hoare triple {21364#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21365#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:28,468 INFO L273 TraceCheckUtils]: 87: Hoare triple {21365#(<= main_~a~0 27)} assume true; {21365#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:28,469 INFO L273 TraceCheckUtils]: 88: Hoare triple {21365#(<= main_~a~0 27)} assume !(~a~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:28,469 INFO L273 TraceCheckUtils]: 89: Hoare triple {21337#false} havoc ~i~0;~i~0 := 0; {21337#false} is VALID [2018-11-18 22:53:28,469 INFO L273 TraceCheckUtils]: 90: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 91: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 93: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 94: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 95: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,470 INFO L273 TraceCheckUtils]: 96: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,471 INFO L273 TraceCheckUtils]: 97: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,471 INFO L273 TraceCheckUtils]: 98: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,471 INFO L273 TraceCheckUtils]: 99: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,471 INFO L273 TraceCheckUtils]: 100: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,471 INFO L273 TraceCheckUtils]: 101: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 102: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 103: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 104: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 105: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 106: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 107: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 108: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 109: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,472 INFO L273 TraceCheckUtils]: 110: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 111: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 112: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 113: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 114: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 115: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 116: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 117: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 118: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,473 INFO L273 TraceCheckUtils]: 119: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 120: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 121: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 122: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 123: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 124: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 125: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 126: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 127: Hoare triple {21337#false} assume !(~i~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 128: Hoare triple {21337#false} ~i~0 := 0; {21337#false} is VALID [2018-11-18 22:53:28,474 INFO L273 TraceCheckUtils]: 129: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 130: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 131: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 132: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 133: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 134: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 135: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 136: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 137: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 138: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,475 INFO L273 TraceCheckUtils]: 139: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 140: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 141: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 142: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 143: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 144: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 145: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 146: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 147: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,476 INFO L273 TraceCheckUtils]: 148: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 149: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 150: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 151: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 152: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 153: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 154: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 155: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 156: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 157: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,477 INFO L273 TraceCheckUtils]: 158: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 159: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 160: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 161: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 162: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 163: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 164: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 165: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 166: Hoare triple {21337#false} assume !(~i~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:28,478 INFO L273 TraceCheckUtils]: 167: Hoare triple {21337#false} havoc ~x~0;~x~0 := 0; {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L273 TraceCheckUtils]: 168: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L273 TraceCheckUtils]: 169: Hoare triple {21337#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L256 TraceCheckUtils]: 170: Hoare triple {21337#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L273 TraceCheckUtils]: 171: Hoare triple {21337#false} ~cond := #in~cond; {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L273 TraceCheckUtils]: 172: Hoare triple {21337#false} assume 0 == ~cond; {21337#false} is VALID [2018-11-18 22:53:28,479 INFO L273 TraceCheckUtils]: 173: Hoare triple {21337#false} assume !false; {21337#false} is VALID [2018-11-18 22:53:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:28,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:28,495 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:53:28,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:28,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:29,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {21336#true} call ULTIMATE.init(); {21336#true} is VALID [2018-11-18 22:53:29,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {21336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21336#true} is VALID [2018-11-18 22:53:29,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {21336#true} assume true; {21336#true} is VALID [2018-11-18 22:53:29,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21336#true} {21336#true} #81#return; {21336#true} is VALID [2018-11-18 22:53:29,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {21336#true} call #t~ret9 := main(); {21336#true} is VALID [2018-11-18 22:53:29,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {21336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {21384#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:29,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {21384#(<= main_~a~0 0)} assume true; {21384#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:29,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {21384#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21384#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:29,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {21384#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:29,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {21339#(<= main_~a~0 1)} assume true; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:29,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {21339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21339#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:29,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {21339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:29,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {21340#(<= main_~a~0 2)} assume true; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:29,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {21340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21340#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:29,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {21340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:29,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {21341#(<= main_~a~0 3)} assume true; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:29,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {21341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21341#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:29,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {21341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:29,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {21342#(<= main_~a~0 4)} assume true; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:29,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {21342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21342#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:29,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {21342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:29,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {21343#(<= main_~a~0 5)} assume true; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:29,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {21343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21343#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:29,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {21343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:29,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {21344#(<= main_~a~0 6)} assume true; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:29,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {21344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21344#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:29,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {21344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:29,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {21345#(<= main_~a~0 7)} assume true; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:29,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {21345#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21345#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:29,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {21345#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:29,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {21346#(<= main_~a~0 8)} assume true; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:29,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {21346#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21346#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:29,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {21346#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:29,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {21347#(<= main_~a~0 9)} assume true; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:29,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {21347#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21347#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:29,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {21347#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:29,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {21348#(<= main_~a~0 10)} assume true; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:29,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {21348#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21348#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:29,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {21348#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:29,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {21349#(<= main_~a~0 11)} assume true; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:29,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {21349#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21349#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:29,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {21349#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:29,949 INFO L273 TraceCheckUtils]: 42: Hoare triple {21350#(<= main_~a~0 12)} assume true; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:29,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {21350#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21350#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:29,950 INFO L273 TraceCheckUtils]: 44: Hoare triple {21350#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:29,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {21351#(<= main_~a~0 13)} assume true; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:29,951 INFO L273 TraceCheckUtils]: 46: Hoare triple {21351#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21351#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:29,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {21351#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:29,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {21352#(<= main_~a~0 14)} assume true; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:29,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {21352#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21352#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:29,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {21352#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:29,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {21353#(<= main_~a~0 15)} assume true; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:29,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {21353#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21353#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:29,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {21353#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:29,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {21354#(<= main_~a~0 16)} assume true; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:29,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {21354#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21354#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:29,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {21354#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:29,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {21355#(<= main_~a~0 17)} assume true; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:29,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {21355#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21355#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:29,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {21355#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:29,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {21356#(<= main_~a~0 18)} assume true; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:29,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {21356#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21356#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:29,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {21356#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:29,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {21357#(<= main_~a~0 19)} assume true; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:29,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {21357#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21357#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:29,963 INFO L273 TraceCheckUtils]: 65: Hoare triple {21357#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:29,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {21358#(<= main_~a~0 20)} assume true; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:29,964 INFO L273 TraceCheckUtils]: 67: Hoare triple {21358#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21358#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:29,964 INFO L273 TraceCheckUtils]: 68: Hoare triple {21358#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:29,965 INFO L273 TraceCheckUtils]: 69: Hoare triple {21359#(<= main_~a~0 21)} assume true; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:29,965 INFO L273 TraceCheckUtils]: 70: Hoare triple {21359#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21359#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:29,966 INFO L273 TraceCheckUtils]: 71: Hoare triple {21359#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:29,967 INFO L273 TraceCheckUtils]: 72: Hoare triple {21360#(<= main_~a~0 22)} assume true; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:29,967 INFO L273 TraceCheckUtils]: 73: Hoare triple {21360#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21360#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:29,968 INFO L273 TraceCheckUtils]: 74: Hoare triple {21360#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:29,968 INFO L273 TraceCheckUtils]: 75: Hoare triple {21361#(<= main_~a~0 23)} assume true; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:29,969 INFO L273 TraceCheckUtils]: 76: Hoare triple {21361#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21361#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:29,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {21361#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:29,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {21362#(<= main_~a~0 24)} assume true; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:29,971 INFO L273 TraceCheckUtils]: 79: Hoare triple {21362#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21362#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:29,971 INFO L273 TraceCheckUtils]: 80: Hoare triple {21362#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:29,972 INFO L273 TraceCheckUtils]: 81: Hoare triple {21363#(<= main_~a~0 25)} assume true; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:29,972 INFO L273 TraceCheckUtils]: 82: Hoare triple {21363#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21363#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:29,973 INFO L273 TraceCheckUtils]: 83: Hoare triple {21363#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:29,974 INFO L273 TraceCheckUtils]: 84: Hoare triple {21364#(<= main_~a~0 26)} assume true; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:29,974 INFO L273 TraceCheckUtils]: 85: Hoare triple {21364#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {21364#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:29,975 INFO L273 TraceCheckUtils]: 86: Hoare triple {21364#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21365#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:29,975 INFO L273 TraceCheckUtils]: 87: Hoare triple {21365#(<= main_~a~0 27)} assume true; {21365#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:29,976 INFO L273 TraceCheckUtils]: 88: Hoare triple {21365#(<= main_~a~0 27)} assume !(~a~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:29,976 INFO L273 TraceCheckUtils]: 89: Hoare triple {21337#false} havoc ~i~0;~i~0 := 0; {21337#false} is VALID [2018-11-18 22:53:29,976 INFO L273 TraceCheckUtils]: 90: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 91: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 92: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 93: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 94: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 95: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,977 INFO L273 TraceCheckUtils]: 96: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,978 INFO L273 TraceCheckUtils]: 97: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,978 INFO L273 TraceCheckUtils]: 98: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,978 INFO L273 TraceCheckUtils]: 99: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,978 INFO L273 TraceCheckUtils]: 100: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,978 INFO L273 TraceCheckUtils]: 101: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 102: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 103: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 104: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 105: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 106: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 108: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 109: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,979 INFO L273 TraceCheckUtils]: 110: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 111: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 112: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 113: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 114: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 115: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 116: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 117: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 118: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 119: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,980 INFO L273 TraceCheckUtils]: 120: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 121: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 122: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 123: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 124: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 125: Hoare triple {21337#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 126: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 127: Hoare triple {21337#false} assume !(~i~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 128: Hoare triple {21337#false} ~i~0 := 0; {21337#false} is VALID [2018-11-18 22:53:29,981 INFO L273 TraceCheckUtils]: 129: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 130: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 131: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 132: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 133: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 134: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 135: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 136: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 137: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 138: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,982 INFO L273 TraceCheckUtils]: 139: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 140: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 141: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 142: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 143: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 144: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 145: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 146: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 147: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 148: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,983 INFO L273 TraceCheckUtils]: 149: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 150: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 151: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 152: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 153: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 154: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 155: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 156: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 157: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,984 INFO L273 TraceCheckUtils]: 158: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 159: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 160: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 161: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 162: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 163: Hoare triple {21337#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 164: Hoare triple {21337#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 165: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 166: Hoare triple {21337#false} assume !(~i~0 < 100000); {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 167: Hoare triple {21337#false} havoc ~x~0;~x~0 := 0; {21337#false} is VALID [2018-11-18 22:53:29,985 INFO L273 TraceCheckUtils]: 168: Hoare triple {21337#false} assume true; {21337#false} is VALID [2018-11-18 22:53:29,986 INFO L273 TraceCheckUtils]: 169: Hoare triple {21337#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {21337#false} is VALID [2018-11-18 22:53:29,986 INFO L256 TraceCheckUtils]: 170: Hoare triple {21337#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {21337#false} is VALID [2018-11-18 22:53:29,986 INFO L273 TraceCheckUtils]: 171: Hoare triple {21337#false} ~cond := #in~cond; {21337#false} is VALID [2018-11-18 22:53:29,986 INFO L273 TraceCheckUtils]: 172: Hoare triple {21337#false} assume 0 == ~cond; {21337#false} is VALID [2018-11-18 22:53:29,986 INFO L273 TraceCheckUtils]: 173: Hoare triple {21337#false} assume !false; {21337#false} is VALID [2018-11-18 22:53:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:30,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:30,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-18 22:53:30,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 174 [2018-11-18 22:53:30,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:30,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 22:53:30,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:30,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 22:53:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 22:53:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:53:30,123 INFO L87 Difference]: Start difference. First operand 179 states and 182 transitions. Second operand 31 states. [2018-11-18 22:53:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:31,181 INFO L93 Difference]: Finished difference Result 273 states and 279 transitions. [2018-11-18 22:53:31,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:53:31,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 174 [2018-11-18 22:53:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:53:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 139 transitions. [2018-11-18 22:53:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:53:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 139 transitions. [2018-11-18 22:53:31,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 139 transitions. [2018-11-18 22:53:31,331 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:53:31,334 INFO L225 Difference]: With dead ends: 273 [2018-11-18 22:53:31,335 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 22:53:31,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:53:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 22:53:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-18 22:53:31,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:31,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 182 states. [2018-11-18 22:53:31,741 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 182 states. [2018-11-18 22:53:31,741 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 182 states. [2018-11-18 22:53:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:31,744 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-11-18 22:53:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 186 transitions. [2018-11-18 22:53:31,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:31,745 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 183 states. [2018-11-18 22:53:31,745 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 183 states. [2018-11-18 22:53:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:31,748 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-11-18 22:53:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 186 transitions. [2018-11-18 22:53:31,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:31,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:31,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:31,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 22:53:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-11-18 22:53:31,753 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 174 [2018-11-18 22:53:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:31,753 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-11-18 22:53:31,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 22:53:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-11-18 22:53:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 22:53:31,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:31,754 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:31,755 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:31,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash 186773476, now seen corresponding path program 26 times [2018-11-18 22:53:31,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:31,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:31,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:32,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {22862#true} call ULTIMATE.init(); {22862#true} is VALID [2018-11-18 22:53:32,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {22862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22862#true} is VALID [2018-11-18 22:53:32,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {22862#true} assume true; {22862#true} is VALID [2018-11-18 22:53:32,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22862#true} {22862#true} #81#return; {22862#true} is VALID [2018-11-18 22:53:32,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {22862#true} call #t~ret9 := main(); {22862#true} is VALID [2018-11-18 22:53:32,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {22862#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {22864#(= main_~a~0 0)} is VALID [2018-11-18 22:53:32,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {22864#(= main_~a~0 0)} assume true; {22864#(= main_~a~0 0)} is VALID [2018-11-18 22:53:32,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {22864#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22864#(= main_~a~0 0)} is VALID [2018-11-18 22:53:32,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {22864#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {22865#(<= main_~a~0 1)} assume true; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {22865#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {22865#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {22866#(<= main_~a~0 2)} assume true; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {22866#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {22866#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {22867#(<= main_~a~0 3)} assume true; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {22867#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {22867#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {22868#(<= main_~a~0 4)} assume true; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {22868#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {22868#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {22869#(<= main_~a~0 5)} assume true; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {22869#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {22869#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {22870#(<= main_~a~0 6)} assume true; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {22870#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {22870#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {22871#(<= main_~a~0 7)} assume true; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {22871#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {22871#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {22872#(<= main_~a~0 8)} assume true; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {22872#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {22872#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {22873#(<= main_~a~0 9)} assume true; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {22873#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {22873#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {22874#(<= main_~a~0 10)} assume true; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {22874#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {22874#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,320 INFO L273 TraceCheckUtils]: 39: Hoare triple {22875#(<= main_~a~0 11)} assume true; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,321 INFO L273 TraceCheckUtils]: 40: Hoare triple {22875#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {22875#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {22876#(<= main_~a~0 12)} assume true; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {22876#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {22876#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {22877#(<= main_~a~0 13)} assume true; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {22877#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {22877#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {22878#(<= main_~a~0 14)} assume true; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {22878#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {22878#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,327 INFO L273 TraceCheckUtils]: 51: Hoare triple {22879#(<= main_~a~0 15)} assume true; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {22879#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,328 INFO L273 TraceCheckUtils]: 53: Hoare triple {22879#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {22880#(<= main_~a~0 16)} assume true; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {22880#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,330 INFO L273 TraceCheckUtils]: 56: Hoare triple {22880#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,331 INFO L273 TraceCheckUtils]: 57: Hoare triple {22881#(<= main_~a~0 17)} assume true; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,331 INFO L273 TraceCheckUtils]: 58: Hoare triple {22881#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {22881#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,332 INFO L273 TraceCheckUtils]: 60: Hoare triple {22882#(<= main_~a~0 18)} assume true; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,333 INFO L273 TraceCheckUtils]: 61: Hoare triple {22882#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {22882#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,334 INFO L273 TraceCheckUtils]: 63: Hoare triple {22883#(<= main_~a~0 19)} assume true; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {22883#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,335 INFO L273 TraceCheckUtils]: 65: Hoare triple {22883#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {22884#(<= main_~a~0 20)} assume true; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,336 INFO L273 TraceCheckUtils]: 67: Hoare triple {22884#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {22884#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {22885#(<= main_~a~0 21)} assume true; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {22885#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {22885#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {22886#(<= main_~a~0 22)} assume true; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {22886#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {22886#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {22887#(<= main_~a~0 23)} assume true; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,342 INFO L273 TraceCheckUtils]: 76: Hoare triple {22887#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,342 INFO L273 TraceCheckUtils]: 77: Hoare triple {22887#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {22888#(<= main_~a~0 24)} assume true; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,343 INFO L273 TraceCheckUtils]: 79: Hoare triple {22888#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {22888#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {22889#(<= main_~a~0 25)} assume true; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,345 INFO L273 TraceCheckUtils]: 82: Hoare triple {22889#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {22889#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {22890#(<= main_~a~0 26)} assume true; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,347 INFO L273 TraceCheckUtils]: 85: Hoare triple {22890#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {22890#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {22891#(<= main_~a~0 27)} assume true; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,349 INFO L273 TraceCheckUtils]: 88: Hoare triple {22891#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,349 INFO L273 TraceCheckUtils]: 89: Hoare triple {22891#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22892#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:32,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {22892#(<= main_~a~0 28)} assume true; {22892#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 91: Hoare triple {22892#(<= main_~a~0 28)} assume !(~a~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {22863#false} havoc ~i~0;~i~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 93: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 94: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 95: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,351 INFO L273 TraceCheckUtils]: 96: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,352 INFO L273 TraceCheckUtils]: 97: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,352 INFO L273 TraceCheckUtils]: 98: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,352 INFO L273 TraceCheckUtils]: 99: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,352 INFO L273 TraceCheckUtils]: 100: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,352 INFO L273 TraceCheckUtils]: 101: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 102: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 103: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 104: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 105: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 106: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 108: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 109: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 110: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 111: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 112: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 113: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,354 INFO L273 TraceCheckUtils]: 114: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 115: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 116: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 117: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 118: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 119: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 120: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 121: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 122: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,355 INFO L273 TraceCheckUtils]: 123: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 124: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 125: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 126: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 127: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 128: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 129: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 130: Hoare triple {22863#false} assume !(~i~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 131: Hoare triple {22863#false} ~i~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 132: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,356 INFO L273 TraceCheckUtils]: 133: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 134: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 135: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 136: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 137: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 138: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 139: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 140: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 141: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,357 INFO L273 TraceCheckUtils]: 142: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 143: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 144: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 145: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 146: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 147: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 148: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 149: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 150: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 151: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,358 INFO L273 TraceCheckUtils]: 152: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 153: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 154: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 155: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 156: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 157: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 158: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 159: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 160: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 161: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,359 INFO L273 TraceCheckUtils]: 162: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 163: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 164: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 165: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 166: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 167: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 168: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 169: Hoare triple {22863#false} assume !(~i~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 170: Hoare triple {22863#false} havoc ~x~0;~x~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,360 INFO L273 TraceCheckUtils]: 171: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,361 INFO L273 TraceCheckUtils]: 172: Hoare triple {22863#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {22863#false} is VALID [2018-11-18 22:53:32,361 INFO L256 TraceCheckUtils]: 173: Hoare triple {22863#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {22863#false} is VALID [2018-11-18 22:53:32,361 INFO L273 TraceCheckUtils]: 174: Hoare triple {22863#false} ~cond := #in~cond; {22863#false} is VALID [2018-11-18 22:53:32,361 INFO L273 TraceCheckUtils]: 175: Hoare triple {22863#false} assume 0 == ~cond; {22863#false} is VALID [2018-11-18 22:53:32,361 INFO L273 TraceCheckUtils]: 176: Hoare triple {22863#false} assume !false; {22863#false} is VALID [2018-11-18 22:53:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:32,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:32,380 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:53:32,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:32,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:32,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:32,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:32,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {22862#true} call ULTIMATE.init(); {22862#true} is VALID [2018-11-18 22:53:32,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {22862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22862#true} is VALID [2018-11-18 22:53:32,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {22862#true} assume true; {22862#true} is VALID [2018-11-18 22:53:32,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22862#true} {22862#true} #81#return; {22862#true} is VALID [2018-11-18 22:53:32,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {22862#true} call #t~ret9 := main(); {22862#true} is VALID [2018-11-18 22:53:32,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {22862#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {22911#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:32,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {22911#(<= main_~a~0 0)} assume true; {22911#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:32,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {22911#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22911#(<= main_~a~0 0)} is VALID [2018-11-18 22:53:32,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {22911#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {22865#(<= main_~a~0 1)} assume true; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {22865#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22865#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:32,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {22865#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {22866#(<= main_~a~0 2)} assume true; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {22866#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22866#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:32,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {22866#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {22867#(<= main_~a~0 3)} assume true; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {22867#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22867#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:32,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {22867#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {22868#(<= main_~a~0 4)} assume true; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {22868#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22868#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:32,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {22868#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {22869#(<= main_~a~0 5)} assume true; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {22869#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22869#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:32,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {22869#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {22870#(<= main_~a~0 6)} assume true; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {22870#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22870#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:32,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {22870#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {22871#(<= main_~a~0 7)} assume true; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {22871#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22871#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:32,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {22871#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {22872#(<= main_~a~0 8)} assume true; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {22872#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22872#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:32,767 INFO L273 TraceCheckUtils]: 32: Hoare triple {22872#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {22873#(<= main_~a~0 9)} assume true; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {22873#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22873#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:32,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {22873#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {22874#(<= main_~a~0 10)} assume true; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {22874#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22874#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:32,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {22874#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {22875#(<= main_~a~0 11)} assume true; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {22875#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22875#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:32,772 INFO L273 TraceCheckUtils]: 41: Hoare triple {22875#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {22876#(<= main_~a~0 12)} assume true; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {22876#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22876#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:32,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {22876#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,775 INFO L273 TraceCheckUtils]: 45: Hoare triple {22877#(<= main_~a~0 13)} assume true; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,775 INFO L273 TraceCheckUtils]: 46: Hoare triple {22877#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22877#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:32,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {22877#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {22878#(<= main_~a~0 14)} assume true; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {22878#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22878#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:32,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {22878#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,778 INFO L273 TraceCheckUtils]: 51: Hoare triple {22879#(<= main_~a~0 15)} assume true; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {22879#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22879#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:32,779 INFO L273 TraceCheckUtils]: 53: Hoare triple {22879#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {22880#(<= main_~a~0 16)} assume true; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {22880#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22880#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:32,781 INFO L273 TraceCheckUtils]: 56: Hoare triple {22880#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {22881#(<= main_~a~0 17)} assume true; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {22881#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22881#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:32,783 INFO L273 TraceCheckUtils]: 59: Hoare triple {22881#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,783 INFO L273 TraceCheckUtils]: 60: Hoare triple {22882#(<= main_~a~0 18)} assume true; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {22882#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22882#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:32,785 INFO L273 TraceCheckUtils]: 62: Hoare triple {22882#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {22883#(<= main_~a~0 19)} assume true; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,786 INFO L273 TraceCheckUtils]: 64: Hoare triple {22883#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22883#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:32,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {22883#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,787 INFO L273 TraceCheckUtils]: 66: Hoare triple {22884#(<= main_~a~0 20)} assume true; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,787 INFO L273 TraceCheckUtils]: 67: Hoare triple {22884#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22884#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:32,788 INFO L273 TraceCheckUtils]: 68: Hoare triple {22884#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,789 INFO L273 TraceCheckUtils]: 69: Hoare triple {22885#(<= main_~a~0 21)} assume true; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,789 INFO L273 TraceCheckUtils]: 70: Hoare triple {22885#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22885#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:32,790 INFO L273 TraceCheckUtils]: 71: Hoare triple {22885#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,790 INFO L273 TraceCheckUtils]: 72: Hoare triple {22886#(<= main_~a~0 22)} assume true; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,791 INFO L273 TraceCheckUtils]: 73: Hoare triple {22886#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22886#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:32,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {22886#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {22887#(<= main_~a~0 23)} assume true; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,793 INFO L273 TraceCheckUtils]: 76: Hoare triple {22887#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22887#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:32,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {22887#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,794 INFO L273 TraceCheckUtils]: 78: Hoare triple {22888#(<= main_~a~0 24)} assume true; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,794 INFO L273 TraceCheckUtils]: 79: Hoare triple {22888#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22888#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:32,795 INFO L273 TraceCheckUtils]: 80: Hoare triple {22888#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,796 INFO L273 TraceCheckUtils]: 81: Hoare triple {22889#(<= main_~a~0 25)} assume true; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,796 INFO L273 TraceCheckUtils]: 82: Hoare triple {22889#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22889#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:32,797 INFO L273 TraceCheckUtils]: 83: Hoare triple {22889#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {22890#(<= main_~a~0 26)} assume true; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,798 INFO L273 TraceCheckUtils]: 85: Hoare triple {22890#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22890#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:32,799 INFO L273 TraceCheckUtils]: 86: Hoare triple {22890#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,799 INFO L273 TraceCheckUtils]: 87: Hoare triple {22891#(<= main_~a~0 27)} assume true; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,800 INFO L273 TraceCheckUtils]: 88: Hoare triple {22891#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {22891#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:32,800 INFO L273 TraceCheckUtils]: 89: Hoare triple {22891#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22892#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:32,801 INFO L273 TraceCheckUtils]: 90: Hoare triple {22892#(<= main_~a~0 28)} assume true; {22892#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:32,801 INFO L273 TraceCheckUtils]: 91: Hoare triple {22892#(<= main_~a~0 28)} assume !(~a~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,802 INFO L273 TraceCheckUtils]: 92: Hoare triple {22863#false} havoc ~i~0;~i~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,802 INFO L273 TraceCheckUtils]: 93: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,802 INFO L273 TraceCheckUtils]: 94: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,802 INFO L273 TraceCheckUtils]: 95: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,802 INFO L273 TraceCheckUtils]: 96: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 97: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 98: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 99: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 100: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 101: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,803 INFO L273 TraceCheckUtils]: 102: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 103: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 104: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 105: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 106: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 107: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 108: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,804 INFO L273 TraceCheckUtils]: 109: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 110: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 111: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 112: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 113: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 114: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 115: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 116: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 117: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 118: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,805 INFO L273 TraceCheckUtils]: 119: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 120: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 121: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 122: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 123: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 124: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 125: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 126: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 127: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 128: Hoare triple {22863#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22863#false} is VALID [2018-11-18 22:53:32,806 INFO L273 TraceCheckUtils]: 129: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 130: Hoare triple {22863#false} assume !(~i~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 131: Hoare triple {22863#false} ~i~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 132: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 133: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 134: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 135: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 136: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 137: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,807 INFO L273 TraceCheckUtils]: 138: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 139: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 140: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 141: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 142: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 143: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 144: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 145: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 146: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 147: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,808 INFO L273 TraceCheckUtils]: 148: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 149: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 150: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 151: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 152: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 153: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 154: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 155: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 156: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,809 INFO L273 TraceCheckUtils]: 157: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 158: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 159: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 160: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 161: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 162: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 163: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 164: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 165: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 166: Hoare triple {22863#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {22863#false} is VALID [2018-11-18 22:53:32,810 INFO L273 TraceCheckUtils]: 167: Hoare triple {22863#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 168: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 169: Hoare triple {22863#false} assume !(~i~0 < 100000); {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 170: Hoare triple {22863#false} havoc ~x~0;~x~0 := 0; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 171: Hoare triple {22863#false} assume true; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 172: Hoare triple {22863#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L256 TraceCheckUtils]: 173: Hoare triple {22863#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 174: Hoare triple {22863#false} ~cond := #in~cond; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 175: Hoare triple {22863#false} assume 0 == ~cond; {22863#false} is VALID [2018-11-18 22:53:32,811 INFO L273 TraceCheckUtils]: 176: Hoare triple {22863#false} assume !false; {22863#false} is VALID [2018-11-18 22:53:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:32,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:32,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-18 22:53:32,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 177 [2018-11-18 22:53:32,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:32,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:53:32,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:32,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:53:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:53:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:53:32,984 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 32 states. [2018-11-18 22:53:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,160 INFO L93 Difference]: Finished difference Result 276 states and 282 transitions. [2018-11-18 22:53:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 22:53:34,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 177 [2018-11-18 22:53:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:53:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 142 transitions. [2018-11-18 22:53:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:53:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 142 transitions. [2018-11-18 22:53:34,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 142 transitions. [2018-11-18 22:53:34,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:34,293 INFO L225 Difference]: With dead ends: 276 [2018-11-18 22:53:34,293 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 22:53:34,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:53:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 22:53:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-11-18 22:53:34,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:34,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 185 states. [2018-11-18 22:53:34,361 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 185 states. [2018-11-18 22:53:34,361 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 185 states. [2018-11-18 22:53:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,365 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-11-18 22:53:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-11-18 22:53:34,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:34,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:34,366 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 186 states. [2018-11-18 22:53:34,366 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 186 states. [2018-11-18 22:53:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,370 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-11-18 22:53:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-11-18 22:53:34,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:34,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:34,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:34,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 22:53:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2018-11-18 22:53:34,374 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 177 [2018-11-18 22:53:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:34,374 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2018-11-18 22:53:34,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 22:53:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2018-11-18 22:53:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 22:53:34,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:34,376 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:34,376 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 688071585, now seen corresponding path program 27 times [2018-11-18 22:53:34,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:34,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:35,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {24412#true} call ULTIMATE.init(); {24412#true} is VALID [2018-11-18 22:53:35,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {24412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24412#true} is VALID [2018-11-18 22:53:35,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {24412#true} assume true; {24412#true} is VALID [2018-11-18 22:53:35,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24412#true} {24412#true} #81#return; {24412#true} is VALID [2018-11-18 22:53:35,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {24412#true} call #t~ret9 := main(); {24412#true} is VALID [2018-11-18 22:53:35,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {24412#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {24414#(= main_~a~0 0)} is VALID [2018-11-18 22:53:35,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {24414#(= main_~a~0 0)} assume true; {24414#(= main_~a~0 0)} is VALID [2018-11-18 22:53:35,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {24414#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24414#(= main_~a~0 0)} is VALID [2018-11-18 22:53:35,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {24414#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24415#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:35,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {24415#(<= main_~a~0 1)} assume true; {24415#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:35,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {24415#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24415#(<= main_~a~0 1)} is VALID [2018-11-18 22:53:35,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {24415#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24416#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:35,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {24416#(<= main_~a~0 2)} assume true; {24416#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:35,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {24416#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24416#(<= main_~a~0 2)} is VALID [2018-11-18 22:53:35,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {24416#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24417#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:35,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {24417#(<= main_~a~0 3)} assume true; {24417#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:35,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {24417#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24417#(<= main_~a~0 3)} is VALID [2018-11-18 22:53:35,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {24417#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24418#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:35,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {24418#(<= main_~a~0 4)} assume true; {24418#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:35,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {24418#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24418#(<= main_~a~0 4)} is VALID [2018-11-18 22:53:35,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {24418#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24419#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:35,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {24419#(<= main_~a~0 5)} assume true; {24419#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:35,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {24419#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24419#(<= main_~a~0 5)} is VALID [2018-11-18 22:53:35,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {24419#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24420#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:35,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {24420#(<= main_~a~0 6)} assume true; {24420#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:35,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {24420#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24420#(<= main_~a~0 6)} is VALID [2018-11-18 22:53:35,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {24420#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24421#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:35,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {24421#(<= main_~a~0 7)} assume true; {24421#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:35,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {24421#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24421#(<= main_~a~0 7)} is VALID [2018-11-18 22:53:35,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {24421#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24422#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:35,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {24422#(<= main_~a~0 8)} assume true; {24422#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:35,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {24422#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24422#(<= main_~a~0 8)} is VALID [2018-11-18 22:53:35,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {24422#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24423#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:35,289 INFO L273 TraceCheckUtils]: 33: Hoare triple {24423#(<= main_~a~0 9)} assume true; {24423#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:35,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {24423#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24423#(<= main_~a~0 9)} is VALID [2018-11-18 22:53:35,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {24423#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24424#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:35,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {24424#(<= main_~a~0 10)} assume true; {24424#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:35,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {24424#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24424#(<= main_~a~0 10)} is VALID [2018-11-18 22:53:35,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {24424#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24425#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:35,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {24425#(<= main_~a~0 11)} assume true; {24425#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:35,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {24425#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24425#(<= main_~a~0 11)} is VALID [2018-11-18 22:53:35,294 INFO L273 TraceCheckUtils]: 41: Hoare triple {24425#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24426#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:35,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {24426#(<= main_~a~0 12)} assume true; {24426#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:35,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {24426#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24426#(<= main_~a~0 12)} is VALID [2018-11-18 22:53:35,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {24426#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24427#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:35,296 INFO L273 TraceCheckUtils]: 45: Hoare triple {24427#(<= main_~a~0 13)} assume true; {24427#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:35,297 INFO L273 TraceCheckUtils]: 46: Hoare triple {24427#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24427#(<= main_~a~0 13)} is VALID [2018-11-18 22:53:35,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {24427#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24428#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:35,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {24428#(<= main_~a~0 14)} assume true; {24428#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:35,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {24428#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24428#(<= main_~a~0 14)} is VALID [2018-11-18 22:53:35,299 INFO L273 TraceCheckUtils]: 50: Hoare triple {24428#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24429#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:35,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {24429#(<= main_~a~0 15)} assume true; {24429#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:35,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {24429#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24429#(<= main_~a~0 15)} is VALID [2018-11-18 22:53:35,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {24429#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24430#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:35,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {24430#(<= main_~a~0 16)} assume true; {24430#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:35,302 INFO L273 TraceCheckUtils]: 55: Hoare triple {24430#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24430#(<= main_~a~0 16)} is VALID [2018-11-18 22:53:35,303 INFO L273 TraceCheckUtils]: 56: Hoare triple {24430#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24431#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:35,303 INFO L273 TraceCheckUtils]: 57: Hoare triple {24431#(<= main_~a~0 17)} assume true; {24431#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:35,304 INFO L273 TraceCheckUtils]: 58: Hoare triple {24431#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24431#(<= main_~a~0 17)} is VALID [2018-11-18 22:53:35,304 INFO L273 TraceCheckUtils]: 59: Hoare triple {24431#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24432#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:35,305 INFO L273 TraceCheckUtils]: 60: Hoare triple {24432#(<= main_~a~0 18)} assume true; {24432#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:35,305 INFO L273 TraceCheckUtils]: 61: Hoare triple {24432#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24432#(<= main_~a~0 18)} is VALID [2018-11-18 22:53:35,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {24432#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24433#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:35,307 INFO L273 TraceCheckUtils]: 63: Hoare triple {24433#(<= main_~a~0 19)} assume true; {24433#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:35,307 INFO L273 TraceCheckUtils]: 64: Hoare triple {24433#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24433#(<= main_~a~0 19)} is VALID [2018-11-18 22:53:35,308 INFO L273 TraceCheckUtils]: 65: Hoare triple {24433#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24434#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:35,308 INFO L273 TraceCheckUtils]: 66: Hoare triple {24434#(<= main_~a~0 20)} assume true; {24434#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:35,309 INFO L273 TraceCheckUtils]: 67: Hoare triple {24434#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24434#(<= main_~a~0 20)} is VALID [2018-11-18 22:53:35,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {24434#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24435#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:35,310 INFO L273 TraceCheckUtils]: 69: Hoare triple {24435#(<= main_~a~0 21)} assume true; {24435#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:35,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {24435#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24435#(<= main_~a~0 21)} is VALID [2018-11-18 22:53:35,311 INFO L273 TraceCheckUtils]: 71: Hoare triple {24435#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24436#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:35,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {24436#(<= main_~a~0 22)} assume true; {24436#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:35,312 INFO L273 TraceCheckUtils]: 73: Hoare triple {24436#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24436#(<= main_~a~0 22)} is VALID [2018-11-18 22:53:35,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {24436#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24437#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:35,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {24437#(<= main_~a~0 23)} assume true; {24437#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:35,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {24437#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24437#(<= main_~a~0 23)} is VALID [2018-11-18 22:53:35,315 INFO L273 TraceCheckUtils]: 77: Hoare triple {24437#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24438#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:35,315 INFO L273 TraceCheckUtils]: 78: Hoare triple {24438#(<= main_~a~0 24)} assume true; {24438#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:35,316 INFO L273 TraceCheckUtils]: 79: Hoare triple {24438#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24438#(<= main_~a~0 24)} is VALID [2018-11-18 22:53:35,317 INFO L273 TraceCheckUtils]: 80: Hoare triple {24438#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24439#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:35,317 INFO L273 TraceCheckUtils]: 81: Hoare triple {24439#(<= main_~a~0 25)} assume true; {24439#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:35,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {24439#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24439#(<= main_~a~0 25)} is VALID [2018-11-18 22:53:35,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {24439#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24440#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:35,319 INFO L273 TraceCheckUtils]: 84: Hoare triple {24440#(<= main_~a~0 26)} assume true; {24440#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:35,319 INFO L273 TraceCheckUtils]: 85: Hoare triple {24440#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24440#(<= main_~a~0 26)} is VALID [2018-11-18 22:53:35,320 INFO L273 TraceCheckUtils]: 86: Hoare triple {24440#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24441#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:35,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {24441#(<= main_~a~0 27)} assume true; {24441#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:35,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {24441#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24441#(<= main_~a~0 27)} is VALID [2018-11-18 22:53:35,322 INFO L273 TraceCheckUtils]: 89: Hoare triple {24441#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24442#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:35,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {24442#(<= main_~a~0 28)} assume true; {24442#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:35,323 INFO L273 TraceCheckUtils]: 91: Hoare triple {24442#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {24442#(<= main_~a~0 28)} is VALID [2018-11-18 22:53:35,324 INFO L273 TraceCheckUtils]: 92: Hoare triple {24442#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {24443#(<= main_~a~0 29)} is VALID [2018-11-18 22:53:35,324 INFO L273 TraceCheckUtils]: 93: Hoare triple {24443#(<= main_~a~0 29)} assume true; {24443#(<= main_~a~0 29)} is VALID [2018-11-18 22:53:35,325 INFO L273 TraceCheckUtils]: 94: Hoare triple {24443#(<= main_~a~0 29)} assume !(~a~0 < 100000); {24413#false} is VALID [2018-11-18 22:53:35,325 INFO L273 TraceCheckUtils]: 95: Hoare triple {24413#false} havoc ~i~0;~i~0 := 0; {24413#false} is VALID [2018-11-18 22:53:35,325 INFO L273 TraceCheckUtils]: 96: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,325 INFO L273 TraceCheckUtils]: 97: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,325 INFO L273 TraceCheckUtils]: 98: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,326 INFO L273 TraceCheckUtils]: 99: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,326 INFO L273 TraceCheckUtils]: 100: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,326 INFO L273 TraceCheckUtils]: 101: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,326 INFO L273 TraceCheckUtils]: 102: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,326 INFO L273 TraceCheckUtils]: 103: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 104: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 105: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 106: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 107: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 108: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,327 INFO L273 TraceCheckUtils]: 109: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,328 INFO L273 TraceCheckUtils]: 110: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,328 INFO L273 TraceCheckUtils]: 111: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,328 INFO L273 TraceCheckUtils]: 112: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,328 INFO L273 TraceCheckUtils]: 113: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,328 INFO L273 TraceCheckUtils]: 114: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 115: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 116: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 117: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 118: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 119: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,329 INFO L273 TraceCheckUtils]: 120: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 121: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 122: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 123: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 124: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 125: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 126: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 127: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,330 INFO L273 TraceCheckUtils]: 128: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 129: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 130: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 131: Hoare triple {24413#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 132: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 133: Hoare triple {24413#false} assume !(~i~0 < 100000); {24413#false} is VALID [2018-11-18 22:53:35,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {24413#false} ~i~0 := 0; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 135: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 136: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 137: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 138: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 139: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,332 INFO L273 TraceCheckUtils]: 140: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 141: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 142: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 143: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 144: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 145: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,333 INFO L273 TraceCheckUtils]: 146: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 147: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 148: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 149: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 150: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 151: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 152: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,334 INFO L273 TraceCheckUtils]: 153: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 154: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 155: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 156: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 157: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 158: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,335 INFO L273 TraceCheckUtils]: 159: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 160: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 161: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 162: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 163: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 164: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,336 INFO L273 TraceCheckUtils]: 165: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 166: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 167: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 168: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 169: Hoare triple {24413#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 170: Hoare triple {24413#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#false} is VALID [2018-11-18 22:53:35,337 INFO L273 TraceCheckUtils]: 171: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L273 TraceCheckUtils]: 172: Hoare triple {24413#false} assume !(~i~0 < 100000); {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L273 TraceCheckUtils]: 173: Hoare triple {24413#false} havoc ~x~0;~x~0 := 0; {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L273 TraceCheckUtils]: 174: Hoare triple {24413#false} assume true; {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L273 TraceCheckUtils]: 175: Hoare triple {24413#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L256 TraceCheckUtils]: 176: Hoare triple {24413#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {24413#false} is VALID [2018-11-18 22:53:35,338 INFO L273 TraceCheckUtils]: 177: Hoare triple {24413#false} ~cond := #in~cond; {24413#false} is VALID [2018-11-18 22:53:35,339 INFO L273 TraceCheckUtils]: 178: Hoare triple {24413#false} assume 0 == ~cond; {24413#false} is VALID [2018-11-18 22:53:35,339 INFO L273 TraceCheckUtils]: 179: Hoare triple {24413#false} assume !false; {24413#false} is VALID [2018-11-18 22:53:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:35,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:35,360 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:53:35,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2