java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:41:39,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:41:39,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:41:39,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:41:39,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:41:39,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:41:39,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:41:39,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:41:39,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:41:39,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:41:39,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:41:39,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:41:39,754 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:41:39,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:41:39,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:41:39,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:41:39,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:41:39,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:41:39,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:41:39,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:41:39,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:41:39,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:41:39,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:41:39,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:41:39,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:41:39,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:41:39,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:41:39,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:41:39,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:41:39,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:41:39,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:41:39,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:41:39,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:41:39,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:41:39,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:41:39,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:41:39,783 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:41:39,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:41:39,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:41:39,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:41:39,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:41:39,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:41:39,803 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:41:39,804 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:41:39,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:41:39,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:41:39,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:41:39,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:41:39,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:41:39,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:41:39,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:41:39,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:41:39,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:41:39,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:41:39,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:41:39,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:41:39,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:41:39,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:41:39,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:41:39,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:41:39,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:41:39,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:41:39,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:41:39,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:41:39,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:41:39,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:41:39,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:41:39,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:41:39,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:41:39,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:41:39,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:41:39,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:41:39,880 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:41:39,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 18:41:39,940 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f30e865/adaeb3394afb4897a403b81408cf2878/FLAG5aeed94b8 [2018-11-14 18:41:40,423 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:41:40,424 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 18:41:40,430 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f30e865/adaeb3394afb4897a403b81408cf2878/FLAG5aeed94b8 [2018-11-14 18:41:40,446 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f30e865/adaeb3394afb4897a403b81408cf2878 [2018-11-14 18:41:40,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:41:40,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:41:40,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:40,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:41:40,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:41:40,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f0d61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40, skipping insertion in model container [2018-11-14 18:41:40,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:41:40,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:41:40,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:40,702 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:41:40,751 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:41:40,777 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:41:40,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40 WrapperNode [2018-11-14 18:41:40,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:41:40,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:41:40,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:41:40,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:41:40,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... [2018-11-14 18:41:40,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:41:40,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:41:40,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:41:40,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:41:40,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:41:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:41:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:41:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:41:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:41:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:41:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:41:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:41:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:41:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:41:41,981 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:41:41,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:41 BoogieIcfgContainer [2018-11-14 18:41:41,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:41:41,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:41:41,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:41:41,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:41:41,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:41:40" (1/3) ... [2018-11-14 18:41:41,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c5ae1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:41, skipping insertion in model container [2018-11-14 18:41:41,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:41:40" (2/3) ... [2018-11-14 18:41:41,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c5ae1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:41:41, skipping insertion in model container [2018-11-14 18:41:41,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:41:41" (3/3) ... [2018-11-14 18:41:41,995 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_true-unreach-call_ground.i [2018-11-14 18:41:42,005 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:41:42,013 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:41:42,027 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:41:42,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:41:42,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:41:42,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:41:42,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:41:42,060 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:41:42,060 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:41:42,060 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:41:42,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:41:42,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:41:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 18:41:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:41:42,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:42,088 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, 1] [2018-11-14 18:41:42,090 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:42,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1721942648, now seen corresponding path program 1 times [2018-11-14 18:41:42,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:42,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:42,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:42,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 18:41:42,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-14 18:41:42,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 18:41:42,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #111#return; {45#true} is VALID [2018-11-14 18:41:42,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret13 := main(); {45#true} is VALID [2018-11-14 18:41:42,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {45#true} is VALID [2018-11-14 18:41:42,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 18:41:42,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0; {46#false} is VALID [2018-11-14 18:41:42,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 18:41:42,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 18:41:42,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 18:41:42,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 18:41:42,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 18:41:42,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 18:41:42,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 18:41:42,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} havoc ~x~0;~x~0 := 0; {46#false} is VALID [2018-11-14 18:41:42,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 18:41:42,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {46#false} is VALID [2018-11-14 18:41:42,275 INFO L256 TraceCheckUtils]: 18: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {46#false} is VALID [2018-11-14 18:41:42,275 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-14 18:41:42,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume ~cond == 0; {46#false} is VALID [2018-11-14 18:41:42,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 18:41:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:41:42,294 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 18:41:42,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:42,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:41:42,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:42,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:41:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:41:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:41:42,407 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 18:41:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:42,583 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-14 18:41:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:41:42,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 18:41:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 18:41:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:41:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 18:41:42,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 18:41:42,884 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-14 18:41:42,899 INFO L225 Difference]: With dead ends: 75 [2018-11-14 18:41:42,900 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 18:41:42,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:41:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 18:41:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 18:41:43,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:43,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 18:41:43,099 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 18:41:43,099 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 18:41:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:43,105 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 18:41:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 18:41:43,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:43,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:43,107 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 18:41:43,107 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 18:41:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:43,112 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 18:41:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 18:41:43,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:43,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:43,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:43,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:41:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 18:41:43,119 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2018-11-14 18:41:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:43,120 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 18:41:43,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:41:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 18:41:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:41:43,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:43,122 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, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:43,122 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:43,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash 20971825, now seen corresponding path program 1 times [2018-11-14 18:41:43,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:43,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:43,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-14 18:41:43,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {266#true} is VALID [2018-11-14 18:41:43,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 18:41:43,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #111#return; {266#true} is VALID [2018-11-14 18:41:43,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret13 := main(); {266#true} is VALID [2018-11-14 18:41:43,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {268#(= main_~a~0 0)} is VALID [2018-11-14 18:41:43,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#(= main_~a~0 0)} assume true; {268#(= main_~a~0 0)} is VALID [2018-11-14 18:41:43,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(= main_~a~0 0)} assume !(~a~0 < 100000); {267#false} is VALID [2018-11-14 18:41:43,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {267#false} havoc ~i~0;~i~0 := 0; {267#false} is VALID [2018-11-14 18:41:43,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 18:41:43,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 18:41:43,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 18:41:43,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 18:41:43,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 18:41:43,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 18:41:43,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 18:41:43,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 18:41:43,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 18:41:43,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 18:41:43,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 18:41:43,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {267#false} havoc ~x~0;~x~0 := 0; {267#false} is VALID [2018-11-14 18:41:43,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 18:41:43,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {267#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {267#false} is VALID [2018-11-14 18:41:43,324 INFO L256 TraceCheckUtils]: 23: Hoare triple {267#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {267#false} is VALID [2018-11-14 18:41:43,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2018-11-14 18:41:43,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {267#false} assume ~cond == 0; {267#false} is VALID [2018-11-14 18:41:43,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-14 18:41:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:41:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:43,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:41:43,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:41:43,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:43,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:41:43,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:41:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:41:43,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:43,379 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 3 states. [2018-11-14 18:41:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:43,972 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-14 18:41:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:41:43,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:41:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 18:41:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 18:41:43,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-14 18:41:44,150 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-14 18:41:44,154 INFO L225 Difference]: With dead ends: 68 [2018-11-14 18:41:44,154 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:41:44,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:41:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-14 18:41:44,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:44,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-14 18:41:44,179 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-14 18:41:44,179 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-14 18:41:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,182 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 18:41:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 18:41:44,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,183 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-14 18:41:44,183 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-14 18:41:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,187 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 18:41:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 18:41:44,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:44,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:41:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 18:41:44,191 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-11-14 18:41:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:44,192 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 18:41:44,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:41:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:41:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:41:44,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:44,193 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, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:44,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:44,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1906612018, now seen corresponding path program 1 times [2018-11-14 18:41:44,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:44,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2018-11-14 18:41:44,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {491#true} is VALID [2018-11-14 18:41:44,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 18:41:44,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #111#return; {491#true} is VALID [2018-11-14 18:41:44,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret13 := main(); {491#true} is VALID [2018-11-14 18:41:44,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {491#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {491#true} is VALID [2018-11-14 18:41:44,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 18:41:44,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {491#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {491#true} is VALID [2018-11-14 18:41:44,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {491#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {491#true} is VALID [2018-11-14 18:41:44,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 18:41:44,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {491#true} assume !(~a~0 < 100000); {491#true} is VALID [2018-11-14 18:41:44,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {491#true} havoc ~i~0;~i~0 := 0; {493#(= main_~i~0 0)} is VALID [2018-11-14 18:41:44,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#(= main_~i~0 0)} assume true; {493#(= main_~i~0 0)} is VALID [2018-11-14 18:41:44,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#(= main_~i~0 0)} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 18:41:44,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 18:41:44,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 18:41:44,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 18:41:44,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 18:41:44,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 18:41:44,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 18:41:44,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 18:41:44,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 18:41:44,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 18:41:44,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {492#false} havoc ~x~0;~x~0 := 0; {492#false} is VALID [2018-11-14 18:41:44,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 18:41:44,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {492#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {492#false} is VALID [2018-11-14 18:41:44,285 INFO L256 TraceCheckUtils]: 26: Hoare triple {492#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {492#false} is VALID [2018-11-14 18:41:44,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2018-11-14 18:41:44,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {492#false} assume ~cond == 0; {492#false} is VALID [2018-11-14 18:41:44,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {492#false} assume !false; {492#false} is VALID [2018-11-14 18:41:44,288 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-14 18:41:44,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:41:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:41:44,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:41:44,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:44,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:41:44,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:44,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:41:44,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:41:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:44,375 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-14 18:41:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,645 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-14 18:41:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:41:44,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:41:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 18:41:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:41:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 18:41:44,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-14 18:41:44,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:44,797 INFO L225 Difference]: With dead ends: 75 [2018-11-14 18:41:44,798 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:41:44,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:41:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:41:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 18:41:44,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:44,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 18:41:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 18:41:44,849 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 18:41:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,853 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:41:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 18:41:44,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,854 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 18:41:44,855 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 18:41:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:44,858 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:41:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 18:41:44,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:44,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:44,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:44,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:41:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-14 18:41:44,863 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 30 [2018-11-14 18:41:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:44,863 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-14 18:41:44,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:41:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 18:41:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:41:44,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:44,865 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:44,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:44,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -50907604, now seen corresponding path program 1 times [2018-11-14 18:41:44,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:44,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:45,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 18:41:45,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {760#true} is VALID [2018-11-14 18:41:45,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 18:41:45,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #111#return; {760#true} is VALID [2018-11-14 18:41:45,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret13 := main(); {760#true} is VALID [2018-11-14 18:41:45,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {760#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {762#(= main_~a~0 0)} is VALID [2018-11-14 18:41:45,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#(= main_~a~0 0)} assume true; {762#(= main_~a~0 0)} is VALID [2018-11-14 18:41:45,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {762#(= main_~a~0 0)} is VALID [2018-11-14 18:41:45,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {762#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {763#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:45,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {763#(<= main_~a~0 1)} assume true; {763#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:45,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {763#(<= main_~a~0 1)} assume !(~a~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {761#false} havoc ~i~0;~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {761#false} is VALID [2018-11-14 18:41:45,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {761#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {761#false} is VALID [2018-11-14 18:41:45,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {761#false} is VALID [2018-11-14 18:41:45,052 INFO L273 TraceCheckUtils]: 20: Hoare triple {761#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {761#false} is VALID [2018-11-14 18:41:45,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {761#false} is VALID [2018-11-14 18:41:45,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {761#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {761#false} is VALID [2018-11-14 18:41:45,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,055 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {761#false} is VALID [2018-11-14 18:41:45,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {761#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {761#false} is VALID [2018-11-14 18:41:45,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {761#false} havoc ~x~0;~x~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,058 INFO L273 TraceCheckUtils]: 37: Hoare triple {761#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {761#false} is VALID [2018-11-14 18:41:45,058 INFO L256 TraceCheckUtils]: 38: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {761#false} is VALID [2018-11-14 18:41:45,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 18:41:45,059 INFO L273 TraceCheckUtils]: 40: Hoare triple {761#false} assume ~cond == 0; {761#false} is VALID [2018-11-14 18:41:45,059 INFO L273 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 18:41:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:41:45,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:45,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:45,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:45,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:45,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 18:41:45,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {760#true} is VALID [2018-11-14 18:41:45,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 18:41:45,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #111#return; {760#true} is VALID [2018-11-14 18:41:45,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret13 := main(); {760#true} is VALID [2018-11-14 18:41:45,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {760#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {782#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:45,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#(<= main_~a~0 0)} assume true; {782#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:45,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {782#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:45,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {782#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {763#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:45,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {763#(<= main_~a~0 1)} assume true; {763#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:45,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {763#(<= main_~a~0 1)} assume !(~a~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {761#false} havoc ~i~0;~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {761#false} is VALID [2018-11-14 18:41:45,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {761#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {761#false} is VALID [2018-11-14 18:41:45,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {761#false} is VALID [2018-11-14 18:41:45,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {761#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {761#false} is VALID [2018-11-14 18:41:45,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {761#false} is VALID [2018-11-14 18:41:45,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {761#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {761#false} is VALID [2018-11-14 18:41:45,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {761#false} is VALID [2018-11-14 18:41:45,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {761#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {761#false} is VALID [2018-11-14 18:41:45,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 18:41:45,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {761#false} havoc ~x~0;~x~0 := 0; {761#false} is VALID [2018-11-14 18:41:45,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 18:41:45,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {761#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {761#false} is VALID [2018-11-14 18:41:45,509 INFO L256 TraceCheckUtils]: 38: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {761#false} is VALID [2018-11-14 18:41:45,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 18:41:45,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {761#false} assume ~cond == 0; {761#false} is VALID [2018-11-14 18:41:45,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 18:41:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:41:45,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:41:45,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 18:41:45,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:45,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:41:45,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:45,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:41:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:41:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:41:45,671 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 5 states. [2018-11-14 18:41:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:45,886 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-11-14 18:41:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:41:45,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 18:41:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:41:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 18:41:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:41:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 18:41:45,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-14 18:41:46,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:46,043 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:41:46,044 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:41:46,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:41:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:41:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 18:41:46,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:46,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 18:41:46,065 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 18:41:46,066 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 18:41:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:46,068 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:41:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 18:41:46,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:46,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:46,070 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 18:41:46,070 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 18:41:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:46,073 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:41:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 18:41:46,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:46,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:46,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:46,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:41:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-14 18:41:46,076 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 42 [2018-11-14 18:41:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:46,077 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-14 18:41:46,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:41:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-14 18:41:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:41:46,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:46,079 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:46,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:46,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1851408885, now seen corresponding path program 2 times [2018-11-14 18:41:46,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:46,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {1176#true} call ULTIMATE.init(); {1176#true} is VALID [2018-11-14 18:41:46,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1176#true} is VALID [2018-11-14 18:41:46,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1176#true} {1176#true} #111#return; {1176#true} is VALID [2018-11-14 18:41:46,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {1176#true} call #t~ret13 := main(); {1176#true} is VALID [2018-11-14 18:41:46,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {1176#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1178#(= main_~a~0 0)} is VALID [2018-11-14 18:41:46,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~a~0 0)} assume true; {1178#(= main_~a~0 0)} is VALID [2018-11-14 18:41:46,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {1178#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1178#(= main_~a~0 0)} is VALID [2018-11-14 18:41:46,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {1178#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:46,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {1179#(<= main_~a~0 1)} assume true; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:46,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {1179#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:46,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {1179#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1180#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:46,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {1180#(<= main_~a~0 2)} assume true; {1180#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:46,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {1180#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#false} havoc ~i~0;~i~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1177#false} is VALID [2018-11-14 18:41:46,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {1177#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1177#false} is VALID [2018-11-14 18:41:46,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1177#false} is VALID [2018-11-14 18:41:46,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {1177#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1177#false} is VALID [2018-11-14 18:41:46,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1177#false} is VALID [2018-11-14 18:41:46,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {1177#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1177#false} is VALID [2018-11-14 18:41:46,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1177#false} is VALID [2018-11-14 18:41:46,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {1177#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1177#false} is VALID [2018-11-14 18:41:46,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {1177#false} havoc ~x~0;~x~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {1177#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1177#false} is VALID [2018-11-14 18:41:46,242 INFO L256 TraceCheckUtils]: 41: Hoare triple {1177#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1177#false} is VALID [2018-11-14 18:41:46,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {1177#false} ~cond := #in~cond; {1177#false} is VALID [2018-11-14 18:41:46,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {1177#false} assume ~cond == 0; {1177#false} is VALID [2018-11-14 18:41:46,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {1177#false} assume !false; {1177#false} is VALID [2018-11-14 18:41:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:41:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:46,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:46,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:46,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:46,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:46,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {1176#true} call ULTIMATE.init(); {1176#true} is VALID [2018-11-14 18:41:46,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {1176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1176#true} is VALID [2018-11-14 18:41:46,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1176#true} {1176#true} #111#return; {1176#true} is VALID [2018-11-14 18:41:46,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {1176#true} call #t~ret13 := main(); {1176#true} is VALID [2018-11-14 18:41:46,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {1176#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1176#true} is VALID [2018-11-14 18:41:46,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {1176#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1176#true} is VALID [2018-11-14 18:41:46,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {1176#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1176#true} is VALID [2018-11-14 18:41:46,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {1176#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1176#true} is VALID [2018-11-14 18:41:46,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {1176#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1176#true} is VALID [2018-11-14 18:41:46,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {1176#true} assume !(~a~0 < 100000); {1176#true} is VALID [2018-11-14 18:41:46,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {1176#true} havoc ~i~0;~i~0 := 0; {1176#true} is VALID [2018-11-14 18:41:46,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1176#true} is VALID [2018-11-14 18:41:46,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1176#true} is VALID [2018-11-14 18:41:46,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 18:41:46,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {1176#true} ~i~0 := 0; {1176#true} is VALID [2018-11-14 18:41:46,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1176#true} is VALID [2018-11-14 18:41:46,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1176#true} is VALID [2018-11-14 18:41:46,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 18:41:46,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#true} ~i~0 := 0; {1176#true} is VALID [2018-11-14 18:41:46,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1176#true} is VALID [2018-11-14 18:41:46,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {1176#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1176#true} is VALID [2018-11-14 18:41:46,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 18:41:46,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 18:41:46,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {1176#true} ~i~0 := 0; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:46,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {1280#(<= main_~i~0 0)} assume true; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:46,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {1280#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:46,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {1280#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1290#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:46,449 INFO L273 TraceCheckUtils]: 36: Hoare triple {1290#(<= main_~i~0 1)} assume true; {1290#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:46,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {1290#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 18:41:46,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {1177#false} havoc ~x~0;~x~0 := 0; {1177#false} is VALID [2018-11-14 18:41:46,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 18:41:46,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {1177#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1177#false} is VALID [2018-11-14 18:41:46,450 INFO L256 TraceCheckUtils]: 41: Hoare triple {1177#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1177#false} is VALID [2018-11-14 18:41:46,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {1177#false} ~cond := #in~cond; {1177#false} is VALID [2018-11-14 18:41:46,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {1177#false} assume ~cond == 0; {1177#false} is VALID [2018-11-14 18:41:46,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {1177#false} assume !false; {1177#false} is VALID [2018-11-14 18:41:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-14 18:41:46,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 18:41:46,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 18:41:46,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:46,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:41:46,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:46,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:41:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:41:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:41:46,599 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-11-14 18:41:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:47,214 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 18:41:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:41:47,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 18:41:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2018-11-14 18:41:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:41:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2018-11-14 18:41:47,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 112 transitions. [2018-11-14 18:41:47,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:47,389 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:41:47,389 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 18:41:47,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-14 18:41:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 18:41:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-11-14 18:41:47,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:47,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2018-11-14 18:41:47,451 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2018-11-14 18:41:47,452 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2018-11-14 18:41:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:47,456 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 18:41:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 18:41:47,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:47,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:47,457 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2018-11-14 18:41:47,457 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2018-11-14 18:41:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:47,460 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 18:41:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 18:41:47,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:47,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:47,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:47,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:41:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-14 18:41:47,465 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 45 [2018-11-14 18:41:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:47,465 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-14 18:41:47,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:41:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-14 18:41:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 18:41:47,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:47,467 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-14 18:41:47,467 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:47,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1796329582, now seen corresponding path program 3 times [2018-11-14 18:41:47,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:47,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:47,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:47,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:47,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 18:41:47,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1685#true} is VALID [2018-11-14 18:41:47,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #111#return; {1685#true} is VALID [2018-11-14 18:41:47,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret13 := main(); {1685#true} is VALID [2018-11-14 18:41:47,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1687#(= main_~a~0 0)} is VALID [2018-11-14 18:41:47,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#(= main_~a~0 0)} assume true; {1687#(= main_~a~0 0)} is VALID [2018-11-14 18:41:47,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1687#(= main_~a~0 0)} is VALID [2018-11-14 18:41:47,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:47,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {1688#(<= main_~a~0 1)} assume true; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:47,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {1688#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:47,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {1688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:47,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {1689#(<= main_~a~0 2)} assume true; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:47,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {1689#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:47,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {1689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1690#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:47,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#(<= main_~a~0 3)} assume true; {1690#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:47,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {1686#false} havoc ~i~0;~i~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1686#false} is VALID [2018-11-14 18:41:47,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {1686#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1686#false} is VALID [2018-11-14 18:41:47,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1686#false} is VALID [2018-11-14 18:41:47,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {1686#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1686#false} is VALID [2018-11-14 18:41:47,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1686#false} is VALID [2018-11-14 18:41:47,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {1686#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1686#false} is VALID [2018-11-14 18:41:47,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1686#false} is VALID [2018-11-14 18:41:47,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {1686#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1686#false} is VALID [2018-11-14 18:41:47,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1686#false} is VALID [2018-11-14 18:41:47,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1686#false} is VALID [2018-11-14 18:41:47,646 INFO L273 TraceCheckUtils]: 39: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1686#false} is VALID [2018-11-14 18:41:47,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1686#false} is VALID [2018-11-14 18:41:47,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 18:41:47,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 18:41:47,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 18:41:47,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 18:41:47,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} havoc ~x~0;~x~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {1686#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1686#false} is VALID [2018-11-14 18:41:47,649 INFO L256 TraceCheckUtils]: 56: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1686#false} is VALID [2018-11-14 18:41:47,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 18:41:47,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 18:41:47,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 18:41:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-14 18:41:47,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:47,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:41:47,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 18:41:47,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:47,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:47,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 18:41:47,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1685#true} is VALID [2018-11-14 18:41:47,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #111#return; {1685#true} is VALID [2018-11-14 18:41:47,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret13 := main(); {1685#true} is VALID [2018-11-14 18:41:47,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1685#true} is VALID [2018-11-14 18:41:47,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 18:41:47,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 18:41:47,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 18:41:47,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 18:41:47,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 18:41:47,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 18:41:47,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {1685#true} assume !(~a~0 < 100000); {1685#true} is VALID [2018-11-14 18:41:47,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {1685#true} havoc ~i~0;~i~0 := 0; {1685#true} is VALID [2018-11-14 18:41:47,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1685#true} is VALID [2018-11-14 18:41:47,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {1685#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1685#true} is VALID [2018-11-14 18:41:47,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1685#true} is VALID [2018-11-14 18:41:47,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {1685#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1685#true} is VALID [2018-11-14 18:41:47,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {1685#true} assume !(~i~0 < 100000); {1685#true} is VALID [2018-11-14 18:41:47,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {1685#true} ~i~0 := 0; {1685#true} is VALID [2018-11-14 18:41:47,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1685#true} is VALID [2018-11-14 18:41:47,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {1685#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1685#true} is VALID [2018-11-14 18:41:47,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1685#true} is VALID [2018-11-14 18:41:47,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {1685#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1685#true} is VALID [2018-11-14 18:41:47,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:41:47,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {1685#true} assume !(~i~0 < 100000); {1685#true} is VALID [2018-11-14 18:41:47,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {1685#true} ~i~0 := 0; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:47,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {1799#(<= main_~i~0 0)} assume true; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:47,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {1799#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:47,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {1799#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:47,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {1809#(<= main_~i~0 1)} assume true; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:47,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {1809#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:47,929 INFO L273 TraceCheckUtils]: 41: Hoare triple {1809#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1819#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {1819#(<= main_~i~0 2)} assume true; {1819#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:47,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {1819#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,930 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 18:41:47,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 18:41:47,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 18:41:47,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 18:41:47,933 INFO L273 TraceCheckUtils]: 51: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,933 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 18:41:47,934 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} havoc ~x~0;~x~0 := 0; {1686#false} is VALID [2018-11-14 18:41:47,934 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:41:47,934 INFO L273 TraceCheckUtils]: 55: Hoare triple {1686#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1686#false} is VALID [2018-11-14 18:41:47,934 INFO L256 TraceCheckUtils]: 56: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1686#false} is VALID [2018-11-14 18:41:47,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 18:41:47,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 18:41:47,935 INFO L273 TraceCheckUtils]: 59: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 18:41:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 18:41:47,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:47,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 18:41:47,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 18:41:47,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:47,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:41:48,126 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-14 18:41:48,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:41:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:41:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:41:48,127 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 9 states. [2018-11-14 18:41:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:48,891 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-14 18:41:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:41:48,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 18:41:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:41:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2018-11-14 18:41:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:41:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2018-11-14 18:41:48,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 127 transitions. [2018-11-14 18:41:49,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:49,113 INFO L225 Difference]: With dead ends: 133 [2018-11-14 18:41:49,114 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 18:41:49,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:41:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 18:41:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-14 18:41:49,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:49,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 80 states. [2018-11-14 18:41:49,197 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 80 states. [2018-11-14 18:41:49,197 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 80 states. [2018-11-14 18:41:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:49,200 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-14 18:41:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-14 18:41:49,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:49,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:49,201 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 85 states. [2018-11-14 18:41:49,201 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 85 states. [2018-11-14 18:41:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:49,205 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-14 18:41:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-14 18:41:49,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:49,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:49,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:49,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:41:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 18:41:49,209 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 60 [2018-11-14 18:41:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 18:41:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:41:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 18:41:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 18:41:49,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:49,211 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:49,211 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:49,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash 499349291, now seen corresponding path program 4 times [2018-11-14 18:41:49,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:49,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:49,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:49,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:49,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {2327#true} call ULTIMATE.init(); {2327#true} is VALID [2018-11-14 18:41:49,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {2327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2327#true} is VALID [2018-11-14 18:41:49,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {2327#true} assume true; {2327#true} is VALID [2018-11-14 18:41:49,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2327#true} {2327#true} #111#return; {2327#true} is VALID [2018-11-14 18:41:49,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {2327#true} call #t~ret13 := main(); {2327#true} is VALID [2018-11-14 18:41:49,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {2327#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2329#(= main_~a~0 0)} is VALID [2018-11-14 18:41:49,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {2329#(= main_~a~0 0)} assume true; {2329#(= main_~a~0 0)} is VALID [2018-11-14 18:41:49,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {2329#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2329#(= main_~a~0 0)} is VALID [2018-11-14 18:41:49,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {2329#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:49,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {2330#(<= main_~a~0 1)} assume true; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:49,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {2330#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:49,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {2330#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:49,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {2331#(<= main_~a~0 2)} assume true; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:49,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {2331#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:49,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {2331#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:49,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {2332#(<= main_~a~0 3)} assume true; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:49,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {2332#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:49,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {2332#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:49,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#(<= main_~a~0 4)} assume true; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:49,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:49,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {2328#false} havoc ~i~0;~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:49,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:49,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:49,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:49,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:49,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:49,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:49,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:49,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:49,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:49,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:49,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:49,828 INFO L273 TraceCheckUtils]: 38: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:49,828 INFO L273 TraceCheckUtils]: 39: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,828 INFO L273 TraceCheckUtils]: 40: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:49,828 INFO L273 TraceCheckUtils]: 41: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:49,828 INFO L273 TraceCheckUtils]: 42: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:49,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:49,829 INFO L273 TraceCheckUtils]: 45: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,829 INFO L273 TraceCheckUtils]: 46: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:49,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:49,830 INFO L273 TraceCheckUtils]: 48: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:49,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:49,830 INFO L273 TraceCheckUtils]: 51: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:49,831 INFO L273 TraceCheckUtils]: 53: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:49,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:49,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:49,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:49,832 INFO L273 TraceCheckUtils]: 59: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:49,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:49,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:49,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:49,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:49,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:49,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {2328#false} havoc ~x~0;~x~0 := 0; {2328#false} is VALID [2018-11-14 18:41:49,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:49,835 INFO L273 TraceCheckUtils]: 70: Hoare triple {2328#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {2328#false} is VALID [2018-11-14 18:41:49,835 INFO L256 TraceCheckUtils]: 71: Hoare triple {2328#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2328#false} is VALID [2018-11-14 18:41:49,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {2328#false} ~cond := #in~cond; {2328#false} is VALID [2018-11-14 18:41:49,836 INFO L273 TraceCheckUtils]: 73: Hoare triple {2328#false} assume ~cond == 0; {2328#false} is VALID [2018-11-14 18:41:49,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {2328#false} assume !false; {2328#false} is VALID [2018-11-14 18:41:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 18:41:49,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:49,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:41:49,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:41:49,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:49,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:50,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {2327#true} call ULTIMATE.init(); {2327#true} is VALID [2018-11-14 18:41:50,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {2327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2327#true} is VALID [2018-11-14 18:41:50,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {2327#true} assume true; {2327#true} is VALID [2018-11-14 18:41:50,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2327#true} {2327#true} #111#return; {2327#true} is VALID [2018-11-14 18:41:50,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {2327#true} call #t~ret13 := main(); {2327#true} is VALID [2018-11-14 18:41:50,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {2327#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:50,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {2352#(<= main_~a~0 0)} assume true; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:50,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {2352#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:50,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {2352#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:50,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {2330#(<= main_~a~0 1)} assume true; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:50,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {2330#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:50,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {2330#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:50,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {2331#(<= main_~a~0 2)} assume true; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:50,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {2331#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:50,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {2331#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:50,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {2332#(<= main_~a~0 3)} assume true; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:50,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {2332#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:50,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {2332#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:50,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#(<= main_~a~0 4)} assume true; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:50,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:50,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {2328#false} havoc ~i~0;~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:50,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:50,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:50,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:50,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:50,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 18:41:50,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 18:41:50,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:50,183 INFO L273 TraceCheckUtils]: 45: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 50: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:50,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 18:41:50,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 18:41:50,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:50,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 18:41:50,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,186 INFO L273 TraceCheckUtils]: 58: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:50,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:50,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:50,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:50,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 18:41:50,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 18:41:50,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 18:41:50,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {2328#false} havoc ~x~0;~x~0 := 0; {2328#false} is VALID [2018-11-14 18:41:50,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 18:41:50,188 INFO L273 TraceCheckUtils]: 70: Hoare triple {2328#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {2328#false} is VALID [2018-11-14 18:41:50,189 INFO L256 TraceCheckUtils]: 71: Hoare triple {2328#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2328#false} is VALID [2018-11-14 18:41:50,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {2328#false} ~cond := #in~cond; {2328#false} is VALID [2018-11-14 18:41:50,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {2328#false} assume ~cond == 0; {2328#false} is VALID [2018-11-14 18:41:50,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {2328#false} assume !false; {2328#false} is VALID [2018-11-14 18:41:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 18:41:50,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:41:50,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-11-14 18:41:50,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:50,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:41:50,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:50,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:41:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:41:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:41:50,469 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 8 states. [2018-11-14 18:41:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:50,746 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 18:41:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:41:50,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-11-14 18:41:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:41:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-14 18:41:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:41:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-14 18:41:50,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-14 18:41:50,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:50,880 INFO L225 Difference]: With dead ends: 144 [2018-11-14 18:41:50,880 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:41:50,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:41:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:41:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-14 18:41:50,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:50,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-14 18:41:50,916 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-14 18:41:50,917 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-14 18:41:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:50,920 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 18:41:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 18:41:50,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:50,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:50,920 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-14 18:41:50,921 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-14 18:41:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:50,923 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 18:41:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 18:41:50,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:50,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:50,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:50,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:41:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-11-14 18:41:50,926 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 75 [2018-11-14 18:41:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-14 18:41:50,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:41:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-14 18:41:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 18:41:50,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:50,927 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:50,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:50,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1441638188, now seen corresponding path program 5 times [2018-11-14 18:41:50,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:50,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:51,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {3031#true} call ULTIMATE.init(); {3031#true} is VALID [2018-11-14 18:41:51,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {3031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3031#true} is VALID [2018-11-14 18:41:51,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:51,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3031#true} {3031#true} #111#return; {3031#true} is VALID [2018-11-14 18:41:51,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {3031#true} call #t~ret13 := main(); {3031#true} is VALID [2018-11-14 18:41:51,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {3031#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3033#(= main_~a~0 0)} is VALID [2018-11-14 18:41:51,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {3033#(= main_~a~0 0)} assume true; {3033#(= main_~a~0 0)} is VALID [2018-11-14 18:41:51,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {3033#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3033#(= main_~a~0 0)} is VALID [2018-11-14 18:41:51,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {3033#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:51,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {3034#(<= main_~a~0 1)} assume true; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:51,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {3034#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:51,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {3034#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:51,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {3035#(<= main_~a~0 2)} assume true; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:51,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {3035#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:51,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {3035#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:51,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {3036#(<= main_~a~0 3)} assume true; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:51,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {3036#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:51,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {3036#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:51,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {3037#(<= main_~a~0 4)} assume true; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:51,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {3037#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:51,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {3037#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3038#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:51,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {3038#(<= main_~a~0 5)} assume true; {3038#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:51,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {3038#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:51,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {3032#false} havoc ~i~0;~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:51,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 18:41:51,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 34: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:51,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:51,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:51,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:51,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:51,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:51,169 INFO L273 TraceCheckUtils]: 56: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 57: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 58: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 59: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 60: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:51,170 INFO L273 TraceCheckUtils]: 62: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 64: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 65: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 67: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:51,171 INFO L273 TraceCheckUtils]: 68: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:51,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:51,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {3032#false} havoc ~x~0;~x~0 := 0; {3032#false} is VALID [2018-11-14 18:41:51,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:51,172 INFO L273 TraceCheckUtils]: 73: Hoare triple {3032#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3032#false} is VALID [2018-11-14 18:41:51,173 INFO L256 TraceCheckUtils]: 74: Hoare triple {3032#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3032#false} is VALID [2018-11-14 18:41:51,173 INFO L273 TraceCheckUtils]: 75: Hoare triple {3032#false} ~cond := #in~cond; {3032#false} is VALID [2018-11-14 18:41:51,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {3032#false} assume ~cond == 0; {3032#false} is VALID [2018-11-14 18:41:51,173 INFO L273 TraceCheckUtils]: 77: Hoare triple {3032#false} assume !false; {3032#false} is VALID [2018-11-14 18:41:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 18:41:51,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:51,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:51,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:41:52,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:41:52,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:52,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:52,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {3031#true} call ULTIMATE.init(); {3031#true} is VALID [2018-11-14 18:41:52,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {3031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3031#true} is VALID [2018-11-14 18:41:52,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3031#true} {3031#true} #111#return; {3031#true} is VALID [2018-11-14 18:41:52,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {3031#true} call #t~ret13 := main(); {3031#true} is VALID [2018-11-14 18:41:52,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {3031#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3031#true} is VALID [2018-11-14 18:41:52,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 18:41:52,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 18:41:52,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 18:41:52,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 18:41:52,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 18:41:52,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 18:41:52,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 18:41:52,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {3031#true} assume !(~a~0 < 100000); {3031#true} is VALID [2018-11-14 18:41:52,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {3031#true} havoc ~i~0;~i~0 := 0; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:52,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#(<= main_~i~0 0)} assume true; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:52,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:52,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:52,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {3121#(<= main_~i~0 1)} assume true; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:52,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {3121#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:52,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {3121#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:52,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {3131#(<= main_~i~0 2)} assume true; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:52,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {3131#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:52,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {3131#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3141#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:52,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {3141#(<= main_~i~0 3)} assume true; {3141#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:52,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {3141#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:52,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:52,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:52,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:52,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:52,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:52,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 18:41:52,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:52,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 52: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 56: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:52,809 INFO L273 TraceCheckUtils]: 59: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 60: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 64: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 65: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:52,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 67: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 68: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 69: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 70: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 71: Hoare triple {3032#false} havoc ~x~0;~x~0 := 0; {3032#false} is VALID [2018-11-14 18:41:52,811 INFO L273 TraceCheckUtils]: 72: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 18:41:52,812 INFO L273 TraceCheckUtils]: 73: Hoare triple {3032#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3032#false} is VALID [2018-11-14 18:41:52,812 INFO L256 TraceCheckUtils]: 74: Hoare triple {3032#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3032#false} is VALID [2018-11-14 18:41:52,812 INFO L273 TraceCheckUtils]: 75: Hoare triple {3032#false} ~cond := #in~cond; {3032#false} is VALID [2018-11-14 18:41:52,812 INFO L273 TraceCheckUtils]: 76: Hoare triple {3032#false} assume ~cond == 0; {3032#false} is VALID [2018-11-14 18:41:52,812 INFO L273 TraceCheckUtils]: 77: Hoare triple {3032#false} assume !false; {3032#false} is VALID [2018-11-14 18:41:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-14 18:41:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:52,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 18:41:52,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-14 18:41:52,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:52,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:41:52,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:52,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:41:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:41:52,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:52,970 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 12 states. [2018-11-14 18:41:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:53,795 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2018-11-14 18:41:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:41:53,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-14 18:41:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2018-11-14 18:41:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2018-11-14 18:41:53,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2018-11-14 18:41:53,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:53,952 INFO L225 Difference]: With dead ends: 163 [2018-11-14 18:41:53,952 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:41:53,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:41:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-14 18:41:53,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:53,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 98 states. [2018-11-14 18:41:53,984 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 98 states. [2018-11-14 18:41:53,984 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 98 states. [2018-11-14 18:41:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:53,987 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 18:41:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-11-14 18:41:53,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:53,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:53,987 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 103 states. [2018-11-14 18:41:53,987 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 103 states. [2018-11-14 18:41:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:53,990 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 18:41:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-11-14 18:41:53,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:53,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:53,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:53,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 18:41:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-11-14 18:41:53,994 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 78 [2018-11-14 18:41:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:53,995 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-11-14 18:41:53,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:41:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-11-14 18:41:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 18:41:53,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:53,996 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:53,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:53,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1083739601, now seen corresponding path program 6 times [2018-11-14 18:41:53,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:53,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:54,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2018-11-14 18:41:54,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3830#true} is VALID [2018-11-14 18:41:54,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2018-11-14 18:41:54,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #111#return; {3830#true} is VALID [2018-11-14 18:41:54,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret13 := main(); {3830#true} is VALID [2018-11-14 18:41:54,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {3830#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3832#(= main_~a~0 0)} is VALID [2018-11-14 18:41:54,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {3832#(= main_~a~0 0)} assume true; {3832#(= main_~a~0 0)} is VALID [2018-11-14 18:41:54,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {3832#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3832#(= main_~a~0 0)} is VALID [2018-11-14 18:41:54,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {3832#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {3833#(<= main_~a~0 1)} assume true; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~a~0 2)} assume true; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {3834#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~a~0 3)} assume true; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {3835#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {3835#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {3836#(<= main_~a~0 4)} assume true; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {3836#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {3836#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {3837#(<= main_~a~0 5)} assume true; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {3837#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {3837#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:54,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {3838#(<= main_~a~0 6)} assume true; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:54,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {3838#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#false} havoc ~i~0;~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 56: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 63: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 64: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 66: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 67: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 69: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 70: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 71: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 72: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 73: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 76: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 77: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 78: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 80: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 82: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 84: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 85: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {3831#false} havoc ~x~0;~x~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,188 INFO L273 TraceCheckUtils]: 88: Hoare triple {3831#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3831#false} is VALID [2018-11-14 18:41:54,189 INFO L256 TraceCheckUtils]: 89: Hoare triple {3831#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3831#false} is VALID [2018-11-14 18:41:54,189 INFO L273 TraceCheckUtils]: 90: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2018-11-14 18:41:54,189 INFO L273 TraceCheckUtils]: 91: Hoare triple {3831#false} assume ~cond == 0; {3831#false} is VALID [2018-11-14 18:41:54,189 INFO L273 TraceCheckUtils]: 92: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2018-11-14 18:41:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:54,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:54,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:41:54,433 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:41:54,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:54,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:54,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2018-11-14 18:41:54,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3830#true} is VALID [2018-11-14 18:41:54,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2018-11-14 18:41:54,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #111#return; {3830#true} is VALID [2018-11-14 18:41:54,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret13 := main(); {3830#true} is VALID [2018-11-14 18:41:54,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {3830#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:54,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {3857#(<= main_~a~0 0)} assume true; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:54,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {3857#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:54,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {3833#(<= main_~a~0 1)} assume true; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:54,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~a~0 2)} assume true; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:54,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {3834#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~a~0 3)} assume true; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {3835#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:54,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {3835#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {3836#(<= main_~a~0 4)} assume true; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {3836#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:54,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {3836#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {3837#(<= main_~a~0 5)} assume true; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {3837#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:54,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {3837#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:54,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {3838#(<= main_~a~0 6)} assume true; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {3838#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#false} havoc ~i~0;~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 39: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 47: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 48: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 63: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 64: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 65: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 69: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 70: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 72: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 73: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,849 INFO L273 TraceCheckUtils]: 74: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 80: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,850 INFO L273 TraceCheckUtils]: 81: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 83: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 84: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 85: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 86: Hoare triple {3831#false} havoc ~x~0;~x~0 := 0; {3831#false} is VALID [2018-11-14 18:41:54,851 INFO L273 TraceCheckUtils]: 87: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 18:41:54,852 INFO L273 TraceCheckUtils]: 88: Hoare triple {3831#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3831#false} is VALID [2018-11-14 18:41:54,852 INFO L256 TraceCheckUtils]: 89: Hoare triple {3831#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3831#false} is VALID [2018-11-14 18:41:54,852 INFO L273 TraceCheckUtils]: 90: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2018-11-14 18:41:54,852 INFO L273 TraceCheckUtils]: 91: Hoare triple {3831#false} assume ~cond == 0; {3831#false} is VALID [2018-11-14 18:41:54,852 INFO L273 TraceCheckUtils]: 92: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2018-11-14 18:41:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:54,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:54,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:41:54,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-14 18:41:54,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:54,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:41:54,940 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-14 18:41:54,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:41:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:41:54,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:41:54,941 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 10 states. [2018-11-14 18:41:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:55,241 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-14 18:41:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:41:55,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-14 18:41:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:41:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2018-11-14 18:41:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:41:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2018-11-14 18:41:55,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 96 transitions. [2018-11-14 18:41:55,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:55,401 INFO L225 Difference]: With dead ends: 174 [2018-11-14 18:41:55,401 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 18:41:55,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:41:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 18:41:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-14 18:41:55,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:55,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 101 states. [2018-11-14 18:41:55,437 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 101 states. [2018-11-14 18:41:55,438 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 101 states. [2018-11-14 18:41:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:55,441 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 18:41:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 18:41:55,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:55,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:55,442 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 102 states. [2018-11-14 18:41:55,442 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 102 states. [2018-11-14 18:41:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:55,445 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 18:41:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 18:41:55,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:55,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:55,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:55,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:41:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-14 18:41:55,450 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 93 [2018-11-14 18:41:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:55,450 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-14 18:41:55,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:41:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 18:41:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 18:41:55,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:55,451 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:55,452 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:55,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1111564178, now seen corresponding path program 7 times [2018-11-14 18:41:55,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:55,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:55,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:56,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2018-11-14 18:41:56,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {4690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4690#true} is VALID [2018-11-14 18:41:56,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {4690#true} assume true; {4690#true} is VALID [2018-11-14 18:41:56,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4690#true} {4690#true} #111#return; {4690#true} is VALID [2018-11-14 18:41:56,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {4690#true} call #t~ret13 := main(); {4690#true} is VALID [2018-11-14 18:41:56,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {4690#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4692#(= main_~a~0 0)} is VALID [2018-11-14 18:41:56,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {4692#(= main_~a~0 0)} assume true; {4692#(= main_~a~0 0)} is VALID [2018-11-14 18:41:56,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {4692#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4692#(= main_~a~0 0)} is VALID [2018-11-14 18:41:56,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {4692#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {4693#(<= main_~a~0 1)} assume true; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {4693#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {4694#(<= main_~a~0 2)} assume true; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {4694#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {4695#(<= main_~a~0 3)} assume true; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {4695#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {4695#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {4696#(<= main_~a~0 4)} assume true; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {4696#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {4696#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {4697#(<= main_~a~0 5)} assume true; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {4697#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {4697#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {4698#(<= main_~a~0 6)} assume true; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {4698#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {4698#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:56,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {4699#(<= main_~a~0 7)} assume true; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {4699#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {4691#false} havoc ~i~0;~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 40: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 42: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,124 INFO L273 TraceCheckUtils]: 43: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 44: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 45: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 48: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 49: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,126 INFO L273 TraceCheckUtils]: 52: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,126 INFO L273 TraceCheckUtils]: 54: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 58: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 61: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,127 INFO L273 TraceCheckUtils]: 62: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 68: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,128 INFO L273 TraceCheckUtils]: 70: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 71: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 72: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 73: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 74: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 75: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 76: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,129 INFO L273 TraceCheckUtils]: 78: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 80: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 81: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 82: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 83: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 84: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 86: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 89: Hoare triple {4691#false} havoc ~x~0;~x~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 90: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 91: Hoare triple {4691#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L256 TraceCheckUtils]: 92: Hoare triple {4691#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 93: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 94: Hoare triple {4691#false} assume ~cond == 0; {4691#false} is VALID [2018-11-14 18:41:56,131 INFO L273 TraceCheckUtils]: 95: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2018-11-14 18:41:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:56,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:56,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:56,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:56,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:56,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2018-11-14 18:41:56,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {4690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4690#true} is VALID [2018-11-14 18:41:56,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {4690#true} assume true; {4690#true} is VALID [2018-11-14 18:41:56,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4690#true} {4690#true} #111#return; {4690#true} is VALID [2018-11-14 18:41:56,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {4690#true} call #t~ret13 := main(); {4690#true} is VALID [2018-11-14 18:41:56,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {4690#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:56,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {4718#(<= main_~a~0 0)} assume true; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:56,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {4718#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:56,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {4718#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {4693#(<= main_~a~0 1)} assume true; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:56,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {4693#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {4694#(<= main_~a~0 2)} assume true; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:56,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {4694#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {4695#(<= main_~a~0 3)} assume true; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {4695#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:56,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {4695#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {4696#(<= main_~a~0 4)} assume true; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {4696#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:56,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {4696#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {4697#(<= main_~a~0 5)} assume true; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {4697#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:56,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {4697#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {4698#(<= main_~a~0 6)} assume true; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {4698#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:56,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {4698#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:56,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {4699#(<= main_~a~0 7)} assume true; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:56,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {4699#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {4691#false} havoc ~i~0;~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,365 INFO L273 TraceCheckUtils]: 33: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,367 INFO L273 TraceCheckUtils]: 47: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 54: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 18:41:56,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 65: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 66: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 67: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 68: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 69: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 70: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 71: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 18:41:56,370 INFO L273 TraceCheckUtils]: 72: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 73: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 74: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 75: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 76: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 79: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,371 INFO L273 TraceCheckUtils]: 80: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 81: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 82: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 83: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 84: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 85: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 86: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 87: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 88: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 18:41:56,372 INFO L273 TraceCheckUtils]: 89: Hoare triple {4691#false} havoc ~x~0;~x~0 := 0; {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L273 TraceCheckUtils]: 90: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L273 TraceCheckUtils]: 91: Hoare triple {4691#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L256 TraceCheckUtils]: 92: Hoare triple {4691#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L273 TraceCheckUtils]: 93: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L273 TraceCheckUtils]: 94: Hoare triple {4691#false} assume ~cond == 0; {4691#false} is VALID [2018-11-14 18:41:56,373 INFO L273 TraceCheckUtils]: 95: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2018-11-14 18:41:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:41:56,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-14 18:41:56,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:56,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:41:56,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:41:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:41:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:41:56,454 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 11 states. [2018-11-14 18:41:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,800 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-11-14 18:41:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:41:56,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-14 18:41:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:41:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-14 18:41:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:41:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-14 18:41:56,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-14 18:41:56,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:56,929 INFO L225 Difference]: With dead ends: 177 [2018-11-14 18:41:56,930 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 18:41:56,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:41:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 18:41:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-14 18:41:56,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:56,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-14 18:41:56,972 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-14 18:41:56,972 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-14 18:41:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,975 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-14 18:41:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-14 18:41:56,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:56,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:56,976 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-14 18:41:56,976 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-14 18:41:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:56,979 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-14 18:41:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-14 18:41:56,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:56,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:56,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:56,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:41:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-11-14 18:41:56,982 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 96 [2018-11-14 18:41:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:56,983 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-11-14 18:41:56,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:41:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-11-14 18:41:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 18:41:56,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:56,985 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:56,985 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:56,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1104849457, now seen corresponding path program 8 times [2018-11-14 18:41:56,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:56,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:56,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:41:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:57,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2018-11-14 18:41:57,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {5574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5574#true} is VALID [2018-11-14 18:41:57,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {5574#true} assume true; {5574#true} is VALID [2018-11-14 18:41:57,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} #111#return; {5574#true} is VALID [2018-11-14 18:41:57,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {5574#true} call #t~ret13 := main(); {5574#true} is VALID [2018-11-14 18:41:57,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {5574#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5576#(= main_~a~0 0)} is VALID [2018-11-14 18:41:57,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {5576#(= main_~a~0 0)} assume true; {5576#(= main_~a~0 0)} is VALID [2018-11-14 18:41:57,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {5576#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5576#(= main_~a~0 0)} is VALID [2018-11-14 18:41:57,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {5576#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {5577#(<= main_~a~0 1)} assume true; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {5577#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~a~0 2)} assume true; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {5578#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {5579#(<= main_~a~0 3)} assume true; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {5579#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {5579#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {5580#(<= main_~a~0 4)} assume true; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {5580#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {5580#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {5581#(<= main_~a~0 5)} assume true; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {5581#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {5581#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {5582#(<= main_~a~0 6)} assume true; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {5582#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {5582#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {5583#(<= main_~a~0 7)} assume true; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {5583#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {5583#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:57,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {5584#(<= main_~a~0 8)} assume true; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:57,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {5584#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {5575#false} havoc ~i~0;~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,692 INFO L273 TraceCheckUtils]: 40: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 50: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 52: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 55: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 66: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 72: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 73: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 74: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 79: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 82: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 83: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,699 INFO L273 TraceCheckUtils]: 84: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 85: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 86: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 87: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 88: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 89: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 90: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,700 INFO L273 TraceCheckUtils]: 91: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L273 TraceCheckUtils]: 92: Hoare triple {5575#false} havoc ~x~0;~x~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L273 TraceCheckUtils]: 93: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L273 TraceCheckUtils]: 94: Hoare triple {5575#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L256 TraceCheckUtils]: 95: Hoare triple {5575#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L273 TraceCheckUtils]: 96: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2018-11-14 18:41:57,701 INFO L273 TraceCheckUtils]: 97: Hoare triple {5575#false} assume ~cond == 0; {5575#false} is VALID [2018-11-14 18:41:57,702 INFO L273 TraceCheckUtils]: 98: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2018-11-14 18:41:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:57,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:57,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:57,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:41:57,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:41:57,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:57,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:57,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2018-11-14 18:41:57,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {5574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5574#true} is VALID [2018-11-14 18:41:57,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {5574#true} assume true; {5574#true} is VALID [2018-11-14 18:41:57,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} #111#return; {5574#true} is VALID [2018-11-14 18:41:57,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {5574#true} call #t~ret13 := main(); {5574#true} is VALID [2018-11-14 18:41:57,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {5574#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:57,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {5603#(<= main_~a~0 0)} assume true; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:57,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {5603#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:57,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {5603#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {5577#(<= main_~a~0 1)} assume true; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {5577#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:57,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~a~0 2)} assume true; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {5578#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:57,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {5579#(<= main_~a~0 3)} assume true; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {5579#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:57,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {5579#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {5580#(<= main_~a~0 4)} assume true; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {5580#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:57,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {5580#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {5581#(<= main_~a~0 5)} assume true; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {5581#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:57,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {5581#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {5582#(<= main_~a~0 6)} assume true; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {5582#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:57,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {5582#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {5583#(<= main_~a~0 7)} assume true; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {5583#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:57,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {5583#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:57,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {5584#(<= main_~a~0 8)} assume true; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {5584#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {5575#false} havoc ~i~0;~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 48: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 49: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 50: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 53: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 55: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 57: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 58: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 18:41:57,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 60: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 61: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 62: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 63: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,962 INFO L273 TraceCheckUtils]: 65: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 68: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 71: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,963 INFO L273 TraceCheckUtils]: 72: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 74: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 77: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,964 INFO L273 TraceCheckUtils]: 78: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 79: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 80: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 81: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 82: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 83: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 84: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 86: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 90: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 91: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 18:41:57,966 INFO L273 TraceCheckUtils]: 92: Hoare triple {5575#false} havoc ~x~0;~x~0 := 0; {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 93: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 94: Hoare triple {5575#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L256 TraceCheckUtils]: 95: Hoare triple {5575#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 96: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 97: Hoare triple {5575#false} assume ~cond == 0; {5575#false} is VALID [2018-11-14 18:41:57,967 INFO L273 TraceCheckUtils]: 98: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2018-11-14 18:41:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:57,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:57,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:41:57,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-14 18:41:57,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:57,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:41:58,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:58,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:41:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:41:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:58,064 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 12 states. [2018-11-14 18:41:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:58,232 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2018-11-14 18:41:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:41:58,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-14 18:41:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 18:41:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:41:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 18:41:58,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2018-11-14 18:41:58,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:58,334 INFO L225 Difference]: With dead ends: 180 [2018-11-14 18:41:58,334 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 18:41:58,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:41:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 18:41:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-14 18:41:58,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:58,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-14 18:41:58,362 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-14 18:41:58,362 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-14 18:41:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:58,364 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-14 18:41:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-11-14 18:41:58,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:58,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:58,365 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-14 18:41:58,365 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-14 18:41:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:58,367 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-14 18:41:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-11-14 18:41:58,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:58,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:58,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:58,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:41:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-14 18:41:58,370 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 99 [2018-11-14 18:41:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:58,370 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-14 18:41:58,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:41:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-14 18:41:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 18:41:58,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:58,371 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:58,372 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:58,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1364908238, now seen corresponding path program 9 times [2018-11-14 18:41:58,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:58,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:58,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:58,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {6482#true} call ULTIMATE.init(); {6482#true} is VALID [2018-11-14 18:41:58,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {6482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6482#true} is VALID [2018-11-14 18:41:58,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:58,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6482#true} {6482#true} #111#return; {6482#true} is VALID [2018-11-14 18:41:58,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {6482#true} call #t~ret13 := main(); {6482#true} is VALID [2018-11-14 18:41:58,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {6482#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6484#(= main_~a~0 0)} is VALID [2018-11-14 18:41:58,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {6484#(= main_~a~0 0)} assume true; {6484#(= main_~a~0 0)} is VALID [2018-11-14 18:41:58,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {6484#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6484#(= main_~a~0 0)} is VALID [2018-11-14 18:41:58,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {6484#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:58,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {6485#(<= main_~a~0 1)} assume true; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:58,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {6485#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:58,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:58,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= main_~a~0 2)} assume true; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:58,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {6486#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:58,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {6486#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:58,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {6487#(<= main_~a~0 3)} assume true; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:58,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {6487#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:58,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {6487#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:58,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {6488#(<= main_~a~0 4)} assume true; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:58,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {6488#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:58,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {6488#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:58,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {6489#(<= main_~a~0 5)} assume true; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:58,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {6489#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:58,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {6489#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:58,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {6490#(<= main_~a~0 6)} assume true; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:58,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {6490#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:58,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {6490#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:58,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {6491#(<= main_~a~0 7)} assume true; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:58,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {6491#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:58,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {6491#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:58,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {6492#(<= main_~a~0 8)} assume true; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:58,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {6492#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:58,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {6492#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6493#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:58,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {6493#(<= main_~a~0 9)} assume true; {6493#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:58,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {6493#(<= main_~a~0 9)} assume !(~a~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:58,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {6483#false} havoc ~i~0;~i~0 := 0; {6483#false} is VALID [2018-11-14 18:41:58,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 18:41:58,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 18:41:58,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 18:41:58,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 18:41:58,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 18:41:58,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 18:41:58,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 18:41:58,770 INFO L273 TraceCheckUtils]: 47: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 18:41:58,770 INFO L273 TraceCheckUtils]: 48: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,770 INFO L273 TraceCheckUtils]: 49: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:58,771 INFO L273 TraceCheckUtils]: 50: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 18:41:58,771 INFO L273 TraceCheckUtils]: 51: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,771 INFO L273 TraceCheckUtils]: 52: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 18:41:58,771 INFO L273 TraceCheckUtils]: 53: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 18:41:58,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 55: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 62: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 63: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 64: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 65: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 18:41:58,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 70: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 71: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 72: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 73: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 74: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 75: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 76: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 18:41:58,774 INFO L273 TraceCheckUtils]: 77: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 78: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 79: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 80: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 81: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 82: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 83: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 84: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 85: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:58,775 INFO L273 TraceCheckUtils]: 86: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:58,776 INFO L273 TraceCheckUtils]: 87: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,776 INFO L273 TraceCheckUtils]: 88: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:58,776 INFO L273 TraceCheckUtils]: 89: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:58,776 INFO L273 TraceCheckUtils]: 90: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,776 INFO L273 TraceCheckUtils]: 91: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 92: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 93: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 94: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 95: Hoare triple {6483#false} havoc ~x~0;~x~0 := 0; {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 96: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:58,777 INFO L273 TraceCheckUtils]: 97: Hoare triple {6483#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {6483#false} is VALID [2018-11-14 18:41:58,778 INFO L256 TraceCheckUtils]: 98: Hoare triple {6483#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6483#false} is VALID [2018-11-14 18:41:58,778 INFO L273 TraceCheckUtils]: 99: Hoare triple {6483#false} ~cond := #in~cond; {6483#false} is VALID [2018-11-14 18:41:58,778 INFO L273 TraceCheckUtils]: 100: Hoare triple {6483#false} assume ~cond == 0; {6483#false} is VALID [2018-11-14 18:41:58,778 INFO L273 TraceCheckUtils]: 101: Hoare triple {6483#false} assume !false; {6483#false} is VALID [2018-11-14 18:41:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 18:41:58,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:41:58,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:41:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:41:58,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:41:58,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:58,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:59,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {6482#true} call ULTIMATE.init(); {6482#true} is VALID [2018-11-14 18:41:59,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {6482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6482#true} is VALID [2018-11-14 18:41:59,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6482#true} {6482#true} #111#return; {6482#true} is VALID [2018-11-14 18:41:59,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {6482#true} call #t~ret13 := main(); {6482#true} is VALID [2018-11-14 18:41:59,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {6482#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6482#true} is VALID [2018-11-14 18:41:59,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 18:41:59,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {6482#true} assume !(~a~0 < 100000); {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 35: Hoare triple {6482#true} havoc ~i~0;~i~0 := 0; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 18:41:59,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 48: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 49: Hoare triple {6482#true} assume !(~i~0 < 100000); {6482#true} is VALID [2018-11-14 18:41:59,114 INFO L273 TraceCheckUtils]: 50: Hoare triple {6482#true} ~i~0 := 0; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 55: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 56: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 18:41:59,115 INFO L273 TraceCheckUtils]: 57: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 58: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 62: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 18:41:59,116 INFO L273 TraceCheckUtils]: 64: Hoare triple {6482#true} assume !(~i~0 < 100000); {6482#true} is VALID [2018-11-14 18:41:59,117 INFO L273 TraceCheckUtils]: 65: Hoare triple {6482#true} ~i~0 := 0; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:59,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {6692#(<= main_~i~0 0)} assume true; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:59,117 INFO L273 TraceCheckUtils]: 67: Hoare triple {6692#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 18:41:59,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {6692#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:59,118 INFO L273 TraceCheckUtils]: 69: Hoare triple {6702#(<= main_~i~0 1)} assume true; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:59,118 INFO L273 TraceCheckUtils]: 70: Hoare triple {6702#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 18:41:59,119 INFO L273 TraceCheckUtils]: 71: Hoare triple {6702#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:59,119 INFO L273 TraceCheckUtils]: 72: Hoare triple {6712#(<= main_~i~0 2)} assume true; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:59,119 INFO L273 TraceCheckUtils]: 73: Hoare triple {6712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 18:41:59,120 INFO L273 TraceCheckUtils]: 74: Hoare triple {6712#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:59,120 INFO L273 TraceCheckUtils]: 75: Hoare triple {6722#(<= main_~i~0 3)} assume true; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:59,121 INFO L273 TraceCheckUtils]: 76: Hoare triple {6722#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 18:41:59,121 INFO L273 TraceCheckUtils]: 77: Hoare triple {6722#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6732#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:59,122 INFO L273 TraceCheckUtils]: 78: Hoare triple {6732#(<= main_~i~0 4)} assume true; {6732#(<= main_~i~0 4)} is VALID [2018-11-14 18:41:59,122 INFO L273 TraceCheckUtils]: 79: Hoare triple {6732#(<= main_~i~0 4)} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:59,123 INFO L273 TraceCheckUtils]: 80: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 18:41:59,123 INFO L273 TraceCheckUtils]: 81: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,123 INFO L273 TraceCheckUtils]: 82: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:59,123 INFO L273 TraceCheckUtils]: 83: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:59,123 INFO L273 TraceCheckUtils]: 84: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,124 INFO L273 TraceCheckUtils]: 85: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:59,124 INFO L273 TraceCheckUtils]: 86: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:59,124 INFO L273 TraceCheckUtils]: 87: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,124 INFO L273 TraceCheckUtils]: 88: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:59,124 INFO L273 TraceCheckUtils]: 89: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:59,125 INFO L273 TraceCheckUtils]: 90: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,125 INFO L273 TraceCheckUtils]: 91: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 18:41:59,125 INFO L273 TraceCheckUtils]: 92: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 18:41:59,125 INFO L273 TraceCheckUtils]: 93: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 94: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 95: Hoare triple {6483#false} havoc ~x~0;~x~0 := 0; {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 96: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 97: Hoare triple {6483#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L256 TraceCheckUtils]: 98: Hoare triple {6483#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 99: Hoare triple {6483#false} ~cond := #in~cond; {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 100: Hoare triple {6483#false} assume ~cond == 0; {6483#false} is VALID [2018-11-14 18:41:59,126 INFO L273 TraceCheckUtils]: 101: Hoare triple {6483#false} assume !false; {6483#false} is VALID [2018-11-14 18:41:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-14 18:41:59,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:59,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-14 18:41:59,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-11-14 18:41:59,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:59,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:41:59,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:59,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:41:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:41:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:41:59,254 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 17 states. [2018-11-14 18:42:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:00,341 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-11-14 18:42:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:42:00,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-11-14 18:42:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:42:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2018-11-14 18:42:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:42:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2018-11-14 18:42:00,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 169 transitions. [2018-11-14 18:42:00,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:00,941 INFO L225 Difference]: With dead ends: 199 [2018-11-14 18:42:00,941 INFO L226 Difference]: Without dead ends: 127 [2018-11-14 18:42:00,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:42:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-14 18:42:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-11-14 18:42:01,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:01,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 122 states. [2018-11-14 18:42:01,045 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 122 states. [2018-11-14 18:42:01,046 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 122 states. [2018-11-14 18:42:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:01,050 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-14 18:42:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-11-14 18:42:01,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:01,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:01,051 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 127 states. [2018-11-14 18:42:01,051 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 127 states. [2018-11-14 18:42:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:01,053 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-14 18:42:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-11-14 18:42:01,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:01,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:01,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:01,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 18:42:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-11-14 18:42:01,057 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 102 [2018-11-14 18:42:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:01,058 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-11-14 18:42:01,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:42:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-14 18:42:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 18:42:01,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:01,060 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:01,060 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:01,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 387033355, now seen corresponding path program 10 times [2018-11-14 18:42:01,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:01,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:02,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2018-11-14 18:42:02,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7486#true} is VALID [2018-11-14 18:42:02,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2018-11-14 18:42:02,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #111#return; {7486#true} is VALID [2018-11-14 18:42:02,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret13 := main(); {7486#true} is VALID [2018-11-14 18:42:02,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {7486#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7488#(= main_~a~0 0)} is VALID [2018-11-14 18:42:02,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {7488#(= main_~a~0 0)} assume true; {7488#(= main_~a~0 0)} is VALID [2018-11-14 18:42:02,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {7488#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7488#(= main_~a~0 0)} is VALID [2018-11-14 18:42:02,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {7488#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {7489#(<= main_~a~0 1)} assume true; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {7489#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {7489#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {7490#(<= main_~a~0 2)} assume true; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {7490#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {7490#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {7491#(<= main_~a~0 3)} assume true; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {7491#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {7492#(<= main_~a~0 4)} assume true; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {7492#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {7492#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {7493#(<= main_~a~0 5)} assume true; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {7493#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {7493#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {7494#(<= main_~a~0 6)} assume true; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {7494#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {7494#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {7495#(<= main_~a~0 7)} assume true; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {7495#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {7495#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {7496#(<= main_~a~0 8)} assume true; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {7496#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {7496#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {7497#(<= main_~a~0 9)} assume true; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {7497#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {7497#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:02,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {7498#(<= main_~a~0 10)} assume true; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:02,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {7498#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {7487#false} havoc ~i~0;~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,295 INFO L273 TraceCheckUtils]: 51: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,295 INFO L273 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,295 INFO L273 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,295 INFO L273 TraceCheckUtils]: 54: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,296 INFO L273 TraceCheckUtils]: 55: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,296 INFO L273 TraceCheckUtils]: 56: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,296 INFO L273 TraceCheckUtils]: 57: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,296 INFO L273 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,296 INFO L273 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 60: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 61: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 62: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 63: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 64: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 65: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 66: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,297 INFO L273 TraceCheckUtils]: 67: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 69: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 70: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 72: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 73: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 74: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 77: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 78: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 79: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 80: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 81: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 82: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 83: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,299 INFO L273 TraceCheckUtils]: 84: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 85: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 86: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 87: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 88: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 89: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 90: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 91: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,300 INFO L273 TraceCheckUtils]: 92: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 93: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 94: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 95: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 96: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 97: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 98: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 99: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 100: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,301 INFO L273 TraceCheckUtils]: 101: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 102: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 103: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 104: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 105: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 106: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 107: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 108: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,302 INFO L273 TraceCheckUtils]: 109: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 110: Hoare triple {7487#false} havoc ~x~0;~x~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 111: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 112: Hoare triple {7487#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L256 TraceCheckUtils]: 113: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 114: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 115: Hoare triple {7487#false} assume ~cond == 0; {7487#false} is VALID [2018-11-14 18:42:02,303 INFO L273 TraceCheckUtils]: 116: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2018-11-14 18:42:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 18:42:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:02,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:02,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:42:02,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:42:02,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:02,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:02,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2018-11-14 18:42:02,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7486#true} is VALID [2018-11-14 18:42:02,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2018-11-14 18:42:02,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #111#return; {7486#true} is VALID [2018-11-14 18:42:02,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret13 := main(); {7486#true} is VALID [2018-11-14 18:42:02,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {7486#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:02,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {7517#(<= main_~a~0 0)} assume true; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:02,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {7517#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:02,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {7517#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {7489#(<= main_~a~0 1)} assume true; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {7489#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:02,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {7489#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {7490#(<= main_~a~0 2)} assume true; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {7490#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:02,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {7490#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {7491#(<= main_~a~0 3)} assume true; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {7491#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:02,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {7492#(<= main_~a~0 4)} assume true; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {7492#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:02,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {7492#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {7493#(<= main_~a~0 5)} assume true; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {7493#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:02,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {7493#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {7494#(<= main_~a~0 6)} assume true; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {7494#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:02,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {7494#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {7495#(<= main_~a~0 7)} assume true; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {7495#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:02,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {7495#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {7496#(<= main_~a~0 8)} assume true; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {7496#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:02,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {7496#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {7497#(<= main_~a~0 9)} assume true; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {7497#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:02,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {7497#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:02,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {7498#(<= main_~a~0 10)} assume true; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:02,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {7498#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {7487#false} havoc ~i~0;~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 42: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 69: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 73: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 76: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 77: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 80: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 81: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 82: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,835 INFO L273 TraceCheckUtils]: 83: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 85: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 86: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 89: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 18:42:02,836 INFO L273 TraceCheckUtils]: 90: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 93: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 94: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 95: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,837 INFO L273 TraceCheckUtils]: 96: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,838 INFO L273 TraceCheckUtils]: 98: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,838 INFO L273 TraceCheckUtils]: 99: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,838 INFO L273 TraceCheckUtils]: 100: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 102: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 103: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 104: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 105: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 106: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 18:42:02,839 INFO L273 TraceCheckUtils]: 107: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L273 TraceCheckUtils]: 108: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L273 TraceCheckUtils]: 109: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L273 TraceCheckUtils]: 110: Hoare triple {7487#false} havoc ~x~0;~x~0 := 0; {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L273 TraceCheckUtils]: 111: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L273 TraceCheckUtils]: 112: Hoare triple {7487#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {7487#false} is VALID [2018-11-14 18:42:02,840 INFO L256 TraceCheckUtils]: 113: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7487#false} is VALID [2018-11-14 18:42:02,841 INFO L273 TraceCheckUtils]: 114: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2018-11-14 18:42:02,841 INFO L273 TraceCheckUtils]: 115: Hoare triple {7487#false} assume ~cond == 0; {7487#false} is VALID [2018-11-14 18:42:02,841 INFO L273 TraceCheckUtils]: 116: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2018-11-14 18:42:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 18:42:02,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:42:02,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 18:42:02,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:02,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:42:02,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:02,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:42:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:42:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:42:02,948 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 14 states. [2018-11-14 18:42:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:03,879 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-11-14 18:42:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:42:03,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 18:42:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:42:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 18:42:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:42:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 18:42:03,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2018-11-14 18:42:04,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:04,391 INFO L225 Difference]: With dead ends: 210 [2018-11-14 18:42:04,392 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 18:42:04,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:42:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 18:42:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 18:42:04,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:04,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 18:42:04,427 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 18:42:04,427 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 18:42:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:04,430 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-14 18:42:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-11-14 18:42:04,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:04,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:04,431 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 18:42:04,431 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 18:42:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:04,434 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-14 18:42:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-11-14 18:42:04,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:04,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:04,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:04,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 18:42:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-11-14 18:42:04,438 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 117 [2018-11-14 18:42:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:04,438 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-11-14 18:42:04,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:42:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-11-14 18:42:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 18:42:04,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:04,440 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:04,440 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:04,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1530837044, now seen corresponding path program 11 times [2018-11-14 18:42:04,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:04,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:04,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:05,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {8550#true} call ULTIMATE.init(); {8550#true} is VALID [2018-11-14 18:42:05,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {8550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8550#true} is VALID [2018-11-14 18:42:05,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:05,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8550#true} {8550#true} #111#return; {8550#true} is VALID [2018-11-14 18:42:05,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {8550#true} call #t~ret13 := main(); {8550#true} is VALID [2018-11-14 18:42:05,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {8550#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8552#(= main_~a~0 0)} is VALID [2018-11-14 18:42:05,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {8552#(= main_~a~0 0)} assume true; {8552#(= main_~a~0 0)} is VALID [2018-11-14 18:42:05,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {8552#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8552#(= main_~a~0 0)} is VALID [2018-11-14 18:42:05,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {8552#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:05,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {8553#(<= main_~a~0 1)} assume true; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:05,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {8553#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:05,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {8553#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:05,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {8554#(<= main_~a~0 2)} assume true; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:05,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {8554#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:05,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {8554#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:05,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {8555#(<= main_~a~0 3)} assume true; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:05,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {8555#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:05,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {8555#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:05,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {8556#(<= main_~a~0 4)} assume true; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:05,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {8556#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:05,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {8556#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:05,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#(<= main_~a~0 5)} assume true; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:05,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {8557#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:05,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {8557#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:05,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {8558#(<= main_~a~0 6)} assume true; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:05,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {8558#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:05,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {8558#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:05,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {8559#(<= main_~a~0 7)} assume true; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:05,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {8559#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:05,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {8559#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:05,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {8560#(<= main_~a~0 8)} assume true; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:05,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {8560#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:05,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {8560#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:05,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {8561#(<= main_~a~0 9)} assume true; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:05,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {8561#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:05,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {8561#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:05,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {8562#(<= main_~a~0 10)} assume true; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:05,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {8562#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:05,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {8562#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:05,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {8563#(<= main_~a~0 11)} assume true; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:05,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {8563#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:05,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {8551#false} havoc ~i~0;~i~0 := 0; {8551#false} is VALID [2018-11-14 18:42:05,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 46: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 47: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 18:42:05,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 18:42:05,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 18:42:05,168 INFO L273 TraceCheckUtils]: 51: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,168 INFO L273 TraceCheckUtils]: 52: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 18:42:05,168 INFO L273 TraceCheckUtils]: 53: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 18:42:05,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 18:42:05,169 INFO L273 TraceCheckUtils]: 56: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 18:42:05,169 INFO L273 TraceCheckUtils]: 57: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,169 INFO L273 TraceCheckUtils]: 58: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 59: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 60: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 62: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 63: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,170 INFO L273 TraceCheckUtils]: 64: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 65: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 67: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 68: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 71: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 74: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 75: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 76: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 79: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 83: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 88: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 89: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 90: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 92: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 94: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 95: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 96: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 97: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 98: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 18:42:05,174 INFO L273 TraceCheckUtils]: 99: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 100: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 101: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 102: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 103: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 104: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 105: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 106: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 107: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 18:42:05,175 INFO L273 TraceCheckUtils]: 108: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 109: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 110: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 111: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 112: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 113: Hoare triple {8551#false} havoc ~x~0;~x~0 := 0; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 114: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {8551#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L256 TraceCheckUtils]: 116: Hoare triple {8551#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8551#false} is VALID [2018-11-14 18:42:05,176 INFO L273 TraceCheckUtils]: 117: Hoare triple {8551#false} ~cond := #in~cond; {8551#false} is VALID [2018-11-14 18:42:05,177 INFO L273 TraceCheckUtils]: 118: Hoare triple {8551#false} assume ~cond == 0; {8551#false} is VALID [2018-11-14 18:42:05,177 INFO L273 TraceCheckUtils]: 119: Hoare triple {8551#false} assume !false; {8551#false} is VALID [2018-11-14 18:42:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 18:42:05,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:05,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:42:23,772 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:42:23,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:23,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:24,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {8550#true} call ULTIMATE.init(); {8550#true} is VALID [2018-11-14 18:42:24,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {8550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8550#true} is VALID [2018-11-14 18:42:24,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8550#true} {8550#true} #111#return; {8550#true} is VALID [2018-11-14 18:42:24,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {8550#true} call #t~ret13 := main(); {8550#true} is VALID [2018-11-14 18:42:24,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {8550#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8550#true} is VALID [2018-11-14 18:42:24,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 29: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 33: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {8550#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {8550#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 40: Hoare triple {8550#true} assume !(~a~0 < 100000); {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {8550#true} havoc ~i~0;~i~0 := 0; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 44: Hoare triple {8550#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8550#true} is VALID [2018-11-14 18:42:24,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 47: Hoare triple {8550#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 49: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 50: Hoare triple {8550#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8550#true} is VALID [2018-11-14 18:42:24,051 INFO L273 TraceCheckUtils]: 53: Hoare triple {8550#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 54: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 55: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 56: Hoare triple {8550#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 57: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 58: Hoare triple {8550#true} assume !(~i~0 < 100000); {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 59: Hoare triple {8550#true} ~i~0 := 0; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 61: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8550#true} is VALID [2018-11-14 18:42:24,052 INFO L273 TraceCheckUtils]: 62: Hoare triple {8550#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 63: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 65: Hoare triple {8550#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 66: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 67: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 68: Hoare triple {8550#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 69: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,053 INFO L273 TraceCheckUtils]: 70: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 71: Hoare triple {8550#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 72: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 73: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 74: Hoare triple {8550#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 75: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 76: Hoare triple {8550#true} assume !(~i~0 < 100000); {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 77: Hoare triple {8550#true} ~i~0 := 0; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 78: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,054 INFO L273 TraceCheckUtils]: 79: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 80: Hoare triple {8550#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 81: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 82: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 83: Hoare triple {8550#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 84: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 85: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8550#true} is VALID [2018-11-14 18:42:24,055 INFO L273 TraceCheckUtils]: 86: Hoare triple {8550#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 87: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 88: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 89: Hoare triple {8550#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 90: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 91: Hoare triple {8550#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 92: Hoare triple {8550#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8550#true} is VALID [2018-11-14 18:42:24,056 INFO L273 TraceCheckUtils]: 93: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 18:42:24,057 INFO L273 TraceCheckUtils]: 94: Hoare triple {8550#true} assume !(~i~0 < 100000); {8550#true} is VALID [2018-11-14 18:42:24,057 INFO L273 TraceCheckUtils]: 95: Hoare triple {8550#true} ~i~0 := 0; {8852#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:24,057 INFO L273 TraceCheckUtils]: 96: Hoare triple {8852#(<= main_~i~0 0)} assume true; {8852#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:24,058 INFO L273 TraceCheckUtils]: 97: Hoare triple {8852#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8852#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:24,058 INFO L273 TraceCheckUtils]: 98: Hoare triple {8852#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8862#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:24,058 INFO L273 TraceCheckUtils]: 99: Hoare triple {8862#(<= main_~i~0 1)} assume true; {8862#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:24,059 INFO L273 TraceCheckUtils]: 100: Hoare triple {8862#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8862#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:24,059 INFO L273 TraceCheckUtils]: 101: Hoare triple {8862#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8872#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,059 INFO L273 TraceCheckUtils]: 102: Hoare triple {8872#(<= main_~i~0 2)} assume true; {8872#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,060 INFO L273 TraceCheckUtils]: 103: Hoare triple {8872#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8872#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:24,060 INFO L273 TraceCheckUtils]: 104: Hoare triple {8872#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8882#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,061 INFO L273 TraceCheckUtils]: 105: Hoare triple {8882#(<= main_~i~0 3)} assume true; {8882#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,061 INFO L273 TraceCheckUtils]: 106: Hoare triple {8882#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8882#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:24,062 INFO L273 TraceCheckUtils]: 107: Hoare triple {8882#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8892#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,063 INFO L273 TraceCheckUtils]: 108: Hoare triple {8892#(<= main_~i~0 4)} assume true; {8892#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,063 INFO L273 TraceCheckUtils]: 109: Hoare triple {8892#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8892#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:24,064 INFO L273 TraceCheckUtils]: 110: Hoare triple {8892#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,064 INFO L273 TraceCheckUtils]: 111: Hoare triple {8902#(<= main_~i~0 5)} assume true; {8902#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:24,065 INFO L273 TraceCheckUtils]: 112: Hoare triple {8902#(<= main_~i~0 5)} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 18:42:24,065 INFO L273 TraceCheckUtils]: 113: Hoare triple {8551#false} havoc ~x~0;~x~0 := 0; {8551#false} is VALID [2018-11-14 18:42:24,066 INFO L273 TraceCheckUtils]: 114: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 18:42:24,066 INFO L273 TraceCheckUtils]: 115: Hoare triple {8551#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {8551#false} is VALID [2018-11-14 18:42:24,066 INFO L256 TraceCheckUtils]: 116: Hoare triple {8551#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8551#false} is VALID [2018-11-14 18:42:24,066 INFO L273 TraceCheckUtils]: 117: Hoare triple {8551#false} ~cond := #in~cond; {8551#false} is VALID [2018-11-14 18:42:24,066 INFO L273 TraceCheckUtils]: 118: Hoare triple {8551#false} assume ~cond == 0; {8551#false} is VALID [2018-11-14 18:42:24,067 INFO L273 TraceCheckUtils]: 119: Hoare triple {8551#false} assume !false; {8551#false} is VALID [2018-11-14 18:42:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-14 18:42:24,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:24,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-14 18:42:24,101 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2018-11-14 18:42:24,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:24,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:42:24,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:24,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:42:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:42:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:42:24,223 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 20 states. [2018-11-14 18:42:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:25,442 INFO L93 Difference]: Finished difference Result 229 states and 243 transitions. [2018-11-14 18:42:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:42:25,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2018-11-14 18:42:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:42:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2018-11-14 18:42:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:42:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2018-11-14 18:42:25,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 187 transitions. [2018-11-14 18:42:26,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:26,147 INFO L225 Difference]: With dead ends: 229 [2018-11-14 18:42:26,147 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 18:42:26,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:42:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 18:42:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-14 18:42:26,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:26,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 140 states. [2018-11-14 18:42:26,197 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 140 states. [2018-11-14 18:42:26,197 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 140 states. [2018-11-14 18:42:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:26,201 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2018-11-14 18:42:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2018-11-14 18:42:26,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:26,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:26,202 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 145 states. [2018-11-14 18:42:26,202 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 145 states. [2018-11-14 18:42:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:26,205 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2018-11-14 18:42:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2018-11-14 18:42:26,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:26,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:26,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:26,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 18:42:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-11-14 18:42:26,210 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 120 [2018-11-14 18:42:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:26,210 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-11-14 18:42:26,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:42:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-11-14 18:42:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-14 18:42:26,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:26,212 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:26,213 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:26,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 620471985, now seen corresponding path program 12 times [2018-11-14 18:42:26,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:26,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:26,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:26,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:26,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {9711#true} call ULTIMATE.init(); {9711#true} is VALID [2018-11-14 18:42:26,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {9711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9711#true} is VALID [2018-11-14 18:42:26,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:26,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9711#true} {9711#true} #111#return; {9711#true} is VALID [2018-11-14 18:42:26,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {9711#true} call #t~ret13 := main(); {9711#true} is VALID [2018-11-14 18:42:26,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {9711#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9713#(= main_~a~0 0)} is VALID [2018-11-14 18:42:26,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {9713#(= main_~a~0 0)} assume true; {9713#(= main_~a~0 0)} is VALID [2018-11-14 18:42:26,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {9713#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9713#(= main_~a~0 0)} is VALID [2018-11-14 18:42:26,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {9713#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9714#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:26,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {9714#(<= main_~a~0 1)} assume true; {9714#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:26,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {9714#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9714#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:26,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {9714#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9715#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:26,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {9715#(<= main_~a~0 2)} assume true; {9715#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:26,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {9715#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9715#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:26,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {9715#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9716#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:26,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {9716#(<= main_~a~0 3)} assume true; {9716#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:26,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {9716#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9716#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:26,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {9716#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9717#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:26,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {9717#(<= main_~a~0 4)} assume true; {9717#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:26,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {9717#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9717#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:26,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {9717#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9718#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:26,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {9718#(<= main_~a~0 5)} assume true; {9718#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:26,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {9718#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9718#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:26,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {9718#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9719#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:26,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {9719#(<= main_~a~0 6)} assume true; {9719#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:26,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {9719#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9719#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:26,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {9719#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9720#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:26,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {9720#(<= main_~a~0 7)} assume true; {9720#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:26,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {9720#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9720#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:26,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {9720#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9721#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:26,985 INFO L273 TraceCheckUtils]: 30: Hoare triple {9721#(<= main_~a~0 8)} assume true; {9721#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:26,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {9721#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9721#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:26,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {9721#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9722#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:26,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {9722#(<= main_~a~0 9)} assume true; {9722#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:26,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {9722#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9722#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:26,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {9722#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9723#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:26,988 INFO L273 TraceCheckUtils]: 36: Hoare triple {9723#(<= main_~a~0 10)} assume true; {9723#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:26,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {9723#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9723#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:26,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {9723#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9724#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:26,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {9724#(<= main_~a~0 11)} assume true; {9724#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:26,991 INFO L273 TraceCheckUtils]: 40: Hoare triple {9724#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {9724#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:26,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {9724#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9725#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:26,992 INFO L273 TraceCheckUtils]: 42: Hoare triple {9725#(<= main_~a~0 12)} assume true; {9725#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:26,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {9725#(<= main_~a~0 12)} assume !(~a~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:26,993 INFO L273 TraceCheckUtils]: 44: Hoare triple {9712#false} havoc ~i~0;~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:26,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,993 INFO L273 TraceCheckUtils]: 47: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,994 INFO L273 TraceCheckUtils]: 51: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,994 INFO L273 TraceCheckUtils]: 52: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 59: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {9712#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 64: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {9712#false} ~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:26,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 67: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 70: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 71: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 75: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 78: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 79: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 81: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 82: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9712#false} is VALID [2018-11-14 18:42:26,998 INFO L273 TraceCheckUtils]: 83: Hoare triple {9712#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 84: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {9712#false} ~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 87: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 88: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 89: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 90: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 91: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:26,999 INFO L273 TraceCheckUtils]: 92: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 93: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 94: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 95: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 96: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 97: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 98: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 99: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,000 INFO L273 TraceCheckUtils]: 100: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 101: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 102: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 103: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 104: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 105: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 106: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 107: Hoare triple {9712#false} ~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 108: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,001 INFO L273 TraceCheckUtils]: 109: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 110: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 111: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 112: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 113: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 114: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 115: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 116: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 117: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,002 INFO L273 TraceCheckUtils]: 118: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 119: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 120: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 121: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 122: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 123: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 124: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 125: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:27,003 INFO L273 TraceCheckUtils]: 126: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 127: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 128: Hoare triple {9712#false} havoc ~x~0;~x~0 := 0; {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 129: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 130: Hoare triple {9712#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L256 TraceCheckUtils]: 131: Hoare triple {9712#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 132: Hoare triple {9712#false} ~cond := #in~cond; {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 133: Hoare triple {9712#false} assume ~cond == 0; {9712#false} is VALID [2018-11-14 18:42:27,004 INFO L273 TraceCheckUtils]: 134: Hoare triple {9712#false} assume !false; {9712#false} is VALID [2018-11-14 18:42:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 18:42:27,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:27,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:42:31,441 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:42:31,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:31,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:31,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {9711#true} call ULTIMATE.init(); {9711#true} is VALID [2018-11-14 18:42:31,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {9711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9711#true} is VALID [2018-11-14 18:42:31,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,949 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9711#true} {9711#true} #111#return; {9711#true} is VALID [2018-11-14 18:42:31,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {9711#true} call #t~ret13 := main(); {9711#true} is VALID [2018-11-14 18:42:31,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {9711#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9711#true} is VALID [2018-11-14 18:42:31,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 37: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {9711#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {9711#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {9711#true} assume !(~a~0 < 100000); {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {9711#true} havoc ~i~0;~i~0 := 0; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9711#true} is VALID [2018-11-14 18:42:31,955 INFO L273 TraceCheckUtils]: 47: Hoare triple {9711#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 50: Hoare triple {9711#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {9711#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 55: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9711#true} is VALID [2018-11-14 18:42:31,956 INFO L273 TraceCheckUtils]: 56: Hoare triple {9711#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9711#true} is VALID [2018-11-14 18:42:31,957 INFO L273 TraceCheckUtils]: 57: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,957 INFO L273 TraceCheckUtils]: 58: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9711#true} is VALID [2018-11-14 18:42:31,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {9711#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9711#true} is VALID [2018-11-14 18:42:31,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {9711#true} assume true; {9711#true} is VALID [2018-11-14 18:42:31,957 INFO L273 TraceCheckUtils]: 61: Hoare triple {9711#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9912#(< main_~i~0 100000)} is VALID [2018-11-14 18:42:31,958 INFO L273 TraceCheckUtils]: 62: Hoare triple {9912#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9916#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:31,958 INFO L273 TraceCheckUtils]: 63: Hoare triple {9916#(<= main_~i~0 100000)} assume true; {9916#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:31,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {9916#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {9711#true} is VALID [2018-11-14 18:42:31,959 INFO L273 TraceCheckUtils]: 65: Hoare triple {9711#true} ~i~0 := 0; {9926#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:31,959 INFO L273 TraceCheckUtils]: 66: Hoare triple {9926#(<= main_~i~0 0)} assume true; {9926#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:31,959 INFO L273 TraceCheckUtils]: 67: Hoare triple {9926#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9926#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:31,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {9926#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9936#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:31,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {9936#(<= main_~i~0 1)} assume true; {9936#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:31,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {9936#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9936#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:31,961 INFO L273 TraceCheckUtils]: 71: Hoare triple {9936#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9946#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:31,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {9946#(<= main_~i~0 2)} assume true; {9946#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:31,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {9946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9946#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:31,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {9946#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9956#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:31,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {9956#(<= main_~i~0 3)} assume true; {9956#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:31,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {9956#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9956#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:31,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {9956#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9966#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:31,965 INFO L273 TraceCheckUtils]: 78: Hoare triple {9966#(<= main_~i~0 4)} assume true; {9966#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:31,966 INFO L273 TraceCheckUtils]: 79: Hoare triple {9966#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9966#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:31,967 INFO L273 TraceCheckUtils]: 80: Hoare triple {9966#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9976#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:31,967 INFO L273 TraceCheckUtils]: 81: Hoare triple {9976#(<= main_~i~0 5)} assume true; {9976#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:31,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {9976#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9976#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:31,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {9976#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9986#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:31,969 INFO L273 TraceCheckUtils]: 84: Hoare triple {9986#(<= main_~i~0 6)} assume true; {9986#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:31,970 INFO L273 TraceCheckUtils]: 85: Hoare triple {9986#(<= main_~i~0 6)} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:31,970 INFO L273 TraceCheckUtils]: 86: Hoare triple {9712#false} ~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:31,970 INFO L273 TraceCheckUtils]: 87: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,970 INFO L273 TraceCheckUtils]: 88: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,970 INFO L273 TraceCheckUtils]: 89: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,971 INFO L273 TraceCheckUtils]: 90: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,971 INFO L273 TraceCheckUtils]: 91: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,971 INFO L273 TraceCheckUtils]: 92: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,971 INFO L273 TraceCheckUtils]: 93: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,971 INFO L273 TraceCheckUtils]: 94: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,972 INFO L273 TraceCheckUtils]: 98: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,972 INFO L273 TraceCheckUtils]: 99: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,973 INFO L273 TraceCheckUtils]: 100: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,973 INFO L273 TraceCheckUtils]: 102: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9712#false} is VALID [2018-11-14 18:42:31,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {9712#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9712#false} is VALID [2018-11-14 18:42:31,974 INFO L273 TraceCheckUtils]: 105: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,974 INFO L273 TraceCheckUtils]: 106: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:31,974 INFO L273 TraceCheckUtils]: 107: Hoare triple {9712#false} ~i~0 := 0; {9712#false} is VALID [2018-11-14 18:42:31,974 INFO L273 TraceCheckUtils]: 108: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,974 INFO L273 TraceCheckUtils]: 109: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 110: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 111: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 112: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 113: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 114: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 115: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,975 INFO L273 TraceCheckUtils]: 116: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 117: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 118: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 119: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 120: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 121: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 122: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 123: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 124: Hoare triple {9712#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9712#false} is VALID [2018-11-14 18:42:31,976 INFO L273 TraceCheckUtils]: 125: Hoare triple {9712#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 126: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 127: Hoare triple {9712#false} assume !(~i~0 < 100000); {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 128: Hoare triple {9712#false} havoc ~x~0;~x~0 := 0; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 129: Hoare triple {9712#false} assume true; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 130: Hoare triple {9712#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L256 TraceCheckUtils]: 131: Hoare triple {9712#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 132: Hoare triple {9712#false} ~cond := #in~cond; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 133: Hoare triple {9712#false} assume ~cond == 0; {9712#false} is VALID [2018-11-14 18:42:31,977 INFO L273 TraceCheckUtils]: 134: Hoare triple {9712#false} assume !false; {9712#false} is VALID [2018-11-14 18:42:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 17 proven. 57 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-11-14 18:42:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:32,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-14 18:42:32,007 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-11-14 18:42:32,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:32,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:42:32,101 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-14 18:42:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:42:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:42:32,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:42:32,102 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 24 states. [2018-11-14 18:42:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:33,250 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions. [2018-11-14 18:42:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:42:33,250 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-11-14 18:42:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:42:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 214 transitions. [2018-11-14 18:42:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:42:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 214 transitions. [2018-11-14 18:42:33,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 214 transitions. [2018-11-14 18:42:33,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:33,515 INFO L225 Difference]: With dead ends: 264 [2018-11-14 18:42:33,515 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 18:42:33,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:42:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 18:42:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-11-14 18:42:33,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:33,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 167 states. [2018-11-14 18:42:33,592 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 167 states. [2018-11-14 18:42:33,592 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 167 states. [2018-11-14 18:42:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:33,595 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-14 18:42:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2018-11-14 18:42:33,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:33,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:33,596 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 168 states. [2018-11-14 18:42:33,596 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 168 states. [2018-11-14 18:42:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:33,600 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-14 18:42:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2018-11-14 18:42:33,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:33,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:33,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:33,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 18:42:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 172 transitions. [2018-11-14 18:42:33,603 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 172 transitions. Word has length 135 [2018-11-14 18:42:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:33,603 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 172 transitions. [2018-11-14 18:42:33,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:42:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 172 transitions. [2018-11-14 18:42:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-14 18:42:33,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:33,605 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:33,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:33,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -291016718, now seen corresponding path program 13 times [2018-11-14 18:42:33,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:33,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:33,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:33,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {11051#true} call ULTIMATE.init(); {11051#true} is VALID [2018-11-14 18:42:33,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {11051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11051#true} is VALID [2018-11-14 18:42:33,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {11051#true} assume true; {11051#true} is VALID [2018-11-14 18:42:33,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11051#true} {11051#true} #111#return; {11051#true} is VALID [2018-11-14 18:42:33,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {11051#true} call #t~ret13 := main(); {11051#true} is VALID [2018-11-14 18:42:33,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {11051#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11053#(= main_~a~0 0)} is VALID [2018-11-14 18:42:33,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {11053#(= main_~a~0 0)} assume true; {11053#(= main_~a~0 0)} is VALID [2018-11-14 18:42:33,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {11053#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11053#(= main_~a~0 0)} is VALID [2018-11-14 18:42:33,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {11053#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:33,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {11054#(<= main_~a~0 1)} assume true; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:33,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {11054#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:33,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {11054#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:33,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {11055#(<= main_~a~0 2)} assume true; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:33,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {11055#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:33,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {11055#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:33,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {11056#(<= main_~a~0 3)} assume true; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:33,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {11056#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:33,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {11056#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:33,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {11057#(<= main_~a~0 4)} assume true; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:33,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {11057#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:33,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {11057#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:33,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {11058#(<= main_~a~0 5)} assume true; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:33,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {11058#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:33,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {11058#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:33,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {11059#(<= main_~a~0 6)} assume true; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:33,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {11059#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:33,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {11059#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:33,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {11060#(<= main_~a~0 7)} assume true; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:33,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {11060#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:33,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {11060#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:33,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {11061#(<= main_~a~0 8)} assume true; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:33,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {11061#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:33,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {11061#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:33,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {11062#(<= main_~a~0 9)} assume true; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:33,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {11062#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:33,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {11062#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:33,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {11063#(<= main_~a~0 10)} assume true; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:33,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {11063#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:33,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {11063#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:33,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {11064#(<= main_~a~0 11)} assume true; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:33,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {11064#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:33,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {11064#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:33,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {11065#(<= main_~a~0 12)} assume true; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:33,913 INFO L273 TraceCheckUtils]: 43: Hoare triple {11065#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:33,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {11065#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11066#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:33,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {11066#(<= main_~a~0 13)} assume true; {11066#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:33,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {11066#(<= main_~a~0 13)} assume !(~a~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:33,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {11052#false} havoc ~i~0;~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:33,915 INFO L273 TraceCheckUtils]: 48: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,916 INFO L273 TraceCheckUtils]: 50: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,916 INFO L273 TraceCheckUtils]: 51: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,916 INFO L273 TraceCheckUtils]: 52: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,917 INFO L273 TraceCheckUtils]: 57: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,917 INFO L273 TraceCheckUtils]: 58: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,918 INFO L273 TraceCheckUtils]: 60: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,919 INFO L273 TraceCheckUtils]: 65: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,919 INFO L273 TraceCheckUtils]: 66: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 76: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 82: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 85: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,921 INFO L273 TraceCheckUtils]: 86: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 88: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 89: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 90: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 91: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 92: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,922 INFO L273 TraceCheckUtils]: 93: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 95: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 96: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 97: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 98: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 99: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 100: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:33,923 INFO L273 TraceCheckUtils]: 101: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 102: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 104: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 105: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 106: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 108: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 109: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,924 INFO L273 TraceCheckUtils]: 110: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 111: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 112: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 113: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 114: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 115: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 116: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 117: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 118: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,925 INFO L273 TraceCheckUtils]: 119: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 120: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 121: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 122: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 123: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 124: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 125: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 126: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,926 INFO L273 TraceCheckUtils]: 127: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 128: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 129: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 130: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 131: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 132: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 133: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 134: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 135: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,927 INFO L273 TraceCheckUtils]: 136: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 137: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 138: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 139: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 140: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 141: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 142: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 143: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 144: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,928 INFO L273 TraceCheckUtils]: 145: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 146: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 147: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 148: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 149: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 150: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 151: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 152: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 153: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,929 INFO L273 TraceCheckUtils]: 154: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 155: Hoare triple {11052#false} havoc ~x~0;~x~0 := 0; {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 156: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 157: Hoare triple {11052#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L256 TraceCheckUtils]: 158: Hoare triple {11052#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 159: Hoare triple {11052#false} ~cond := #in~cond; {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 160: Hoare triple {11052#false} assume ~cond == 0; {11052#false} is VALID [2018-11-14 18:42:33,930 INFO L273 TraceCheckUtils]: 161: Hoare triple {11052#false} assume !false; {11052#false} is VALID [2018-11-14 18:42:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 18:42:33,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:33,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:33,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:34,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:34,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {11051#true} call ULTIMATE.init(); {11051#true} is VALID [2018-11-14 18:42:34,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {11051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11051#true} is VALID [2018-11-14 18:42:34,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {11051#true} assume true; {11051#true} is VALID [2018-11-14 18:42:34,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11051#true} {11051#true} #111#return; {11051#true} is VALID [2018-11-14 18:42:34,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {11051#true} call #t~ret13 := main(); {11051#true} is VALID [2018-11-14 18:42:34,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {11051#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11085#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:34,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {11085#(<= main_~a~0 0)} assume true; {11085#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:34,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {11085#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11085#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:34,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {11085#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:34,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {11054#(<= main_~a~0 1)} assume true; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:34,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {11054#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11054#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:34,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {11054#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:34,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {11055#(<= main_~a~0 2)} assume true; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:34,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {11055#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11055#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:34,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {11055#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:34,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {11056#(<= main_~a~0 3)} assume true; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:34,254 INFO L273 TraceCheckUtils]: 16: Hoare triple {11056#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11056#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:34,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {11056#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:34,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {11057#(<= main_~a~0 4)} assume true; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:34,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {11057#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11057#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:34,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {11057#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:34,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {11058#(<= main_~a~0 5)} assume true; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:34,258 INFO L273 TraceCheckUtils]: 22: Hoare triple {11058#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11058#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:34,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {11058#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:34,259 INFO L273 TraceCheckUtils]: 24: Hoare triple {11059#(<= main_~a~0 6)} assume true; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:34,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {11059#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11059#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:34,260 INFO L273 TraceCheckUtils]: 26: Hoare triple {11059#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:34,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {11060#(<= main_~a~0 7)} assume true; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:34,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {11060#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11060#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:34,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {11060#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:34,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {11061#(<= main_~a~0 8)} assume true; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:34,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {11061#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11061#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:34,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {11061#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:34,264 INFO L273 TraceCheckUtils]: 33: Hoare triple {11062#(<= main_~a~0 9)} assume true; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:34,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {11062#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11062#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:34,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {11062#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:34,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {11063#(<= main_~a~0 10)} assume true; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:34,266 INFO L273 TraceCheckUtils]: 37: Hoare triple {11063#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11063#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:34,267 INFO L273 TraceCheckUtils]: 38: Hoare triple {11063#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:34,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {11064#(<= main_~a~0 11)} assume true; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:34,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {11064#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11064#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:34,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {11064#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:34,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {11065#(<= main_~a~0 12)} assume true; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:34,270 INFO L273 TraceCheckUtils]: 43: Hoare triple {11065#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {11065#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:34,271 INFO L273 TraceCheckUtils]: 44: Hoare triple {11065#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11066#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:34,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {11066#(<= main_~a~0 13)} assume true; {11066#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:34,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {11066#(<= main_~a~0 13)} assume !(~a~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:34,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {11052#false} havoc ~i~0;~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:34,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 62: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 68: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 71: Hoare triple {11052#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 73: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:34,276 INFO L273 TraceCheckUtils]: 74: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 75: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 76: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 77: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 78: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 79: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 80: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 81: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,277 INFO L273 TraceCheckUtils]: 82: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 84: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 85: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 86: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 87: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 88: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 89: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 90: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,278 INFO L273 TraceCheckUtils]: 91: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 92: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 93: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 94: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 95: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 96: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 97: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 98: Hoare triple {11052#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 99: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,279 INFO L273 TraceCheckUtils]: 100: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 101: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 102: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 103: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 104: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 105: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 106: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 107: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 108: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,280 INFO L273 TraceCheckUtils]: 109: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 110: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 111: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 112: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 113: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 114: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 115: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 116: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,281 INFO L273 TraceCheckUtils]: 117: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 118: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 119: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 120: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 121: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 122: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 123: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 124: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 125: Hoare triple {11052#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {11052#false} is VALID [2018-11-14 18:42:34,282 INFO L273 TraceCheckUtils]: 126: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 127: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 128: Hoare triple {11052#false} ~i~0 := 0; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 129: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 130: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 131: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 132: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 133: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 134: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,283 INFO L273 TraceCheckUtils]: 135: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 136: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 137: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 138: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 139: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 140: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 141: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 142: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 143: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,284 INFO L273 TraceCheckUtils]: 144: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 145: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 146: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 147: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 148: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 149: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 150: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 151: Hoare triple {11052#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {11052#false} is VALID [2018-11-14 18:42:34,285 INFO L273 TraceCheckUtils]: 152: Hoare triple {11052#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 153: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 154: Hoare triple {11052#false} assume !(~i~0 < 100000); {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 155: Hoare triple {11052#false} havoc ~x~0;~x~0 := 0; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 156: Hoare triple {11052#false} assume true; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 157: Hoare triple {11052#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L256 TraceCheckUtils]: 158: Hoare triple {11052#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 159: Hoare triple {11052#false} ~cond := #in~cond; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 160: Hoare triple {11052#false} assume ~cond == 0; {11052#false} is VALID [2018-11-14 18:42:34,286 INFO L273 TraceCheckUtils]: 161: Hoare triple {11052#false} assume !false; {11052#false} is VALID [2018-11-14 18:42:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 18:42:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:42:34,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 162 [2018-11-14 18:42:34,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:34,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:42:34,390 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-14 18:42:34,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:42:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:42:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:42:34,391 INFO L87 Difference]: Start difference. First operand 167 states and 172 transitions. Second operand 17 states. [2018-11-14 18:42:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:34,994 INFO L93 Difference]: Finished difference Result 291 states and 301 transitions. [2018-11-14 18:42:34,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:42:34,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 162 [2018-11-14 18:42:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:42:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-14 18:42:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:42:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-14 18:42:34,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2018-11-14 18:42:35,110 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-14 18:42:35,113 INFO L225 Difference]: With dead ends: 291 [2018-11-14 18:42:35,114 INFO L226 Difference]: Without dead ends: 171 [2018-11-14 18:42:35,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:42:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-14 18:42:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-11-14 18:42:35,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:35,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 170 states. [2018-11-14 18:42:35,165 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 170 states. [2018-11-14 18:42:35,165 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 170 states. [2018-11-14 18:42:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:35,168 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-11-14 18:42:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2018-11-14 18:42:35,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:35,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:35,169 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 171 states. [2018-11-14 18:42:35,169 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 171 states. [2018-11-14 18:42:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:35,172 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-11-14 18:42:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2018-11-14 18:42:35,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:35,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:35,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:35,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-14 18:42:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 175 transitions. [2018-11-14 18:42:35,176 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 175 transitions. Word has length 162 [2018-11-14 18:42:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:35,177 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 175 transitions. [2018-11-14 18:42:35,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:42:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 175 transitions. [2018-11-14 18:42:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-14 18:42:35,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:35,179 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:35,179 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:35,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash -303933743, now seen corresponding path program 14 times [2018-11-14 18:42:35,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:35,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:42:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:35,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2018-11-14 18:42:35,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {12511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12511#true} is VALID [2018-11-14 18:42:35,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2018-11-14 18:42:35,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #111#return; {12511#true} is VALID [2018-11-14 18:42:35,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret13 := main(); {12511#true} is VALID [2018-11-14 18:42:35,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {12511#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12513#(= main_~a~0 0)} is VALID [2018-11-14 18:42:35,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {12513#(= main_~a~0 0)} assume true; {12513#(= main_~a~0 0)} is VALID [2018-11-14 18:42:35,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {12513#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12513#(= main_~a~0 0)} is VALID [2018-11-14 18:42:35,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {12513#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {12514#(<= main_~a~0 1)} assume true; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {12514#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {12514#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {12515#(<= main_~a~0 2)} assume true; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {12515#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {12515#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {12516#(<= main_~a~0 3)} assume true; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {12516#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {12516#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {12517#(<= main_~a~0 4)} assume true; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {12517#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {12517#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {12518#(<= main_~a~0 5)} assume true; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {12518#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {12518#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {12519#(<= main_~a~0 6)} assume true; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {12519#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,473 INFO L273 TraceCheckUtils]: 26: Hoare triple {12519#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {12520#(<= main_~a~0 7)} assume true; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {12520#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {12520#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {12521#(<= main_~a~0 8)} assume true; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {12521#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {12521#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {12522#(<= main_~a~0 9)} assume true; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {12522#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {12522#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {12523#(<= main_~a~0 10)} assume true; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {12523#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {12523#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,481 INFO L273 TraceCheckUtils]: 39: Hoare triple {12524#(<= main_~a~0 11)} assume true; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {12524#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,482 INFO L273 TraceCheckUtils]: 41: Hoare triple {12524#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {12525#(<= main_~a~0 12)} assume true; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {12525#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {12525#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {12526#(<= main_~a~0 13)} assume true; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,485 INFO L273 TraceCheckUtils]: 46: Hoare triple {12526#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {12526#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12527#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:35,486 INFO L273 TraceCheckUtils]: 48: Hoare triple {12527#(<= main_~a~0 14)} assume true; {12527#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:35,486 INFO L273 TraceCheckUtils]: 49: Hoare triple {12527#(<= main_~a~0 14)} assume !(~a~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,487 INFO L273 TraceCheckUtils]: 50: Hoare triple {12512#false} havoc ~i~0;~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,487 INFO L273 TraceCheckUtils]: 53: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,487 INFO L273 TraceCheckUtils]: 54: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,488 INFO L273 TraceCheckUtils]: 56: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,488 INFO L273 TraceCheckUtils]: 57: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,488 INFO L273 TraceCheckUtils]: 59: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,491 INFO L273 TraceCheckUtils]: 77: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 79: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 80: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 84: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 85: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,492 INFO L273 TraceCheckUtils]: 86: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 89: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 90: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 91: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 93: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 94: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,493 INFO L273 TraceCheckUtils]: 95: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 96: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 97: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 98: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 99: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 100: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 101: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 102: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 103: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,494 INFO L273 TraceCheckUtils]: 104: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 105: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 106: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 107: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 108: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 110: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 111: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,495 INFO L273 TraceCheckUtils]: 112: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 114: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 115: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 116: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 117: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 118: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 119: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 120: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,496 INFO L273 TraceCheckUtils]: 121: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 122: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 123: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 124: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 126: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 127: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 128: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,497 INFO L273 TraceCheckUtils]: 129: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 130: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 131: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 132: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 133: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 134: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 135: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 136: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 137: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,498 INFO L273 TraceCheckUtils]: 138: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 139: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 140: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 141: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 142: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 143: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 144: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 145: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 146: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,499 INFO L273 TraceCheckUtils]: 147: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 148: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 149: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 150: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 151: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 152: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,500 INFO L273 TraceCheckUtils]: 153: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 154: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 155: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 156: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 157: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 158: Hoare triple {12512#false} havoc ~x~0;~x~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,501 INFO L273 TraceCheckUtils]: 159: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,502 INFO L273 TraceCheckUtils]: 160: Hoare triple {12512#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {12512#false} is VALID [2018-11-14 18:42:35,502 INFO L256 TraceCheckUtils]: 161: Hoare triple {12512#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12512#false} is VALID [2018-11-14 18:42:35,502 INFO L273 TraceCheckUtils]: 162: Hoare triple {12512#false} ~cond := #in~cond; {12512#false} is VALID [2018-11-14 18:42:35,502 INFO L273 TraceCheckUtils]: 163: Hoare triple {12512#false} assume ~cond == 0; {12512#false} is VALID [2018-11-14 18:42:35,502 INFO L273 TraceCheckUtils]: 164: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2018-11-14 18:42:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 18:42:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:35,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:35,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:42:35,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:42:35,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:35,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:35,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2018-11-14 18:42:35,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {12511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12511#true} is VALID [2018-11-14 18:42:35,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2018-11-14 18:42:35,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #111#return; {12511#true} is VALID [2018-11-14 18:42:35,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret13 := main(); {12511#true} is VALID [2018-11-14 18:42:35,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {12511#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12546#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:35,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {12546#(<= main_~a~0 0)} assume true; {12546#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:35,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {12546#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12546#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:35,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {12546#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {12514#(<= main_~a~0 1)} assume true; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {12514#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12514#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:35,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {12514#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {12515#(<= main_~a~0 2)} assume true; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {12515#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12515#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:35,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {12515#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {12516#(<= main_~a~0 3)} assume true; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {12516#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12516#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:35,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {12516#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {12517#(<= main_~a~0 4)} assume true; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {12517#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12517#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:35,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {12517#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {12518#(<= main_~a~0 5)} assume true; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {12518#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12518#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:35,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {12518#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {12519#(<= main_~a~0 6)} assume true; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {12519#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12519#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:35,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {12519#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {12520#(<= main_~a~0 7)} assume true; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {12520#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12520#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:35,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {12520#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {12521#(<= main_~a~0 8)} assume true; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {12521#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12521#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:35,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {12521#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {12522#(<= main_~a~0 9)} assume true; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {12522#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12522#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:35,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {12522#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {12523#(<= main_~a~0 10)} assume true; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {12523#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12523#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:35,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {12523#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,921 INFO L273 TraceCheckUtils]: 39: Hoare triple {12524#(<= main_~a~0 11)} assume true; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {12524#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12524#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:35,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {12524#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {12525#(<= main_~a~0 12)} assume true; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,923 INFO L273 TraceCheckUtils]: 43: Hoare triple {12525#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12525#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:35,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {12525#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {12526#(<= main_~a~0 13)} assume true; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {12526#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12526#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:35,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {12526#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12527#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:35,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {12527#(<= main_~a~0 14)} assume true; {12527#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:35,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {12527#(<= main_~a~0 14)} assume !(~a~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {12512#false} havoc ~i~0;~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,927 INFO L273 TraceCheckUtils]: 53: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,928 INFO L273 TraceCheckUtils]: 57: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 64: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 67: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,930 INFO L273 TraceCheckUtils]: 68: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 69: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 70: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 71: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 72: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12512#false} is VALID [2018-11-14 18:42:35,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {12512#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 77: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 78: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 79: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 80: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 81: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 82: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,932 INFO L273 TraceCheckUtils]: 83: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 84: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 85: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 87: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 88: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 89: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 90: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 91: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,933 INFO L273 TraceCheckUtils]: 92: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 93: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 94: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 95: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 96: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 97: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 98: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 99: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 100: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12512#false} is VALID [2018-11-14 18:42:35,934 INFO L273 TraceCheckUtils]: 101: Hoare triple {12512#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 102: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 103: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 104: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 105: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 106: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 107: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 108: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 109: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,935 INFO L273 TraceCheckUtils]: 110: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 111: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 112: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 113: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 114: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 115: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 116: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 117: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 120: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 121: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 122: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 126: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 127: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12512#false} is VALID [2018-11-14 18:42:35,937 INFO L273 TraceCheckUtils]: 128: Hoare triple {12512#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 129: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 130: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 131: Hoare triple {12512#false} ~i~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 132: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 133: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 134: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 135: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 136: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,938 INFO L273 TraceCheckUtils]: 137: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 138: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 139: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 140: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 141: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 142: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 143: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 144: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,939 INFO L273 TraceCheckUtils]: 145: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 146: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 147: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 148: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 149: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 150: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 151: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 152: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 153: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,940 INFO L273 TraceCheckUtils]: 154: Hoare triple {12512#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 155: Hoare triple {12512#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 156: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 157: Hoare triple {12512#false} assume !(~i~0 < 100000); {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 158: Hoare triple {12512#false} havoc ~x~0;~x~0 := 0; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 159: Hoare triple {12512#false} assume true; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 160: Hoare triple {12512#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L256 TraceCheckUtils]: 161: Hoare triple {12512#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 162: Hoare triple {12512#false} ~cond := #in~cond; {12512#false} is VALID [2018-11-14 18:42:35,941 INFO L273 TraceCheckUtils]: 163: Hoare triple {12512#false} assume ~cond == 0; {12512#false} is VALID [2018-11-14 18:42:35,942 INFO L273 TraceCheckUtils]: 164: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2018-11-14 18:42:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 18:42:35,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:35,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:42:35,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2018-11-14 18:42:35,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:35,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:42:36,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:36,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:42:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:42:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:42:36,067 INFO L87 Difference]: Start difference. First operand 170 states and 175 transitions. Second operand 18 states. [2018-11-14 18:42:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:36,691 INFO L93 Difference]: Finished difference Result 294 states and 304 transitions. [2018-11-14 18:42:36,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:42:36,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2018-11-14 18:42:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:42:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-14 18:42:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:42:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-14 18:42:36,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2018-11-14 18:42:36,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:36,934 INFO L225 Difference]: With dead ends: 294 [2018-11-14 18:42:36,934 INFO L226 Difference]: Without dead ends: 174 [2018-11-14 18:42:36,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:42:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-14 18:42:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-14 18:42:36,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:36,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 173 states. [2018-11-14 18:42:36,993 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 173 states. [2018-11-14 18:42:36,993 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 173 states. [2018-11-14 18:42:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:36,996 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-11-14 18:42:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 179 transitions. [2018-11-14 18:42:36,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:36,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:36,997 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 174 states. [2018-11-14 18:42:36,997 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 174 states. [2018-11-14 18:42:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:37,000 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-11-14 18:42:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 179 transitions. [2018-11-14 18:42:37,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:37,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:37,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:37,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 18:42:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2018-11-14 18:42:37,005 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 165 [2018-11-14 18:42:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:37,005 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2018-11-14 18:42:37,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:42:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2018-11-14 18:42:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-14 18:42:37,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:37,006 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:37,007 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:37,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1432031122, now seen corresponding path program 15 times [2018-11-14 18:42:37,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:37,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:37,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:37,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-14 18:42:37,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-14 18:42:37,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:37,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #111#return; {13995#true} is VALID [2018-11-14 18:42:37,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret13 := main(); {13995#true} is VALID [2018-11-14 18:42:37,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13997#(= main_~a~0 0)} is VALID [2018-11-14 18:42:37,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {13997#(= main_~a~0 0)} assume true; {13997#(= main_~a~0 0)} is VALID [2018-11-14 18:42:37,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {13997#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13997#(= main_~a~0 0)} is VALID [2018-11-14 18:42:37,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {13997#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13998#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {13998#(<= main_~a~0 1)} assume true; {13998#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:37,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {13998#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13998#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:37,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13999#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:37,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {13999#(<= main_~a~0 2)} assume true; {13999#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:37,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {13999#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13999#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:37,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {13999#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14000#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:37,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {14000#(<= main_~a~0 3)} assume true; {14000#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:37,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {14000#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14000#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:37,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {14000#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14001#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:37,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {14001#(<= main_~a~0 4)} assume true; {14001#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:37,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {14001#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14001#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:37,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {14001#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14002#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:37,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {14002#(<= main_~a~0 5)} assume true; {14002#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:37,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {14002#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14002#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:37,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {14002#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14003#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:37,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {14003#(<= main_~a~0 6)} assume true; {14003#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:37,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {14003#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14003#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:37,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {14003#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14004#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:37,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {14004#(<= main_~a~0 7)} assume true; {14004#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:37,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {14004#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14004#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:37,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {14004#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14005#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:37,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {14005#(<= main_~a~0 8)} assume true; {14005#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:37,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {14005#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14005#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:37,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {14005#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14006#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:37,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {14006#(<= main_~a~0 9)} assume true; {14006#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:37,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {14006#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14006#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:37,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {14006#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14007#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:37,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {14007#(<= main_~a~0 10)} assume true; {14007#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:37,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {14007#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14007#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:37,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {14007#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14008#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:37,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {14008#(<= main_~a~0 11)} assume true; {14008#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:37,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {14008#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14008#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:37,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {14008#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14009#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:37,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {14009#(<= main_~a~0 12)} assume true; {14009#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:37,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {14009#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14009#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:37,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {14009#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14010#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:37,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {14010#(<= main_~a~0 13)} assume true; {14010#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:37,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {14010#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14010#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:37,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {14010#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14011#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:37,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {14011#(<= main_~a~0 14)} assume true; {14011#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:37,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {14011#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14011#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:37,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {14011#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14012#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:37,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {14012#(<= main_~a~0 15)} assume true; {14012#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:37,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {14012#(<= main_~a~0 15)} assume !(~a~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:37,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#false} havoc ~i~0;~i~0 := 0; {13996#false} is VALID [2018-11-14 18:42:37,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,483 INFO L273 TraceCheckUtils]: 60: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,483 INFO L273 TraceCheckUtils]: 61: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,483 INFO L273 TraceCheckUtils]: 63: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,483 INFO L273 TraceCheckUtils]: 64: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 69: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 70: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 75: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 76: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 77: Hoare triple {13996#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 78: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 79: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 80: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 81: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,485 INFO L273 TraceCheckUtils]: 82: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 83: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 84: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 85: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 90: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,486 INFO L273 TraceCheckUtils]: 91: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 92: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 93: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 94: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 96: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 97: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 98: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,487 INFO L273 TraceCheckUtils]: 99: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 100: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 101: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 102: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 103: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 104: Hoare triple {13996#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 105: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 106: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 107: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-14 18:42:37,488 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 111: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 115: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,489 INFO L273 TraceCheckUtils]: 116: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 117: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 118: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 119: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 120: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 121: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,490 INFO L273 TraceCheckUtils]: 122: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 123: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 124: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 125: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 126: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 127: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,491 INFO L273 TraceCheckUtils]: 128: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,492 INFO L273 TraceCheckUtils]: 129: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,492 INFO L273 TraceCheckUtils]: 130: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13996#false} is VALID [2018-11-14 18:42:37,492 INFO L273 TraceCheckUtils]: 131: Hoare triple {13996#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13996#false} is VALID [2018-11-14 18:42:37,492 INFO L273 TraceCheckUtils]: 132: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,492 INFO L273 TraceCheckUtils]: 133: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 134: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 135: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 136: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 137: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 138: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,493 INFO L273 TraceCheckUtils]: 139: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 140: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 141: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 142: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 143: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 144: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,494 INFO L273 TraceCheckUtils]: 145: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 146: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 147: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 148: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 149: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 150: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,495 INFO L273 TraceCheckUtils]: 151: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 152: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 153: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 154: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 155: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 156: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,496 INFO L273 TraceCheckUtils]: 157: Hoare triple {13996#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 158: Hoare triple {13996#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 159: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 160: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 161: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 162: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:37,497 INFO L273 TraceCheckUtils]: 163: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {13996#false} is VALID [2018-11-14 18:42:37,498 INFO L256 TraceCheckUtils]: 164: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13996#false} is VALID [2018-11-14 18:42:37,498 INFO L273 TraceCheckUtils]: 165: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-14 18:42:37,498 INFO L273 TraceCheckUtils]: 166: Hoare triple {13996#false} assume ~cond == 0; {13996#false} is VALID [2018-11-14 18:42:37,498 INFO L273 TraceCheckUtils]: 167: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-14 18:42:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 18:42:37,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:37,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:42:44,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 18:42:44,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:45,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:45,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-14 18:42:45,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-14 18:42:45,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,423 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #111#return; {13995#true} is VALID [2018-11-14 18:42:45,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret13 := main(); {13995#true} is VALID [2018-11-14 18:42:45,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13995#true} is VALID [2018-11-14 18:42:45,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 33: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 34: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 41: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 42: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 43: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 44: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 45: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 46: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 47: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 49: Hoare triple {13995#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 50: Hoare triple {13995#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 51: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 52: Hoare triple {13995#true} assume !(~a~0 < 100000); {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 53: Hoare triple {13995#true} havoc ~i~0;~i~0 := 0; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 54: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 55: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,429 INFO L273 TraceCheckUtils]: 56: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 57: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 58: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 59: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 60: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 61: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 62: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 63: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 66: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 67: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 68: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 69: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13995#true} is VALID [2018-11-14 18:42:45,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {13995#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13995#true} is VALID [2018-11-14 18:42:45,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14244#(< main_~i~0 100000)} is VALID [2018-11-14 18:42:45,432 INFO L273 TraceCheckUtils]: 77: Hoare triple {14244#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 78: Hoare triple {14248#(<= main_~i~0 100000)} assume true; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 79: Hoare triple {14248#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {13995#true} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 80: Hoare triple {13995#true} ~i~0 := 0; {13995#true} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 81: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 82: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,433 INFO L273 TraceCheckUtils]: 83: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 84: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 85: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 86: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 87: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 88: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 89: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 90: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,434 INFO L273 TraceCheckUtils]: 91: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 92: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 93: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 94: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 95: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 96: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,435 INFO L273 TraceCheckUtils]: 97: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 98: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 99: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 100: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 101: Hoare triple {13995#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 102: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,436 INFO L273 TraceCheckUtils]: 103: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14244#(< main_~i~0 100000)} is VALID [2018-11-14 18:42:45,437 INFO L273 TraceCheckUtils]: 104: Hoare triple {14244#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,437 INFO L273 TraceCheckUtils]: 105: Hoare triple {14248#(<= main_~i~0 100000)} assume true; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,437 INFO L273 TraceCheckUtils]: 106: Hoare triple {14248#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {13995#true} is VALID [2018-11-14 18:42:45,437 INFO L273 TraceCheckUtils]: 107: Hoare triple {13995#true} ~i~0 := 0; {13995#true} is VALID [2018-11-14 18:42:45,437 INFO L273 TraceCheckUtils]: 108: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 109: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 110: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 111: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 112: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 113: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 114: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 115: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,438 INFO L273 TraceCheckUtils]: 116: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 117: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 118: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 119: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 120: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 121: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 122: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 123: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 124: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,439 INFO L273 TraceCheckUtils]: 125: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,440 INFO L273 TraceCheckUtils]: 126: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,440 INFO L273 TraceCheckUtils]: 127: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13995#true} is VALID [2018-11-14 18:42:45,440 INFO L273 TraceCheckUtils]: 128: Hoare triple {13995#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13995#true} is VALID [2018-11-14 18:42:45,440 INFO L273 TraceCheckUtils]: 129: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:42:45,440 INFO L273 TraceCheckUtils]: 130: Hoare triple {13995#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14244#(< main_~i~0 100000)} is VALID [2018-11-14 18:42:45,441 INFO L273 TraceCheckUtils]: 131: Hoare triple {14244#(< main_~i~0 100000)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,441 INFO L273 TraceCheckUtils]: 132: Hoare triple {14248#(<= main_~i~0 100000)} assume true; {14248#(<= main_~i~0 100000)} is VALID [2018-11-14 18:42:45,441 INFO L273 TraceCheckUtils]: 133: Hoare triple {14248#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {13995#true} is VALID [2018-11-14 18:42:45,441 INFO L273 TraceCheckUtils]: 134: Hoare triple {13995#true} ~i~0 := 0; {14420#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:45,442 INFO L273 TraceCheckUtils]: 135: Hoare triple {14420#(<= main_~i~0 0)} assume true; {14420#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:45,442 INFO L273 TraceCheckUtils]: 136: Hoare triple {14420#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14420#(<= main_~i~0 0)} is VALID [2018-11-14 18:42:45,442 INFO L273 TraceCheckUtils]: 137: Hoare triple {14420#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14430#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:45,443 INFO L273 TraceCheckUtils]: 138: Hoare triple {14430#(<= main_~i~0 1)} assume true; {14430#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:45,443 INFO L273 TraceCheckUtils]: 139: Hoare triple {14430#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14430#(<= main_~i~0 1)} is VALID [2018-11-14 18:42:45,444 INFO L273 TraceCheckUtils]: 140: Hoare triple {14430#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14440#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:45,444 INFO L273 TraceCheckUtils]: 141: Hoare triple {14440#(<= main_~i~0 2)} assume true; {14440#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:45,445 INFO L273 TraceCheckUtils]: 142: Hoare triple {14440#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14440#(<= main_~i~0 2)} is VALID [2018-11-14 18:42:45,445 INFO L273 TraceCheckUtils]: 143: Hoare triple {14440#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14450#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:45,446 INFO L273 TraceCheckUtils]: 144: Hoare triple {14450#(<= main_~i~0 3)} assume true; {14450#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:45,446 INFO L273 TraceCheckUtils]: 145: Hoare triple {14450#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14450#(<= main_~i~0 3)} is VALID [2018-11-14 18:42:45,447 INFO L273 TraceCheckUtils]: 146: Hoare triple {14450#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14460#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:45,448 INFO L273 TraceCheckUtils]: 147: Hoare triple {14460#(<= main_~i~0 4)} assume true; {14460#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:45,448 INFO L273 TraceCheckUtils]: 148: Hoare triple {14460#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14460#(<= main_~i~0 4)} is VALID [2018-11-14 18:42:45,449 INFO L273 TraceCheckUtils]: 149: Hoare triple {14460#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14470#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:45,449 INFO L273 TraceCheckUtils]: 150: Hoare triple {14470#(<= main_~i~0 5)} assume true; {14470#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:45,450 INFO L273 TraceCheckUtils]: 151: Hoare triple {14470#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14470#(<= main_~i~0 5)} is VALID [2018-11-14 18:42:45,451 INFO L273 TraceCheckUtils]: 152: Hoare triple {14470#(<= main_~i~0 5)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14480#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:45,451 INFO L273 TraceCheckUtils]: 153: Hoare triple {14480#(<= main_~i~0 6)} assume true; {14480#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:45,452 INFO L273 TraceCheckUtils]: 154: Hoare triple {14480#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14480#(<= main_~i~0 6)} is VALID [2018-11-14 18:42:45,452 INFO L273 TraceCheckUtils]: 155: Hoare triple {14480#(<= main_~i~0 6)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14490#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:45,453 INFO L273 TraceCheckUtils]: 156: Hoare triple {14490#(<= main_~i~0 7)} assume true; {14490#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:45,453 INFO L273 TraceCheckUtils]: 157: Hoare triple {14490#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14490#(<= main_~i~0 7)} is VALID [2018-11-14 18:42:45,454 INFO L273 TraceCheckUtils]: 158: Hoare triple {14490#(<= main_~i~0 7)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14500#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:45,455 INFO L273 TraceCheckUtils]: 159: Hoare triple {14500#(<= main_~i~0 8)} assume true; {14500#(<= main_~i~0 8)} is VALID [2018-11-14 18:42:45,455 INFO L273 TraceCheckUtils]: 160: Hoare triple {14500#(<= main_~i~0 8)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:42:45,455 INFO L273 TraceCheckUtils]: 161: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-14 18:42:45,456 INFO L273 TraceCheckUtils]: 162: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:42:45,456 INFO L273 TraceCheckUtils]: 163: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {13996#false} is VALID [2018-11-14 18:42:45,456 INFO L256 TraceCheckUtils]: 164: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13996#false} is VALID [2018-11-14 18:42:45,456 INFO L273 TraceCheckUtils]: 165: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-14 18:42:45,456 INFO L273 TraceCheckUtils]: 166: Hoare triple {13996#false} assume ~cond == 0; {13996#false} is VALID [2018-11-14 18:42:45,457 INFO L273 TraceCheckUtils]: 167: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-14 18:42:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 69 proven. 100 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-14 18:42:45,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:45,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-14 18:42:45,493 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 168 [2018-11-14 18:42:45,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:45,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:42:45,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:45,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:42:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:42:45,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:42:45,611 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand 29 states. [2018-11-14 18:42:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:47,130 INFO L93 Difference]: Finished difference Result 321 states and 339 transitions. [2018-11-14 18:42:47,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:42:47,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 168 [2018-11-14 18:42:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:42:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 247 transitions. [2018-11-14 18:42:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:42:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 247 transitions. [2018-11-14 18:42:47,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 247 transitions. [2018-11-14 18:42:47,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:47,404 INFO L225 Difference]: With dead ends: 321 [2018-11-14 18:42:47,404 INFO L226 Difference]: Without dead ends: 201 [2018-11-14 18:42:47,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:42:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-14 18:42:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-11-14 18:42:47,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:47,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 200 states. [2018-11-14 18:42:47,495 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 200 states. [2018-11-14 18:42:47,495 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 200 states. [2018-11-14 18:42:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:47,499 INFO L93 Difference]: Finished difference Result 201 states and 206 transitions. [2018-11-14 18:42:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 206 transitions. [2018-11-14 18:42:47,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:47,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:47,500 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 201 states. [2018-11-14 18:42:47,500 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 201 states. [2018-11-14 18:42:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:47,503 INFO L93 Difference]: Finished difference Result 201 states and 206 transitions. [2018-11-14 18:42:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 206 transitions. [2018-11-14 18:42:47,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:47,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:47,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:47,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-14 18:42:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 205 transitions. [2018-11-14 18:42:47,508 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 205 transitions. Word has length 168 [2018-11-14 18:42:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:47,509 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 205 transitions. [2018-11-14 18:42:47,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:42:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 205 transitions. [2018-11-14 18:42:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-14 18:42:47,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:47,510 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:47,511 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:47,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:47,511 INFO L82 PathProgramCache]: Analyzing trace with hash 156765937, now seen corresponding path program 16 times [2018-11-14 18:42:47,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:47,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:47,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:47,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:47,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:48,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {15625#true} call ULTIMATE.init(); {15625#true} is VALID [2018-11-14 18:42:48,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {15625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15625#true} is VALID [2018-11-14 18:42:48,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {15625#true} assume true; {15625#true} is VALID [2018-11-14 18:42:48,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15625#true} {15625#true} #111#return; {15625#true} is VALID [2018-11-14 18:42:48,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {15625#true} call #t~ret13 := main(); {15625#true} is VALID [2018-11-14 18:42:48,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {15625#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15627#(= main_~a~0 0)} is VALID [2018-11-14 18:42:48,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {15627#(= main_~a~0 0)} assume true; {15627#(= main_~a~0 0)} is VALID [2018-11-14 18:42:48,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {15627#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15627#(= main_~a~0 0)} is VALID [2018-11-14 18:42:48,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {15627#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:48,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {15628#(<= main_~a~0 1)} assume true; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:48,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {15628#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:48,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {15628#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:48,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {15629#(<= main_~a~0 2)} assume true; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:48,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {15629#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:48,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {15629#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:48,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {15630#(<= main_~a~0 3)} assume true; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:48,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {15630#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:48,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {15630#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:48,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {15631#(<= main_~a~0 4)} assume true; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:48,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {15631#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:48,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {15631#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:48,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {15632#(<= main_~a~0 5)} assume true; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:48,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {15632#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:48,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {15632#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:48,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {15633#(<= main_~a~0 6)} assume true; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:48,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {15633#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:48,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {15633#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:48,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {15634#(<= main_~a~0 7)} assume true; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:48,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {15634#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:48,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {15634#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:48,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {15635#(<= main_~a~0 8)} assume true; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:48,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {15635#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:48,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {15635#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:48,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {15636#(<= main_~a~0 9)} assume true; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:48,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {15636#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:48,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {15636#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:48,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {15637#(<= main_~a~0 10)} assume true; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:48,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {15637#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:48,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {15637#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:48,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {15638#(<= main_~a~0 11)} assume true; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:48,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {15638#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:48,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {15638#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:48,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {15639#(<= main_~a~0 12)} assume true; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:48,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {15639#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:48,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {15639#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:48,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {15640#(<= main_~a~0 13)} assume true; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:48,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {15640#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:48,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {15640#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:48,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {15641#(<= main_~a~0 14)} assume true; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:48,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {15641#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:48,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {15641#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:48,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {15642#(<= main_~a~0 15)} assume true; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:48,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {15642#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:48,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {15642#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15643#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:48,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {15643#(<= main_~a~0 16)} assume true; {15643#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:48,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {15643#(<= main_~a~0 16)} assume !(~a~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:48,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {15626#false} havoc ~i~0;~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:48,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,513 INFO L273 TraceCheckUtils]: 59: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,514 INFO L273 TraceCheckUtils]: 63: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,514 INFO L273 TraceCheckUtils]: 64: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,514 INFO L273 TraceCheckUtils]: 65: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 69: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 70: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,515 INFO L273 TraceCheckUtils]: 71: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 76: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 77: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 78: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 79: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,516 INFO L273 TraceCheckUtils]: 80: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 82: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 83: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 84: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 85: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:48,517 INFO L273 TraceCheckUtils]: 86: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 87: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 88: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 89: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 90: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 91: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,518 INFO L273 TraceCheckUtils]: 92: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 93: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 94: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 95: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 96: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 97: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,519 INFO L273 TraceCheckUtils]: 98: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 99: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 100: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 101: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 102: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 103: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,520 INFO L273 TraceCheckUtils]: 104: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 105: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 106: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 107: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 108: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 109: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,521 INFO L273 TraceCheckUtils]: 110: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 111: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 112: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 113: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 114: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 115: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,522 INFO L273 TraceCheckUtils]: 116: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 117: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 118: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 119: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 120: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 121: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:48,523 INFO L273 TraceCheckUtils]: 122: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:48,524 INFO L273 TraceCheckUtils]: 123: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,524 INFO L273 TraceCheckUtils]: 124: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,524 INFO L273 TraceCheckUtils]: 125: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,524 INFO L273 TraceCheckUtils]: 126: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,524 INFO L273 TraceCheckUtils]: 127: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 128: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 129: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 130: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 131: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 132: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,525 INFO L273 TraceCheckUtils]: 133: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 134: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 135: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 136: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 137: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 138: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,526 INFO L273 TraceCheckUtils]: 139: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 140: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 141: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 142: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 143: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 144: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,527 INFO L273 TraceCheckUtils]: 145: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 146: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 147: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 148: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 149: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 150: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,528 INFO L273 TraceCheckUtils]: 151: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 152: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 153: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 154: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 155: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 156: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,529 INFO L273 TraceCheckUtils]: 157: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,530 INFO L273 TraceCheckUtils]: 158: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,530 INFO L273 TraceCheckUtils]: 159: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,530 INFO L273 TraceCheckUtils]: 160: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,530 INFO L273 TraceCheckUtils]: 161: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,530 INFO L273 TraceCheckUtils]: 162: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 163: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 164: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 165: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 166: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 167: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,531 INFO L273 TraceCheckUtils]: 168: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,532 INFO L273 TraceCheckUtils]: 169: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,532 INFO L273 TraceCheckUtils]: 170: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,532 INFO L273 TraceCheckUtils]: 171: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,532 INFO L273 TraceCheckUtils]: 172: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,532 INFO L273 TraceCheckUtils]: 173: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,533 INFO L273 TraceCheckUtils]: 174: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,533 INFO L273 TraceCheckUtils]: 175: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,533 INFO L273 TraceCheckUtils]: 176: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,533 INFO L273 TraceCheckUtils]: 177: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,533 INFO L273 TraceCheckUtils]: 178: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 179: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 180: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 181: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 182: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 183: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,534 INFO L273 TraceCheckUtils]: 184: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 185: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 186: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 187: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 188: Hoare triple {15626#false} havoc ~x~0;~x~0 := 0; {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 189: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:48,535 INFO L273 TraceCheckUtils]: 190: Hoare triple {15626#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {15626#false} is VALID [2018-11-14 18:42:48,536 INFO L256 TraceCheckUtils]: 191: Hoare triple {15626#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {15626#false} is VALID [2018-11-14 18:42:48,536 INFO L273 TraceCheckUtils]: 192: Hoare triple {15626#false} ~cond := #in~cond; {15626#false} is VALID [2018-11-14 18:42:48,536 INFO L273 TraceCheckUtils]: 193: Hoare triple {15626#false} assume ~cond == 0; {15626#false} is VALID [2018-11-14 18:42:48,536 INFO L273 TraceCheckUtils]: 194: Hoare triple {15626#false} assume !false; {15626#false} is VALID [2018-11-14 18:42:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-14 18:42:48,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:48,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:48,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:42:48,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:42:48,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:42:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:48,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:42:49,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {15625#true} call ULTIMATE.init(); {15625#true} is VALID [2018-11-14 18:42:49,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {15625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15625#true} is VALID [2018-11-14 18:42:49,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {15625#true} assume true; {15625#true} is VALID [2018-11-14 18:42:49,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15625#true} {15625#true} #111#return; {15625#true} is VALID [2018-11-14 18:42:49,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {15625#true} call #t~ret13 := main(); {15625#true} is VALID [2018-11-14 18:42:49,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {15625#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15662#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:49,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {15662#(<= main_~a~0 0)} assume true; {15662#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:49,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {15662#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15662#(<= main_~a~0 0)} is VALID [2018-11-14 18:42:49,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {15662#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:49,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {15628#(<= main_~a~0 1)} assume true; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:49,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {15628#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15628#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:49,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {15628#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:49,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {15629#(<= main_~a~0 2)} assume true; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:49,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {15629#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15629#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:49,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {15629#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:49,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {15630#(<= main_~a~0 3)} assume true; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:49,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {15630#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15630#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:49,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {15630#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:49,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {15631#(<= main_~a~0 4)} assume true; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:49,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {15631#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15631#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:49,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {15631#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:49,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {15632#(<= main_~a~0 5)} assume true; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:49,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {15632#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15632#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:49,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {15632#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:49,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {15633#(<= main_~a~0 6)} assume true; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:49,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {15633#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15633#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:49,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {15633#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:49,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {15634#(<= main_~a~0 7)} assume true; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:49,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {15634#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15634#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:49,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {15634#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:49,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {15635#(<= main_~a~0 8)} assume true; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:49,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {15635#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15635#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:49,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {15635#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:49,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {15636#(<= main_~a~0 9)} assume true; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:49,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {15636#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15636#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:49,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {15636#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:49,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {15637#(<= main_~a~0 10)} assume true; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:49,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {15637#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15637#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:49,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {15637#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:49,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {15638#(<= main_~a~0 11)} assume true; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:49,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {15638#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15638#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:49,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {15638#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:49,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {15639#(<= main_~a~0 12)} assume true; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:49,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {15639#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15639#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:49,128 INFO L273 TraceCheckUtils]: 44: Hoare triple {15639#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:49,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {15640#(<= main_~a~0 13)} assume true; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:49,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {15640#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15640#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:49,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {15640#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:49,130 INFO L273 TraceCheckUtils]: 48: Hoare triple {15641#(<= main_~a~0 14)} assume true; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:49,131 INFO L273 TraceCheckUtils]: 49: Hoare triple {15641#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15641#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:49,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {15641#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:49,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {15642#(<= main_~a~0 15)} assume true; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:49,133 INFO L273 TraceCheckUtils]: 52: Hoare triple {15642#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {15642#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:49,133 INFO L273 TraceCheckUtils]: 53: Hoare triple {15642#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {15643#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:49,134 INFO L273 TraceCheckUtils]: 54: Hoare triple {15643#(<= main_~a~0 16)} assume true; {15643#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:49,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {15643#(<= main_~a~0 16)} assume !(~a~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:49,135 INFO L273 TraceCheckUtils]: 56: Hoare triple {15626#false} havoc ~i~0;~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:49,135 INFO L273 TraceCheckUtils]: 57: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,135 INFO L273 TraceCheckUtils]: 58: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,135 INFO L273 TraceCheckUtils]: 59: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 64: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,136 INFO L273 TraceCheckUtils]: 65: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 66: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 67: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 69: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 70: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,137 INFO L273 TraceCheckUtils]: 71: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 72: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 74: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 75: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 77: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 78: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 79: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,138 INFO L273 TraceCheckUtils]: 80: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 81: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 82: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 83: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 84: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 85: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 86: Hoare triple {15626#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:49,139 INFO L273 TraceCheckUtils]: 89: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 90: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 91: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 94: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,140 INFO L273 TraceCheckUtils]: 97: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 99: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 100: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 101: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 102: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,141 INFO L273 TraceCheckUtils]: 104: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 105: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 106: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 107: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 108: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 109: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 110: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 111: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,142 INFO L273 TraceCheckUtils]: 112: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 113: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 114: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 115: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 116: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 117: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,143 INFO L273 TraceCheckUtils]: 118: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 119: Hoare triple {15626#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 120: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 121: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 122: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 123: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 124: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 125: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,144 INFO L273 TraceCheckUtils]: 126: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 127: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 128: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 129: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 130: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 131: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 132: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,145 INFO L273 TraceCheckUtils]: 133: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 134: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 135: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 136: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 137: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 138: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 139: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,146 INFO L273 TraceCheckUtils]: 140: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 141: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 142: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 143: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 144: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 145: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 146: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,147 INFO L273 TraceCheckUtils]: 147: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 148: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 149: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 150: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 151: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 152: Hoare triple {15626#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 153: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,148 INFO L273 TraceCheckUtils]: 154: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 155: Hoare triple {15626#false} ~i~0 := 0; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 156: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 157: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 158: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 159: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 160: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,149 INFO L273 TraceCheckUtils]: 161: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 162: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 163: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 164: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 165: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 166: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 167: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,150 INFO L273 TraceCheckUtils]: 168: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 169: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 170: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 171: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 172: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 173: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 174: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,151 INFO L273 TraceCheckUtils]: 175: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 176: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 177: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 178: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 179: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 180: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 181: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,152 INFO L273 TraceCheckUtils]: 182: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 183: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 184: Hoare triple {15626#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 185: Hoare triple {15626#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 186: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 187: Hoare triple {15626#false} assume !(~i~0 < 100000); {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 188: Hoare triple {15626#false} havoc ~x~0;~x~0 := 0; {15626#false} is VALID [2018-11-14 18:42:49,153 INFO L273 TraceCheckUtils]: 189: Hoare triple {15626#false} assume true; {15626#false} is VALID [2018-11-14 18:42:49,154 INFO L273 TraceCheckUtils]: 190: Hoare triple {15626#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {15626#false} is VALID [2018-11-14 18:42:49,154 INFO L256 TraceCheckUtils]: 191: Hoare triple {15626#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {15626#false} is VALID [2018-11-14 18:42:49,154 INFO L273 TraceCheckUtils]: 192: Hoare triple {15626#false} ~cond := #in~cond; {15626#false} is VALID [2018-11-14 18:42:49,154 INFO L273 TraceCheckUtils]: 193: Hoare triple {15626#false} assume ~cond == 0; {15626#false} is VALID [2018-11-14 18:42:49,154 INFO L273 TraceCheckUtils]: 194: Hoare triple {15626#false} assume !false; {15626#false} is VALID [2018-11-14 18:42:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-14 18:42:49,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:42:49,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:42:49,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 195 [2018-11-14 18:42:49,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:42:49,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:42:49,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:42:49,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:42:49,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:42:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:42:49,539 INFO L87 Difference]: Start difference. First operand 200 states and 205 transitions. Second operand 20 states. [2018-11-14 18:42:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:50,378 INFO L93 Difference]: Finished difference Result 348 states and 358 transitions. [2018-11-14 18:42:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:42:50,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 195 [2018-11-14 18:42:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:42:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:42:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2018-11-14 18:42:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:42:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2018-11-14 18:42:50,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 126 transitions. [2018-11-14 18:42:50,858 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-14 18:42:50,862 INFO L225 Difference]: With dead ends: 348 [2018-11-14 18:42:50,862 INFO L226 Difference]: Without dead ends: 204 [2018-11-14 18:42:50,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:42:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-14 18:42:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-11-14 18:42:50,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:42:50,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 203 states. [2018-11-14 18:42:50,940 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 203 states. [2018-11-14 18:42:50,940 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 203 states. [2018-11-14 18:42:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:50,944 INFO L93 Difference]: Finished difference Result 204 states and 209 transitions. [2018-11-14 18:42:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 209 transitions. [2018-11-14 18:42:50,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:50,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:50,945 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 204 states. [2018-11-14 18:42:50,945 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 204 states. [2018-11-14 18:42:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:42:50,949 INFO L93 Difference]: Finished difference Result 204 states and 209 transitions. [2018-11-14 18:42:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 209 transitions. [2018-11-14 18:42:50,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:42:50,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:42:50,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:42:50,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:42:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-14 18:42:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 208 transitions. [2018-11-14 18:42:50,954 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 208 transitions. Word has length 195 [2018-11-14 18:42:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:42:50,954 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 208 transitions. [2018-11-14 18:42:50,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:42:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 208 transitions. [2018-11-14 18:42:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-14 18:42:50,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:42:50,956 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:42:50,956 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:42:50,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:42:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 574472178, now seen corresponding path program 17 times [2018-11-14 18:42:50,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:42:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:42:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:50,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:42:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:42:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:42:51,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {17373#true} call ULTIMATE.init(); {17373#true} is VALID [2018-11-14 18:42:51,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {17373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17373#true} is VALID [2018-11-14 18:42:51,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {17373#true} assume true; {17373#true} is VALID [2018-11-14 18:42:51,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17373#true} {17373#true} #111#return; {17373#true} is VALID [2018-11-14 18:42:51,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {17373#true} call #t~ret13 := main(); {17373#true} is VALID [2018-11-14 18:42:51,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {17373#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);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17375#(= main_~a~0 0)} is VALID [2018-11-14 18:42:51,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {17375#(= main_~a~0 0)} assume true; {17375#(= main_~a~0 0)} is VALID [2018-11-14 18:42:51,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {17375#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17375#(= main_~a~0 0)} is VALID [2018-11-14 18:42:51,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {17375#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17376#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:51,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {17376#(<= main_~a~0 1)} assume true; {17376#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:51,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {17376#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17376#(<= main_~a~0 1)} is VALID [2018-11-14 18:42:51,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {17376#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17377#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:51,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {17377#(<= main_~a~0 2)} assume true; {17377#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:51,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {17377#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17377#(<= main_~a~0 2)} is VALID [2018-11-14 18:42:51,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {17377#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17378#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:51,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {17378#(<= main_~a~0 3)} assume true; {17378#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:51,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {17378#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17378#(<= main_~a~0 3)} is VALID [2018-11-14 18:42:51,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {17378#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17379#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:51,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {17379#(<= main_~a~0 4)} assume true; {17379#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:51,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {17379#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17379#(<= main_~a~0 4)} is VALID [2018-11-14 18:42:51,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {17379#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17380#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:51,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {17380#(<= main_~a~0 5)} assume true; {17380#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:51,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {17380#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17380#(<= main_~a~0 5)} is VALID [2018-11-14 18:42:51,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {17380#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17381#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:51,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {17381#(<= main_~a~0 6)} assume true; {17381#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:51,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {17381#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17381#(<= main_~a~0 6)} is VALID [2018-11-14 18:42:51,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {17381#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17382#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:51,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {17382#(<= main_~a~0 7)} assume true; {17382#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:51,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {17382#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17382#(<= main_~a~0 7)} is VALID [2018-11-14 18:42:51,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {17382#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17383#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:51,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {17383#(<= main_~a~0 8)} assume true; {17383#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:51,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {17383#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17383#(<= main_~a~0 8)} is VALID [2018-11-14 18:42:51,485 INFO L273 TraceCheckUtils]: 32: Hoare triple {17383#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17384#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:51,485 INFO L273 TraceCheckUtils]: 33: Hoare triple {17384#(<= main_~a~0 9)} assume true; {17384#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:51,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {17384#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17384#(<= main_~a~0 9)} is VALID [2018-11-14 18:42:51,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {17384#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17385#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:51,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {17385#(<= main_~a~0 10)} assume true; {17385#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:51,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {17385#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17385#(<= main_~a~0 10)} is VALID [2018-11-14 18:42:51,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {17385#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17386#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:51,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {17386#(<= main_~a~0 11)} assume true; {17386#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:51,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {17386#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17386#(<= main_~a~0 11)} is VALID [2018-11-14 18:42:51,490 INFO L273 TraceCheckUtils]: 41: Hoare triple {17386#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17387#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:51,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {17387#(<= main_~a~0 12)} assume true; {17387#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:51,491 INFO L273 TraceCheckUtils]: 43: Hoare triple {17387#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17387#(<= main_~a~0 12)} is VALID [2018-11-14 18:42:51,492 INFO L273 TraceCheckUtils]: 44: Hoare triple {17387#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17388#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:51,492 INFO L273 TraceCheckUtils]: 45: Hoare triple {17388#(<= main_~a~0 13)} assume true; {17388#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:51,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {17388#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17388#(<= main_~a~0 13)} is VALID [2018-11-14 18:42:51,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {17388#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17389#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:51,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {17389#(<= main_~a~0 14)} assume true; {17389#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:51,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {17389#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17389#(<= main_~a~0 14)} is VALID [2018-11-14 18:42:51,495 INFO L273 TraceCheckUtils]: 50: Hoare triple {17389#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17390#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:51,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {17390#(<= main_~a~0 15)} assume true; {17390#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:51,496 INFO L273 TraceCheckUtils]: 52: Hoare triple {17390#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17390#(<= main_~a~0 15)} is VALID [2018-11-14 18:42:51,497 INFO L273 TraceCheckUtils]: 53: Hoare triple {17390#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17391#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:51,497 INFO L273 TraceCheckUtils]: 54: Hoare triple {17391#(<= main_~a~0 16)} assume true; {17391#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:51,498 INFO L273 TraceCheckUtils]: 55: Hoare triple {17391#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17391#(<= main_~a~0 16)} is VALID [2018-11-14 18:42:51,499 INFO L273 TraceCheckUtils]: 56: Hoare triple {17391#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17392#(<= main_~a~0 17)} is VALID [2018-11-14 18:42:51,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {17392#(<= main_~a~0 17)} assume true; {17392#(<= main_~a~0 17)} is VALID [2018-11-14 18:42:51,500 INFO L273 TraceCheckUtils]: 58: Hoare triple {17392#(<= main_~a~0 17)} assume !(~a~0 < 100000); {17374#false} is VALID [2018-11-14 18:42:51,500 INFO L273 TraceCheckUtils]: 59: Hoare triple {17374#false} havoc ~i~0;~i~0 := 0; {17374#false} is VALID [2018-11-14 18:42:51,500 INFO L273 TraceCheckUtils]: 60: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,500 INFO L273 TraceCheckUtils]: 61: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,501 INFO L273 TraceCheckUtils]: 64: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,501 INFO L273 TraceCheckUtils]: 65: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,501 INFO L273 TraceCheckUtils]: 66: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,502 INFO L273 TraceCheckUtils]: 67: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,502 INFO L273 TraceCheckUtils]: 68: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,502 INFO L273 TraceCheckUtils]: 69: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,502 INFO L273 TraceCheckUtils]: 70: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,502 INFO L273 TraceCheckUtils]: 71: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 72: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 73: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 74: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 75: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 76: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 77: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 78: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,503 INFO L273 TraceCheckUtils]: 79: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 80: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 81: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 82: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 83: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 84: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 85: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 86: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 87: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 89: Hoare triple {17374#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {17374#false} assume !(~i~0 < 100000); {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 92: Hoare triple {17374#false} ~i~0 := 0; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 93: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 94: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 95: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 96: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 97: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,505 INFO L273 TraceCheckUtils]: 98: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 99: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 101: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 102: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 103: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 104: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 105: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 106: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,506 INFO L273 TraceCheckUtils]: 107: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 108: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 109: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 110: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 111: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 112: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 113: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 114: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 115: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,507 INFO L273 TraceCheckUtils]: 116: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 117: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 118: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 119: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 120: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 121: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 122: Hoare triple {17374#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 123: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 124: Hoare triple {17374#false} assume !(~i~0 < 100000); {17374#false} is VALID [2018-11-14 18:42:51,508 INFO L273 TraceCheckUtils]: 125: Hoare triple {17374#false} ~i~0 := 0; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 126: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 127: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 128: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 129: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 130: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 131: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 132: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 133: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,509 INFO L273 TraceCheckUtils]: 134: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 135: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 136: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 137: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 138: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 139: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 140: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 141: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 142: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 143: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,510 INFO L273 TraceCheckUtils]: 144: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 145: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 146: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 147: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 148: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 149: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 150: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 151: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 152: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,511 INFO L273 TraceCheckUtils]: 153: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 154: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 155: Hoare triple {17374#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 156: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 157: Hoare triple {17374#false} assume !(~i~0 < 100000); {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 158: Hoare triple {17374#false} ~i~0 := 0; {17374#false} is VALID [2018-11-14 18:42:51,512 INFO L273 TraceCheckUtils]: 159: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 160: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 161: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 162: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 163: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 164: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 165: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,513 INFO L273 TraceCheckUtils]: 166: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 167: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 168: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 169: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 170: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 171: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,514 INFO L273 TraceCheckUtils]: 172: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 173: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 174: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 175: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 176: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 177: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 178: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 179: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,515 INFO L273 TraceCheckUtils]: 180: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 181: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 182: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 183: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 184: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 185: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 186: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,516 INFO L273 TraceCheckUtils]: 187: Hoare triple {17374#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 188: Hoare triple {17374#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 189: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 190: Hoare triple {17374#false} assume !(~i~0 < 100000); {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 191: Hoare triple {17374#false} havoc ~x~0;~x~0 := 0; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 192: Hoare triple {17374#false} assume true; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 193: Hoare triple {17374#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L256 TraceCheckUtils]: 194: Hoare triple {17374#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 195: Hoare triple {17374#false} ~cond := #in~cond; {17374#false} is VALID [2018-11-14 18:42:51,517 INFO L273 TraceCheckUtils]: 196: Hoare triple {17374#false} assume ~cond == 0; {17374#false} is VALID [2018-11-14 18:42:51,518 INFO L273 TraceCheckUtils]: 197: Hoare triple {17374#false} assume !false; {17374#false} is VALID [2018-11-14 18:42:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-14 18:42:51,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:42:51,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:42:51,543 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1