java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:50:35,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:50:35,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:50:35,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:50:35,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:50:35,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:50:35,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:50:35,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:50:35,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:50:35,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:50:35,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:50:35,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:50:35,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:50:35,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:50:35,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:50:35,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:50:35,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:50:35,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:50:35,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:50:35,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:50:35,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:50:35,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:50:35,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:50:35,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:50:35,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:50:35,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:50:35,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:50:35,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:50:35,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:50:35,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:50:35,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:50:35,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:50:35,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:50:35,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:50:35,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:50:35,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:50:35,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:50:35,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:50:35,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:50:35,610 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:50:35,611 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:50:35,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:50:35,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:50:35,612 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:50:35,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:50:35,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:50:35,612 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:50:35,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:50:35,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:50:35,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:50:35,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:50:35,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:50:35,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:50:35,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:50:35,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:50:35,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:50:35,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:50:35,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:50:35,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:50:35,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:50:35,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:50:35,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:50:35,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:50:35,616 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:50:35,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:50:35,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:50:35,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:50:35,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:50:35,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:50:35,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:50:35,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:50:35,728 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:50:35,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-14 16:50:35,815 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febc48771/58196709d24f4287a2cc2c5508592769/FLAG7edee28a4 [2018-11-14 16:50:36,249 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:50:36,249 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-14 16:50:36,256 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febc48771/58196709d24f4287a2cc2c5508592769/FLAG7edee28a4 [2018-11-14 16:50:36,274 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febc48771/58196709d24f4287a2cc2c5508592769 [2018-11-14 16:50:36,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:50:36,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:50:36,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:36,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:50:36,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:50:36,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2b0430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36, skipping insertion in model container [2018-11-14 16:50:36,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:50:36,330 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:50:36,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:36,584 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:50:36,633 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:36,662 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:50:36,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36 WrapperNode [2018-11-14 16:50:36,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:36,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:50:36,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:50:36,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:50:36,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:50:36,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:50:36,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:50:36,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:50:36,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:50:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:50:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:50:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:50:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:50:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:50:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:50:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:50:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:50:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:50:37,643 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:50:37,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:37 BoogieIcfgContainer [2018-11-14 16:50:37,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:50:37,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:50:37,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:50:37,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:50:37,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:50:36" (1/3) ... [2018-11-14 16:50:37,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2360bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:37, skipping insertion in model container [2018-11-14 16:50:37,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36" (2/3) ... [2018-11-14 16:50:37,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2360bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:37, skipping insertion in model container [2018-11-14 16:50:37,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:37" (3/3) ... [2018-11-14 16:50:37,653 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_false-unreach-call_ground.i [2018-11-14 16:50:37,664 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:50:37,673 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:50:37,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:50:37,721 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:50:37,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:50:37,722 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:50:37,722 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:50:37,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:50:37,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:50:37,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:50:37,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:50:37,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:50:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 16:50:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:50:37,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:37,751 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:37,754 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:37,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1430000846, now seen corresponding path program 1 times [2018-11-14 16:50:37,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:37,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:37,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:37,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:37,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 16:50:37,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 16:50:37,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 16:50:37,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2018-11-14 16:50:37,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2018-11-14 16:50:37,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {37#true} is VALID [2018-11-14 16:50:37,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 16:50:37,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} havoc ~i~0;~i~0 := 0; {38#false} is VALID [2018-11-14 16:50:37,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 16:50:37,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 16:50:37,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 16:50:37,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} havoc ~x~0;~x~0 := 0; {38#false} is VALID [2018-11-14 16:50:37,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 16:50:37,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {38#false} is VALID [2018-11-14 16:50:37,943 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {38#false} is VALID [2018-11-14 16:50:37,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 16:50:37,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume ~cond == 0; {38#false} is VALID [2018-11-14 16:50:37,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 16:50:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:50:37,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:50:37,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:37,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:50:38,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:38,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:50:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:50:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:50:38,121 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 16:50:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:38,490 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-14 16:50:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:50:38,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:50:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-14 16:50:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-14 16:50:38,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-14 16:50:38,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:38,798 INFO L225 Difference]: With dead ends: 59 [2018-11-14 16:50:38,799 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 16:50:38,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:50:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 16:50:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 16:50:38,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:38,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 16:50:38,846 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:50:38,846 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:50:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:38,852 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:50:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:50:38,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:38,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:38,853 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:50:38,854 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:50:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:38,857 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:50:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:50:38,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:38,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:38,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:38,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:50:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 16:50:38,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2018-11-14 16:50:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:38,864 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 16:50:38,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:50:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:50:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:50:38,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:38,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:38,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:38,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1047758436, now seen corresponding path program 1 times [2018-11-14 16:50:38,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:38,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:38,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-14 16:50:38,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-14 16:50:38,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-14 16:50:38,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #81#return; {212#true} is VALID [2018-11-14 16:50:38,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret10 := main(); {212#true} is VALID [2018-11-14 16:50:38,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {214#(= main_~a~0 0)} is VALID [2018-11-14 16:50:38,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~a~0 0)} assume true; {214#(= main_~a~0 0)} is VALID [2018-11-14 16:50:38,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~a~0 0)} assume !(~a~0 < 100000); {213#false} is VALID [2018-11-14 16:50:38,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {213#false} havoc ~i~0;~i~0 := 0; {213#false} is VALID [2018-11-14 16:50:38,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-14 16:50:38,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~i~0 < 100000); {213#false} is VALID [2018-11-14 16:50:38,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~i~0 := 0; {213#false} is VALID [2018-11-14 16:50:38,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-14 16:50:38,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !(~i~0 < 100000); {213#false} is VALID [2018-11-14 16:50:38,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} havoc ~x~0;~x~0 := 0; {213#false} is VALID [2018-11-14 16:50:38,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {213#false} assume true; {213#false} is VALID [2018-11-14 16:50:38,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {213#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {213#false} is VALID [2018-11-14 16:50:38,990 INFO L256 TraceCheckUtils]: 17: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {213#false} is VALID [2018-11-14 16:50:38,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-14 16:50:38,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {213#false} assume ~cond == 0; {213#false} is VALID [2018-11-14 16:50:38,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-14 16:50:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:50:38,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:38,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:38,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:50:38,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:38,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:39,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:39,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:39,054 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-14 16:50:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,192 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-14 16:50:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:39,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:50:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:50:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:50:39,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 16:50:39,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:39,387 INFO L225 Difference]: With dead ends: 52 [2018-11-14 16:50:39,387 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:50:39,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:50:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 16:50:39,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:39,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 16:50:39,402 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 16:50:39,402 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 16:50:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,405 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:50:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:50:39,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,406 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 16:50:39,406 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 16:50:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,409 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:50:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:50:39,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:39,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:50:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 16:50:39,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2018-11-14 16:50:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:39,413 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 16:50:39,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 16:50:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:50:39,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:39,415 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:39,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:39,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash -212363359, now seen corresponding path program 1 times [2018-11-14 16:50:39,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:39,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-14 16:50:39,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {391#true} is VALID [2018-11-14 16:50:39,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-14 16:50:39,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {391#true} {391#true} #81#return; {391#true} is VALID [2018-11-14 16:50:39,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {391#true} call #t~ret10 := main(); {391#true} is VALID [2018-11-14 16:50:39,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {391#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {391#true} is VALID [2018-11-14 16:50:39,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-14 16:50:39,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {391#true} is VALID [2018-11-14 16:50:39,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {391#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {391#true} is VALID [2018-11-14 16:50:39,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#true} assume true; {391#true} is VALID [2018-11-14 16:50:39,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#true} assume !(~a~0 < 100000); {391#true} is VALID [2018-11-14 16:50:39,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#true} havoc ~i~0;~i~0 := 0; {393#(= main_~i~0 0)} is VALID [2018-11-14 16:50:39,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {393#(= main_~i~0 0)} assume true; {393#(= main_~i~0 0)} is VALID [2018-11-14 16:50:39,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(= main_~i~0 0)} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-14 16:50:39,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#false} ~i~0 := 0; {392#false} is VALID [2018-11-14 16:50:39,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#false} assume true; {392#false} is VALID [2018-11-14 16:50:39,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !(~i~0 < 100000); {392#false} is VALID [2018-11-14 16:50:39,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#false} havoc ~x~0;~x~0 := 0; {392#false} is VALID [2018-11-14 16:50:39,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {392#false} assume true; {392#false} is VALID [2018-11-14 16:50:39,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {392#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {392#false} is VALID [2018-11-14 16:50:39,625 INFO L256 TraceCheckUtils]: 20: Hoare triple {392#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {392#false} is VALID [2018-11-14 16:50:39,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#false} ~cond := #in~cond; {392#false} is VALID [2018-11-14 16:50:39,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {392#false} assume ~cond == 0; {392#false} is VALID [2018-11-14 16:50:39,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-14 16:50:39,628 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 16:50:39,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:39,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:50:39,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:39,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:39,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:39,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:39,922 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-11-14 16:50:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,155 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 16:50:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:40,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:50:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-11-14 16:50:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-11-14 16:50:40,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2018-11-14 16:50:40,315 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 16:50:40,318 INFO L225 Difference]: With dead ends: 53 [2018-11-14 16:50:40,319 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 16:50:40,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 16:50:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-14 16:50:40,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:40,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-14 16:50:40,346 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-14 16:50:40,346 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-14 16:50:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,350 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 16:50:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 16:50:40,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,352 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-14 16:50:40,352 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-14 16:50:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,362 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 16:50:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 16:50:40,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:40,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:50:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 16:50:40,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2018-11-14 16:50:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:40,367 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 16:50:40,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:50:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:50:40,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:40,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:40,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -147651490, now seen corresponding path program 1 times [2018-11-14 16:50:40,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:40,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:40,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-14 16:50:40,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {588#true} is VALID [2018-11-14 16:50:40,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-14 16:50:40,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #81#return; {588#true} is VALID [2018-11-14 16:50:40,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret10 := main(); {588#true} is VALID [2018-11-14 16:50:40,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:40,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(= main_~a~0 0)} assume true; {590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:40,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:40,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:40,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(<= main_~a~0 1)} assume true; {591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:40,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(<= main_~a~0 1)} assume !(~a~0 < 100000); {589#false} is VALID [2018-11-14 16:50:40,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#false} havoc ~i~0;~i~0 := 0; {589#false} is VALID [2018-11-14 16:50:40,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:40,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {589#false} is VALID [2018-11-14 16:50:40,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {589#false} is VALID [2018-11-14 16:50:40,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:40,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-14 16:50:40,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} ~i~0 := 0; {589#false} is VALID [2018-11-14 16:50:40,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:40,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {589#false} is VALID [2018-11-14 16:50:40,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {589#false} is VALID [2018-11-14 16:50:40,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:40,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-14 16:50:40,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {589#false} havoc ~x~0;~x~0 := 0; {589#false} is VALID [2018-11-14 16:50:40,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:40,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {589#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {589#false} is VALID [2018-11-14 16:50:40,494 INFO L256 TraceCheckUtils]: 26: Hoare triple {589#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {589#false} is VALID [2018-11-14 16:50:40,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2018-11-14 16:50:40,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {589#false} assume ~cond == 0; {589#false} is VALID [2018-11-14 16:50:40,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-14 16:50:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:50:40,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:40,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:40,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:41,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-14 16:50:41,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {588#true} is VALID [2018-11-14 16:50:41,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-14 16:50:41,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #81#return; {588#true} is VALID [2018-11-14 16:50:41,129 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret10 := main(); {588#true} is VALID [2018-11-14 16:50:41,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {610#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:41,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {610#(<= main_~a~0 0)} assume true; {610#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:41,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {610#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:41,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(<= main_~a~0 1)} assume true; {591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(<= main_~a~0 1)} assume !(~a~0 < 100000); {589#false} is VALID [2018-11-14 16:50:41,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#false} havoc ~i~0;~i~0 := 0; {589#false} is VALID [2018-11-14 16:50:41,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:41,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {589#false} is VALID [2018-11-14 16:50:41,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {589#false} is VALID [2018-11-14 16:50:41,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:41,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-14 16:50:41,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} ~i~0 := 0; {589#false} is VALID [2018-11-14 16:50:41,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:41,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {589#false} is VALID [2018-11-14 16:50:41,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {589#false} is VALID [2018-11-14 16:50:41,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:41,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {589#false} assume !(~i~0 < 100000); {589#false} is VALID [2018-11-14 16:50:41,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {589#false} havoc ~x~0;~x~0 := 0; {589#false} is VALID [2018-11-14 16:50:41,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {589#false} assume true; {589#false} is VALID [2018-11-14 16:50:41,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {589#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {589#false} is VALID [2018-11-14 16:50:41,152 INFO L256 TraceCheckUtils]: 26: Hoare triple {589#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {589#false} is VALID [2018-11-14 16:50:41,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2018-11-14 16:50:41,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {589#false} assume ~cond == 0; {589#false} is VALID [2018-11-14 16:50:41,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-14 16:50:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:50:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:50:41,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 16:50:41,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:41,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:50:41,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:41,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:50:41,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:50:41,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:50:41,288 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-14 16:50:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,560 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-14 16:50:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:50:41,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 16:50:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:50:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-14 16:50:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:50:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-14 16:50:41,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-14 16:50:41,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:41,679 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:50:41,680 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 16:50:41,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:50:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 16:50:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 16:50:41,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:41,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 16:50:41,699 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 16:50:41,700 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 16:50:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,703 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-14 16:50:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 16:50:41,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,704 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 16:50:41,704 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 16:50:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,707 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-14 16:50:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 16:50:41,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:41,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:50:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-14 16:50:41,711 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 30 [2018-11-14 16:50:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:41,711 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-14 16:50:41,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:50:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 16:50:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:50:41,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:41,712 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:41,713 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:41,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1731065919, now seen corresponding path program 2 times [2018-11-14 16:50:41,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {896#true} is VALID [2018-11-14 16:50:41,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {896#true} is VALID [2018-11-14 16:50:41,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-14 16:50:41,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #81#return; {896#true} is VALID [2018-11-14 16:50:41,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret10 := main(); {896#true} is VALID [2018-11-14 16:50:41,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {898#(= main_~a~0 0)} is VALID [2018-11-14 16:50:41,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {898#(= main_~a~0 0)} assume true; {898#(= main_~a~0 0)} is VALID [2018-11-14 16:50:41,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {898#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {898#(= main_~a~0 0)} is VALID [2018-11-14 16:50:41,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {898#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {899#(<= main_~a~0 1)} assume true; {899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {899#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {899#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {900#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:41,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#(<= main_~a~0 2)} assume true; {900#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:41,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#(<= main_~a~0 2)} assume !(~a~0 < 100000); {897#false} is VALID [2018-11-14 16:50:41,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#false} havoc ~i~0;~i~0 := 0; {897#false} is VALID [2018-11-14 16:50:41,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:41,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {897#false} is VALID [2018-11-14 16:50:41,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {897#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {897#false} is VALID [2018-11-14 16:50:41,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:41,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-14 16:50:41,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {897#false} ~i~0 := 0; {897#false} is VALID [2018-11-14 16:50:41,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:41,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {897#false} is VALID [2018-11-14 16:50:41,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {897#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {897#false} is VALID [2018-11-14 16:50:41,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:41,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-14 16:50:41,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {897#false} havoc ~x~0;~x~0 := 0; {897#false} is VALID [2018-11-14 16:50:41,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:41,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {897#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {897#false} is VALID [2018-11-14 16:50:41,894 INFO L256 TraceCheckUtils]: 29: Hoare triple {897#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {897#false} is VALID [2018-11-14 16:50:41,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {897#false} ~cond := #in~cond; {897#false} is VALID [2018-11-14 16:50:41,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {897#false} assume ~cond == 0; {897#false} is VALID [2018-11-14 16:50:41,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2018-11-14 16:50:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:50:41,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:41,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:41,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:41,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:50:41,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:42,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {896#true} call ULTIMATE.init(); {896#true} is VALID [2018-11-14 16:50:42,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {896#true} is VALID [2018-11-14 16:50:42,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-14 16:50:42,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} #81#return; {896#true} is VALID [2018-11-14 16:50:42,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {896#true} call #t~ret10 := main(); {896#true} is VALID [2018-11-14 16:50:42,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {896#true} is VALID [2018-11-14 16:50:42,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-14 16:50:42,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {896#true} is VALID [2018-11-14 16:50:42,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {896#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {896#true} is VALID [2018-11-14 16:50:42,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-14 16:50:42,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {896#true} is VALID [2018-11-14 16:50:42,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {896#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {896#true} is VALID [2018-11-14 16:50:42,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {896#true} assume true; {896#true} is VALID [2018-11-14 16:50:42,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {896#true} assume !(~a~0 < 100000); {896#true} is VALID [2018-11-14 16:50:42,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {896#true} havoc ~i~0;~i~0 := 0; {946#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:42,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {946#(<= main_~i~0 0)} assume true; {946#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:42,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {946#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {946#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:42,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {946#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {956#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:42,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {956#(<= main_~i~0 1)} assume true; {956#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:42,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {956#(<= main_~i~0 1)} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-14 16:50:42,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {897#false} ~i~0 := 0; {897#false} is VALID [2018-11-14 16:50:42,100 INFO L273 TraceCheckUtils]: 21: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:42,101 INFO L273 TraceCheckUtils]: 22: Hoare triple {897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {897#false} is VALID [2018-11-14 16:50:42,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {897#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {897#false} is VALID [2018-11-14 16:50:42,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:42,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~i~0 < 100000); {897#false} is VALID [2018-11-14 16:50:42,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {897#false} havoc ~x~0;~x~0 := 0; {897#false} is VALID [2018-11-14 16:50:42,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {897#false} assume true; {897#false} is VALID [2018-11-14 16:50:42,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {897#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {897#false} is VALID [2018-11-14 16:50:42,102 INFO L256 TraceCheckUtils]: 29: Hoare triple {897#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {897#false} is VALID [2018-11-14 16:50:42,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {897#false} ~cond := #in~cond; {897#false} is VALID [2018-11-14 16:50:42,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {897#false} assume ~cond == 0; {897#false} is VALID [2018-11-14 16:50:42,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {897#false} assume !false; {897#false} is VALID [2018-11-14 16:50:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:50:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 16:50:42,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 16:50:42,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:42,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:50:42,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:42,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:50:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:50:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:50:42,233 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-11-14 16:50:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,501 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-14 16:50:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:42,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 16:50:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:50:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 16:50:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:50:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 16:50:42,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-14 16:50:42,671 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 16:50:42,673 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:50:42,674 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:50:42,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:50:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:50:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-14 16:50:42,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:42,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-14 16:50:42,694 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-14 16:50:42,694 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-14 16:50:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,697 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:50:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:50:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-14 16:50:42,698 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-14 16:50:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,701 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:50:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:50:42,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:42,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:50:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-14 16:50:42,705 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 33 [2018-11-14 16:50:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:42,705 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-14 16:50:42,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:50:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-14 16:50:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:50:42,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:42,707 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:42,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:42,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash -175622111, now seen corresponding path program 3 times [2018-11-14 16:50:42,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:42,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-14 16:50:42,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-14 16:50:42,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:42,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #81#return; {1263#true} is VALID [2018-11-14 16:50:42,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret10 := main(); {1263#true} is VALID [2018-11-14 16:50:42,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1265#(= main_~a~0 0)} is VALID [2018-11-14 16:50:42,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~a~0 0)} assume true; {1265#(= main_~a~0 0)} is VALID [2018-11-14 16:50:42,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {1265#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1265#(= main_~a~0 0)} is VALID [2018-11-14 16:50:42,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {1265#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1266#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(<= main_~a~0 1)} assume true; {1266#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1266#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {1266#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1267#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:42,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {1267#(<= main_~a~0 2)} assume true; {1267#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:42,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {1267#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1267#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:42,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1268#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:42,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {1268#(<= main_~a~0 3)} assume true; {1268#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:42,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {1268#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1264#false} is VALID [2018-11-14 16:50:42,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {1264#false} havoc ~i~0;~i~0 := 0; {1264#false} is VALID [2018-11-14 16:50:42,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1264#false} is VALID [2018-11-14 16:50:42,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1264#false} is VALID [2018-11-14 16:50:42,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1264#false} is VALID [2018-11-14 16:50:42,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {1264#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1264#false} is VALID [2018-11-14 16:50:42,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 16:50:42,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {1264#false} ~i~0 := 0; {1264#false} is VALID [2018-11-14 16:50:42,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1264#false} is VALID [2018-11-14 16:50:42,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1264#false} is VALID [2018-11-14 16:50:42,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,927 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1264#false} is VALID [2018-11-14 16:50:42,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1264#false} is VALID [2018-11-14 16:50:42,928 INFO L273 TraceCheckUtils]: 33: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 16:50:42,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {1264#false} havoc ~x~0;~x~0 := 0; {1264#false} is VALID [2018-11-14 16:50:42,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:42,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1264#false} is VALID [2018-11-14 16:50:42,929 INFO L256 TraceCheckUtils]: 38: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1264#false} is VALID [2018-11-14 16:50:42,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-14 16:50:42,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {1264#false} assume ~cond == 0; {1264#false} is VALID [2018-11-14 16:50:42,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-14 16:50:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 16:50:42,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:42,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:42,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:50:43,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:50:43,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:43,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:43,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-14 16:50:43,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-14 16:50:43,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:43,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #81#return; {1263#true} is VALID [2018-11-14 16:50:43,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret10 := main(); {1263#true} is VALID [2018-11-14 16:50:43,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1263#true} is VALID [2018-11-14 16:50:43,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:43,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1263#true} is VALID [2018-11-14 16:50:43,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1263#true} is VALID [2018-11-14 16:50:43,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:43,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1263#true} is VALID [2018-11-14 16:50:43,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1263#true} is VALID [2018-11-14 16:50:43,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:43,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1263#true} is VALID [2018-11-14 16:50:43,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1263#true} is VALID [2018-11-14 16:50:43,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 16:50:43,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#true} assume !(~a~0 < 100000); {1263#true} is VALID [2018-11-14 16:50:43,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#true} havoc ~i~0;~i~0 := 0; {1323#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {1323#(<= main_~i~0 0)} assume true; {1323#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {1323#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1323#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {1323#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1333#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:43,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {1333#(<= main_~i~0 1)} assume true; {1333#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:43,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {1333#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1333#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:43,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {1333#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1343#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:43,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {1343#(<= main_~i~0 2)} assume true; {1343#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:43,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {1343#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 16:50:43,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {1264#false} ~i~0 := 0; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1264#false} is VALID [2018-11-14 16:50:43,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1264#false} is VALID [2018-11-14 16:50:43,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:43,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 16:50:43,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {1264#false} havoc ~x~0;~x~0 := 0; {1264#false} is VALID [2018-11-14 16:50:43,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 16:50:43,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1264#false} is VALID [2018-11-14 16:50:43,377 INFO L256 TraceCheckUtils]: 38: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1264#false} is VALID [2018-11-14 16:50:43,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-14 16:50:43,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {1264#false} assume ~cond == 0; {1264#false} is VALID [2018-11-14 16:50:43,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-14 16:50:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-14 16:50:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 16:50:43,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-14 16:50:43,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:43,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:50:43,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:43,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:50:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:50:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:50:43,475 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2018-11-14 16:50:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,811 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-14 16:50:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:50:43,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-14 16:50:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:50:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2018-11-14 16:50:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:50:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2018-11-14 16:50:43,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 87 transitions. [2018-11-14 16:50:43,949 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 16:50:43,951 INFO L225 Difference]: With dead ends: 89 [2018-11-14 16:50:43,951 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 16:50:43,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:50:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 16:50:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-14 16:50:43,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:43,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 56 states. [2018-11-14 16:50:43,985 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 56 states. [2018-11-14 16:50:43,985 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 56 states. [2018-11-14 16:50:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,989 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-14 16:50:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-14 16:50:43,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,990 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 59 states. [2018-11-14 16:50:43,990 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 59 states. [2018-11-14 16:50:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,992 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-14 16:50:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-14 16:50:43,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:43,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:50:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-14 16:50:43,996 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 42 [2018-11-14 16:50:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:43,996 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-14 16:50:43,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:50:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 16:50:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:50:43,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:43,998 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:43,998 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:43,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2061528001, now seen corresponding path program 4 times [2018-11-14 16:50:43,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:43,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:44,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:44,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-14 16:50:44,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1709#true} is VALID [2018-11-14 16:50:44,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-14 16:50:44,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #81#return; {1709#true} is VALID [2018-11-14 16:50:44,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret10 := main(); {1709#true} is VALID [2018-11-14 16:50:44,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1711#(= main_~a~0 0)} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {1711#(= main_~a~0 0)} assume true; {1711#(= main_~a~0 0)} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {1711#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1711#(= main_~a~0 0)} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {1711#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(<= main_~a~0 1)} assume true; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1713#(<= main_~a~0 2)} assume true; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {1713#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {1713#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {1714#(<= main_~a~0 3)} assume true; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {1714#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {1714#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1715#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:44,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {1715#(<= main_~a~0 4)} assume true; {1715#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:44,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {1715#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#false} havoc ~i~0;~i~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} ~i~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,211 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,211 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,211 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L256 TraceCheckUtils]: 47: Hoare triple {1710#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-14 16:50:44,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume ~cond == 0; {1710#false} is VALID [2018-11-14 16:50:44,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-14 16:50:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:50:44,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:44,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:50:44,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:50:44,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:44,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:44,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-14 16:50:44,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1709#true} is VALID [2018-11-14 16:50:44,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-14 16:50:44,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #81#return; {1709#true} is VALID [2018-11-14 16:50:44,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret10 := main(); {1709#true} is VALID [2018-11-14 16:50:44,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1734#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:44,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1734#(<= main_~a~0 0)} assume true; {1734#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:44,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {1734#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1734#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:44,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {1734#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(<= main_~a~0 1)} assume true; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1712#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {1713#(<= main_~a~0 2)} assume true; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {1713#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1713#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {1713#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {1714#(<= main_~a~0 3)} assume true; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {1714#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1714#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {1714#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1715#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:44,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {1715#(<= main_~a~0 4)} assume true; {1715#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:44,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {1715#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#false} havoc ~i~0;~i~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1710#false} is VALID [2018-11-14 16:50:44,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1710#false} is VALID [2018-11-14 16:50:44,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} ~i~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1710#false} is VALID [2018-11-14 16:50:44,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1710#false} is VALID [2018-11-14 16:50:44,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,534 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !(~i~0 < 100000); {1710#false} is VALID [2018-11-14 16:50:44,534 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0; {1710#false} is VALID [2018-11-14 16:50:44,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-14 16:50:44,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1710#false} is VALID [2018-11-14 16:50:44,535 INFO L256 TraceCheckUtils]: 47: Hoare triple {1710#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1710#false} is VALID [2018-11-14 16:50:44,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-14 16:50:44,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume ~cond == 0; {1710#false} is VALID [2018-11-14 16:50:44,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-14 16:50:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:50:44,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:44,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:50:44,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-14 16:50:44,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:44,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:50:44,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:44,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:50:44,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:50:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:44,694 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 8 states. [2018-11-14 16:50:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,003 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-14 16:50:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:45,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-14 16:50:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-14 16:50:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-14 16:50:45,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2018-11-14 16:50:45,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:45,098 INFO L225 Difference]: With dead ends: 96 [2018-11-14 16:50:45,098 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:50:45,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:50:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 16:50:45,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:45,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 16:50:45,130 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 16:50:45,130 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 16:50:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,133 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-14 16:50:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-14 16:50:45,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,134 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 16:50:45,134 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 16:50:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,136 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-14 16:50:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-14 16:50:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:45,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:50:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-14 16:50:45,140 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 51 [2018-11-14 16:50:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:45,140 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-14 16:50:45,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:50:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-14 16:50:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:50:45,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:45,141 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:45,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:45,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash -108497858, now seen corresponding path program 5 times [2018-11-14 16:50:45,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:45,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:45,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:45,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:45,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2018-11-14 16:50:45,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2197#true} is VALID [2018-11-14 16:50:45,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:45,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #81#return; {2197#true} is VALID [2018-11-14 16:50:45,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret10 := main(); {2197#true} is VALID [2018-11-14 16:50:45,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {2197#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2199#(= main_~a~0 0)} is VALID [2018-11-14 16:50:45,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {2199#(= main_~a~0 0)} assume true; {2199#(= main_~a~0 0)} is VALID [2018-11-14 16:50:45,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {2199#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2199#(= main_~a~0 0)} is VALID [2018-11-14 16:50:45,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2200#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:45,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= main_~a~0 1)} assume true; {2200#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:45,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {2200#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2200#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:45,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {2200#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2201#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:45,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {2201#(<= main_~a~0 2)} assume true; {2201#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:45,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {2201#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2201#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:45,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {2201#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2202#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:45,319 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#(<= main_~a~0 3)} assume true; {2202#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:45,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {2202#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2202#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:45,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {2202#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2203#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:45,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {2203#(<= main_~a~0 4)} assume true; {2203#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:45,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {2203#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2203#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:45,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {2203#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2204#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:45,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {2204#(<= main_~a~0 5)} assume true; {2204#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:45,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {2204#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2198#false} is VALID [2018-11-14 16:50:45,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {2198#false} havoc ~i~0;~i~0 := 0; {2198#false} is VALID [2018-11-14 16:50:45,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2198#false} is VALID [2018-11-14 16:50:45,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2198#false} is VALID [2018-11-14 16:50:45,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2198#false} is VALID [2018-11-14 16:50:45,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {2198#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2198#false} is VALID [2018-11-14 16:50:45,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2198#false} is VALID [2018-11-14 16:50:45,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {2198#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#false} ~i~0 := 0; {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:45,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:45,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {2198#false} havoc ~x~0;~x~0 := 0; {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {2198#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2198#false} is VALID [2018-11-14 16:50:45,331 INFO L256 TraceCheckUtils]: 50: Hoare triple {2198#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2198#false} is VALID [2018-11-14 16:50:45,332 INFO L273 TraceCheckUtils]: 51: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2018-11-14 16:50:45,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {2198#false} assume ~cond == 0; {2198#false} is VALID [2018-11-14 16:50:45,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2018-11-14 16:50:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:50:45,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:45,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:50:45,934 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:50:45,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:45,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:46,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2018-11-14 16:50:46,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2197#true} is VALID [2018-11-14 16:50:46,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #81#return; {2197#true} is VALID [2018-11-14 16:50:46,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret10 := main(); {2197#true} is VALID [2018-11-14 16:50:46,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {2197#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2197#true} is VALID [2018-11-14 16:50:46,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2197#true} is VALID [2018-11-14 16:50:46,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2197#true} is VALID [2018-11-14 16:50:46,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2197#true} is VALID [2018-11-14 16:50:46,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {2197#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {2197#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-14 16:50:46,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {2197#true} assume !(~a~0 < 100000); {2197#true} is VALID [2018-11-14 16:50:46,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {2197#true} havoc ~i~0;~i~0 := 0; {2277#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:46,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {2277#(<= main_~i~0 0)} assume true; {2277#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:46,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {2277#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2277#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:46,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {2277#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2287#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:46,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#(<= main_~i~0 1)} assume true; {2287#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:46,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {2287#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2287#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:46,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {2287#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2297#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:46,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {2297#(<= main_~i~0 2)} assume true; {2297#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:46,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {2297#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2297#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:46,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {2297#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2307#(<= main_~i~0 3)} is VALID [2018-11-14 16:50:46,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {2307#(<= main_~i~0 3)} assume true; {2307#(<= main_~i~0 3)} is VALID [2018-11-14 16:50:46,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {2307#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-14 16:50:46,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#false} ~i~0 := 0; {2198#false} is VALID [2018-11-14 16:50:46,372 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:46,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:46,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:46,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:46,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:46,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:46,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:46,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {2198#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2198#false} is VALID [2018-11-14 16:50:46,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {2198#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2198#false} is VALID [2018-11-14 16:50:46,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:46,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {2198#false} assume !(~i~0 < 100000); {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {2198#false} havoc ~x~0;~x~0 := 0; {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {2198#false} assume true; {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {2198#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L256 TraceCheckUtils]: 50: Hoare triple {2198#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L273 TraceCheckUtils]: 51: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2018-11-14 16:50:46,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {2198#false} assume ~cond == 0; {2198#false} is VALID [2018-11-14 16:50:46,377 INFO L273 TraceCheckUtils]: 53: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2018-11-14 16:50:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-14 16:50:46,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:46,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 16:50:46,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-14 16:50:46,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:46,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:50:46,498 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 16:50:46,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:50:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:50:46,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:50:46,499 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 12 states. [2018-11-14 16:50:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,112 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-14 16:50:47,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:50:47,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-14 16:50:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-14 16:50:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-14 16:50:47,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2018-11-14 16:50:47,220 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 16:50:47,222 INFO L225 Difference]: With dead ends: 107 [2018-11-14 16:50:47,223 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 16:50:47,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 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 16:50:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 16:50:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-14 16:50:47,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:47,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 68 states. [2018-11-14 16:50:47,282 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 68 states. [2018-11-14 16:50:47,282 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 68 states. [2018-11-14 16:50:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,285 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-14 16:50:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-14 16:50:47,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,286 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 71 states. [2018-11-14 16:50:47,286 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 71 states. [2018-11-14 16:50:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,288 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-14 16:50:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-14 16:50:47,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:47,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:50:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-14 16:50:47,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 54 [2018-11-14 16:50:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:47,291 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-14 16:50:47,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:50:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:50:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 16:50:47,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:47,292 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:47,292 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:47,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash -650580796, now seen corresponding path program 6 times [2018-11-14 16:50:47,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:47,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:48,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2018-11-14 16:50:48,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2746#true} is VALID [2018-11-14 16:50:48,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2018-11-14 16:50:48,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #81#return; {2746#true} is VALID [2018-11-14 16:50:48,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret10 := main(); {2746#true} is VALID [2018-11-14 16:50:48,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2748#(= main_~a~0 0)} is VALID [2018-11-14 16:50:48,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {2748#(= main_~a~0 0)} assume true; {2748#(= main_~a~0 0)} is VALID [2018-11-14 16:50:48,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {2748#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2748#(= main_~a~0 0)} is VALID [2018-11-14 16:50:48,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {2748#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {2749#(<= main_~a~0 1)} assume true; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {2749#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {2749#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {2750#(<= main_~a~0 2)} assume true; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {2750#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {2750#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {2751#(<= main_~a~0 3)} assume true; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {2751#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {2751#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#(<= main_~a~0 4)} assume true; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {2753#(<= main_~a~0 5)} assume true; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {2753#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {2753#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2754#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:48,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {2754#(<= main_~a~0 6)} assume true; {2754#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:48,039 INFO L273 TraceCheckUtils]: 25: Hoare triple {2754#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {2747#false} havoc ~i~0;~i~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 41: Hoare triple {2747#false} ~i~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 52: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,046 INFO L273 TraceCheckUtils]: 55: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,046 INFO L273 TraceCheckUtils]: 56: Hoare triple {2747#false} havoc ~x~0;~x~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {2747#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2747#false} is VALID [2018-11-14 16:50:48,046 INFO L256 TraceCheckUtils]: 59: Hoare triple {2747#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2747#false} is VALID [2018-11-14 16:50:48,047 INFO L273 TraceCheckUtils]: 60: Hoare triple {2747#false} ~cond := #in~cond; {2747#false} is VALID [2018-11-14 16:50:48,047 INFO L273 TraceCheckUtils]: 61: Hoare triple {2747#false} assume ~cond == 0; {2747#false} is VALID [2018-11-14 16:50:48,047 INFO L273 TraceCheckUtils]: 62: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2018-11-14 16:50:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:48,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:48,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:48,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:50:48,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:50:48,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:48,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:48,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2018-11-14 16:50:48,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2746#true} is VALID [2018-11-14 16:50:48,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2018-11-14 16:50:48,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #81#return; {2746#true} is VALID [2018-11-14 16:50:48,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret10 := main(); {2746#true} is VALID [2018-11-14 16:50:48,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2773#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:48,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {2773#(<= main_~a~0 0)} assume true; {2773#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:48,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2773#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:48,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {2749#(<= main_~a~0 1)} assume true; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {2749#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2749#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:48,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {2749#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {2750#(<= main_~a~0 2)} assume true; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {2750#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2750#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:48,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {2750#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {2751#(<= main_~a~0 3)} assume true; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {2751#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2751#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:48,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {2751#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#(<= main_~a~0 4)} assume true; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2752#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:48,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {2753#(<= main_~a~0 5)} assume true; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {2753#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2753#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:48,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {2753#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2754#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:48,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {2754#(<= main_~a~0 6)} assume true; {2754#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:48,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {2754#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {2747#false} havoc ~i~0;~i~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2747#false} is VALID [2018-11-14 16:50:48,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2747#false} is VALID [2018-11-14 16:50:48,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {2747#false} ~i~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 42: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {2747#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {2747#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2747#false} is VALID [2018-11-14 16:50:48,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 55: Hoare triple {2747#false} assume !(~i~0 < 100000); {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 56: Hoare triple {2747#false} havoc ~x~0;~x~0 := 0; {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 57: Hoare triple {2747#false} assume true; {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {2747#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L256 TraceCheckUtils]: 59: Hoare triple {2747#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 60: Hoare triple {2747#false} ~cond := #in~cond; {2747#false} is VALID [2018-11-14 16:50:48,607 INFO L273 TraceCheckUtils]: 61: Hoare triple {2747#false} assume ~cond == 0; {2747#false} is VALID [2018-11-14 16:50:48,608 INFO L273 TraceCheckUtils]: 62: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2018-11-14 16:50:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:50:48,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-11-14 16:50:48,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:48,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:50:48,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:48,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:50:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:50:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:50:48,676 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 10 states. [2018-11-14 16:50:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:48,961 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-14 16:50:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:50:48,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-11-14 16:50:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:50:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-14 16:50:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:50:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-14 16:50:48,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2018-11-14 16:50:49,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:49,123 INFO L225 Difference]: With dead ends: 114 [2018-11-14 16:50:49,123 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:50:49,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:50:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:50:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-14 16:50:49,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:49,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-14 16:50:49,165 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-14 16:50:49,166 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-14 16:50:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:49,169 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-14 16:50:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-14 16:50:49,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:49,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:49,170 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-14 16:50:49,170 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-14 16:50:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:49,172 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-14 16:50:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-14 16:50:49,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:49,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:49,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:49,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 16:50:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-14 16:50:49,175 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 63 [2018-11-14 16:50:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:49,176 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-14 16:50:49,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:50:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-14 16:50:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 16:50:49,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:49,177 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:49,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:49,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash 705634753, now seen corresponding path program 7 times [2018-11-14 16:50:49,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:49,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:49,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {3336#true} call ULTIMATE.init(); {3336#true} is VALID [2018-11-14 16:50:49,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {3336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3336#true} is VALID [2018-11-14 16:50:49,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {3336#true} assume true; {3336#true} is VALID [2018-11-14 16:50:49,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3336#true} {3336#true} #81#return; {3336#true} is VALID [2018-11-14 16:50:49,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {3336#true} call #t~ret10 := main(); {3336#true} is VALID [2018-11-14 16:50:49,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {3336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3338#(= main_~a~0 0)} is VALID [2018-11-14 16:50:49,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {3338#(= main_~a~0 0)} assume true; {3338#(= main_~a~0 0)} is VALID [2018-11-14 16:50:49,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {3338#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3338#(= main_~a~0 0)} is VALID [2018-11-14 16:50:49,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {3338#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {3339#(<= main_~a~0 1)} assume true; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {3339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {3339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~a~0 2)} assume true; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {3340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {3340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~a~0 3)} assume true; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {3341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {3341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~a~0 4)} assume true; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {3342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {3342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~a~0 5)} assume true; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {3343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {3343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~a~0 6)} assume true; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {3344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,371 INFO L273 TraceCheckUtils]: 26: Hoare triple {3344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3345#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:49,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~a~0 7)} assume true; {3345#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:49,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {3345#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {3337#false} havoc ~i~0;~i~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,373 INFO L273 TraceCheckUtils]: 30: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,373 INFO L273 TraceCheckUtils]: 31: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 43: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {3337#false} ~i~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 46: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,376 INFO L273 TraceCheckUtils]: 50: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 52: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 53: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 55: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 57: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,377 INFO L273 TraceCheckUtils]: 58: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {3337#false} havoc ~x~0;~x~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 60: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 61: Hoare triple {3337#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L256 TraceCheckUtils]: 62: Hoare triple {3337#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 63: Hoare triple {3337#false} ~cond := #in~cond; {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 64: Hoare triple {3337#false} assume ~cond == 0; {3337#false} is VALID [2018-11-14 16:50:49,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2018-11-14 16:50:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:49,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:49,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:49,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:49,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:49,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {3336#true} call ULTIMATE.init(); {3336#true} is VALID [2018-11-14 16:50:49,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {3336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3336#true} is VALID [2018-11-14 16:50:49,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {3336#true} assume true; {3336#true} is VALID [2018-11-14 16:50:49,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3336#true} {3336#true} #81#return; {3336#true} is VALID [2018-11-14 16:50:49,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {3336#true} call #t~ret10 := main(); {3336#true} is VALID [2018-11-14 16:50:49,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {3336#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3364#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:49,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {3364#(<= main_~a~0 0)} assume true; {3364#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:49,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {3364#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3364#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:49,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {3364#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {3339#(<= main_~a~0 1)} assume true; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {3339#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3339#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:49,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {3339#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~a~0 2)} assume true; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {3340#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3340#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:49,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {3340#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~a~0 3)} assume true; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3341#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3341#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:49,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {3341#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~a~0 4)} assume true; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {3342#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3342#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:49,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {3342#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~a~0 5)} assume true; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {3343#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3343#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:49,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {3343#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~a~0 6)} assume true; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {3344#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3344#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:49,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {3344#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3345#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:49,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~a~0 7)} assume true; {3345#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:49,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {3345#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {3337#false} havoc ~i~0;~i~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,915 INFO L273 TraceCheckUtils]: 38: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 40: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 41: Hoare triple {3337#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 44: Hoare triple {3337#false} ~i~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 46: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 47: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,917 INFO L273 TraceCheckUtils]: 53: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {3337#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {3337#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {3337#false} assume !(~i~0 < 100000); {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 59: Hoare triple {3337#false} havoc ~x~0;~x~0 := 0; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 60: Hoare triple {3337#false} assume true; {3337#false} is VALID [2018-11-14 16:50:49,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {3337#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3337#false} is VALID [2018-11-14 16:50:49,919 INFO L256 TraceCheckUtils]: 62: Hoare triple {3337#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3337#false} is VALID [2018-11-14 16:50:49,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {3337#false} ~cond := #in~cond; {3337#false} is VALID [2018-11-14 16:50:49,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {3337#false} assume ~cond == 0; {3337#false} is VALID [2018-11-14 16:50:49,919 INFO L273 TraceCheckUtils]: 65: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2018-11-14 16:50:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:49,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:49,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:50:49,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-14 16:50:49,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:49,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:50:49,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:49,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:50:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:50:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:50:49,994 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 11 states. [2018-11-14 16:50:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:50,157 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-14 16:50:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:50:50,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-14 16:50:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:50:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-14 16:50:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:50:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-14 16:50:50,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2018-11-14 16:50:50,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:50,278 INFO L225 Difference]: With dead ends: 117 [2018-11-14 16:50:50,278 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 16:50:50,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:50:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 16:50:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-14 16:50:50,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:50,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-14 16:50:50,305 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-14 16:50:50,305 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-14 16:50:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:50,308 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 16:50:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 16:50:50,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:50,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:50,308 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-14 16:50:50,309 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-14 16:50:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:50,310 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 16:50:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 16:50:50,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:50,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:50,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:50,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:50:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 16:50:50,313 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 66 [2018-11-14 16:50:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:50,313 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 16:50:50,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:50:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:50:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 16:50:50,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:50,315 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:50,315 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:50,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash 965701540, now seen corresponding path program 8 times [2018-11-14 16:50:50,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:50,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:50,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {3950#true} call ULTIMATE.init(); {3950#true} is VALID [2018-11-14 16:50:50,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {3950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3950#true} is VALID [2018-11-14 16:50:50,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {3950#true} assume true; {3950#true} is VALID [2018-11-14 16:50:50,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3950#true} {3950#true} #81#return; {3950#true} is VALID [2018-11-14 16:50:50,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {3950#true} call #t~ret10 := main(); {3950#true} is VALID [2018-11-14 16:50:50,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {3950#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3952#(= main_~a~0 0)} is VALID [2018-11-14 16:50:50,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {3952#(= main_~a~0 0)} assume true; {3952#(= main_~a~0 0)} is VALID [2018-11-14 16:50:50,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {3952#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3952#(= main_~a~0 0)} is VALID [2018-11-14 16:50:50,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {3952#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {3953#(<= main_~a~0 1)} assume true; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {3953#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {3953#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {3954#(<= main_~a~0 2)} assume true; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {3954#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {3954#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#(<= main_~a~0 3)} assume true; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {3955#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {3955#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {3956#(<= main_~a~0 4)} assume true; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {3956#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {3957#(<= main_~a~0 5)} assume true; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {3957#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {3957#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {3958#(<= main_~a~0 6)} assume true; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {3958#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {3958#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(<= main_~a~0 7)} assume true; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3960#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:50,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {3960#(<= main_~a~0 8)} assume true; {3960#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:50,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {3960#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {3951#false} havoc ~i~0;~i~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 39: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,534 INFO L273 TraceCheckUtils]: 41: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 42: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 43: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 44: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 45: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 46: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,535 INFO L273 TraceCheckUtils]: 47: Hoare triple {3951#false} ~i~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 48: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 49: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 50: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,537 INFO L273 TraceCheckUtils]: 55: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,537 INFO L273 TraceCheckUtils]: 58: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 62: Hoare triple {3951#false} havoc ~x~0;~x~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,538 INFO L273 TraceCheckUtils]: 63: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 64: Hoare triple {3951#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3951#false} is VALID [2018-11-14 16:50:50,539 INFO L256 TraceCheckUtils]: 65: Hoare triple {3951#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3951#false} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 66: Hoare triple {3951#false} ~cond := #in~cond; {3951#false} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 67: Hoare triple {3951#false} assume ~cond == 0; {3951#false} is VALID [2018-11-14 16:50:50,539 INFO L273 TraceCheckUtils]: 68: Hoare triple {3951#false} assume !false; {3951#false} is VALID [2018-11-14 16:50:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:50,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:50,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:50,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:50:50,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:50,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:50,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {3950#true} call ULTIMATE.init(); {3950#true} is VALID [2018-11-14 16:50:50,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {3950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3950#true} is VALID [2018-11-14 16:50:50,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {3950#true} assume true; {3950#true} is VALID [2018-11-14 16:50:50,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3950#true} {3950#true} #81#return; {3950#true} is VALID [2018-11-14 16:50:50,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {3950#true} call #t~ret10 := main(); {3950#true} is VALID [2018-11-14 16:50:50,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {3950#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3979#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:50,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {3979#(<= main_~a~0 0)} assume true; {3979#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:50,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {3979#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3979#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:50,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {3979#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {3953#(<= main_~a~0 1)} assume true; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {3953#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3953#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:50,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {3953#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {3954#(<= main_~a~0 2)} assume true; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {3954#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3954#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:50,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {3954#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#(<= main_~a~0 3)} assume true; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {3955#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3955#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:50,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {3955#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {3956#(<= main_~a~0 4)} assume true; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3956#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:50,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {3956#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {3957#(<= main_~a~0 5)} assume true; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {3957#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3957#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:50,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {3957#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {3958#(<= main_~a~0 6)} assume true; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,827 INFO L273 TraceCheckUtils]: 25: Hoare triple {3958#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3958#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:50,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {3958#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,828 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(<= main_~a~0 7)} assume true; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3959#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:50,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3960#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:50,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {3960#(<= main_~a~0 8)} assume true; {3960#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:50,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {3960#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {3951#false} havoc ~i~0;~i~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 33: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,832 INFO L273 TraceCheckUtils]: 43: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3951#false} is VALID [2018-11-14 16:50:50,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {3951#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3951#false} is VALID [2018-11-14 16:50:50,832 INFO L273 TraceCheckUtils]: 45: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {3951#false} ~i~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 51: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 52: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 54: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 55: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 58: Hoare triple {3951#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 59: Hoare triple {3951#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 60: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 61: Hoare triple {3951#false} assume !(~i~0 < 100000); {3951#false} is VALID [2018-11-14 16:50:50,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {3951#false} havoc ~x~0;~x~0 := 0; {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {3951#false} assume true; {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {3951#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L256 TraceCheckUtils]: 65: Hoare triple {3951#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L273 TraceCheckUtils]: 66: Hoare triple {3951#false} ~cond := #in~cond; {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L273 TraceCheckUtils]: 67: Hoare triple {3951#false} assume ~cond == 0; {3951#false} is VALID [2018-11-14 16:50:50,836 INFO L273 TraceCheckUtils]: 68: Hoare triple {3951#false} assume !false; {3951#false} is VALID [2018-11-14 16:50:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:50:50,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-14 16:50:50,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:50,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:50:50,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:50,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:50:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:50:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:50:50,916 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 12 states. [2018-11-14 16:50:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:51,294 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-14 16:50:51,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:50:51,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-11-14 16:50:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 16:50:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:50:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 16:50:51,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-14 16:50:51,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:51,429 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:50:51,429 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 16:50:51,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:50:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 16:50:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 16:50:52,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:52,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 16:50:52,013 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 16:50:52,013 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 16:50:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:52,015 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-14 16:50:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 16:50:52,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:52,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:52,016 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 16:50:52,016 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 16:50:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:52,019 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-14 16:50:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 16:50:52,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:52,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:52,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:52,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:50:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-14 16:50:52,022 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 69 [2018-11-14 16:50:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:52,022 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-14 16:50:52,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:50:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-14 16:50:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 16:50:52,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:52,024 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:52,024 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:52,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 494351073, now seen corresponding path program 9 times [2018-11-14 16:50:52,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:52,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:52,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {4588#true} call ULTIMATE.init(); {4588#true} is VALID [2018-11-14 16:50:52,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {4588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4588#true} is VALID [2018-11-14 16:50:52,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:52,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4588#true} {4588#true} #81#return; {4588#true} is VALID [2018-11-14 16:50:52,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {4588#true} call #t~ret10 := main(); {4588#true} is VALID [2018-11-14 16:50:52,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {4588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:52,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {4590#(= main_~a~0 0)} assume true; {4590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:52,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {4590#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4590#(= main_~a~0 0)} is VALID [2018-11-14 16:50:52,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {4590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:52,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {4591#(<= main_~a~0 1)} assume true; {4591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:52,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {4591#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4591#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:52,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {4591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4592#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:52,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {4592#(<= main_~a~0 2)} assume true; {4592#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:52,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {4592#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4592#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:52,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {4592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4593#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:52,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {4593#(<= main_~a~0 3)} assume true; {4593#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:52,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {4593#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4593#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:52,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {4593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4594#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:52,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {4594#(<= main_~a~0 4)} assume true; {4594#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:52,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {4594#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4594#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:52,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {4594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4595#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:52,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {4595#(<= main_~a~0 5)} assume true; {4595#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:52,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {4595#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4595#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:52,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {4595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4596#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:52,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {4596#(<= main_~a~0 6)} assume true; {4596#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:52,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {4596#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4596#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:52,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {4596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4597#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:52,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {4597#(<= main_~a~0 7)} assume true; {4597#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:52,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {4597#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4597#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:52,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {4597#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4598#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:52,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {4598#(<= main_~a~0 8)} assume true; {4598#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:52,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {4598#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4598#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:52,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {4598#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4599#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:52,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {4599#(<= main_~a~0 9)} assume true; {4599#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:52,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {4599#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4589#false} is VALID [2018-11-14 16:50:52,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {4589#false} havoc ~i~0;~i~0 := 0; {4589#false} is VALID [2018-11-14 16:50:52,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4589#false} is VALID [2018-11-14 16:50:52,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {4589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4589#false} is VALID [2018-11-14 16:50:52,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {4589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 44: Hoare triple {4589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 45: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,736 INFO L273 TraceCheckUtils]: 46: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {4589#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 49: Hoare triple {4589#false} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {4589#false} ~i~0 := 0; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 52: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {4589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4589#false} is VALID [2018-11-14 16:50:52,737 INFO L273 TraceCheckUtils]: 54: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {4589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 57: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 58: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 59: Hoare triple {4589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 60: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 61: Hoare triple {4589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4589#false} is VALID [2018-11-14 16:50:52,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {4589#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 63: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {4589#false} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 65: Hoare triple {4589#false} havoc ~x~0;~x~0 := 0; {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 66: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 67: Hoare triple {4589#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L256 TraceCheckUtils]: 68: Hoare triple {4589#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 69: Hoare triple {4589#false} ~cond := #in~cond; {4589#false} is VALID [2018-11-14 16:50:52,739 INFO L273 TraceCheckUtils]: 70: Hoare triple {4589#false} assume ~cond == 0; {4589#false} is VALID [2018-11-14 16:50:52,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {4589#false} assume !false; {4589#false} is VALID [2018-11-14 16:50:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:50:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:52,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:50:52,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:50:52,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:52,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:53,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {4588#true} call ULTIMATE.init(); {4588#true} is VALID [2018-11-14 16:50:53,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {4588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4588#true} is VALID [2018-11-14 16:50:53,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4588#true} {4588#true} #81#return; {4588#true} is VALID [2018-11-14 16:50:53,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {4588#true} call #t~ret10 := main(); {4588#true} is VALID [2018-11-14 16:50:53,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {4588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4588#true} is VALID [2018-11-14 16:50:53,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {4588#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4588#true} is VALID [2018-11-14 16:50:53,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {4588#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4588#true} is VALID [2018-11-14 16:50:53,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {4588#true} assume !(~a~0 < 100000); {4588#true} is VALID [2018-11-14 16:50:53,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {4588#true} havoc ~i~0;~i~0 := 0; {4588#true} is VALID [2018-11-14 16:50:53,051 INFO L273 TraceCheckUtils]: 36: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4588#true} is VALID [2018-11-14 16:50:53,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {4588#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4588#true} is VALID [2018-11-14 16:50:53,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4588#true} is VALID [2018-11-14 16:50:53,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {4588#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4588#true} is VALID [2018-11-14 16:50:53,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4588#true} is VALID [2018-11-14 16:50:53,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {4588#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4588#true} is VALID [2018-11-14 16:50:53,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,053 INFO L273 TraceCheckUtils]: 46: Hoare triple {4588#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4588#true} is VALID [2018-11-14 16:50:53,053 INFO L273 TraceCheckUtils]: 47: Hoare triple {4588#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4588#true} is VALID [2018-11-14 16:50:53,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {4588#true} assume true; {4588#true} is VALID [2018-11-14 16:50:53,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {4588#true} assume !(~i~0 < 100000); {4588#true} is VALID [2018-11-14 16:50:53,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {4588#true} ~i~0 := 0; {4753#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:53,079 INFO L273 TraceCheckUtils]: 51: Hoare triple {4753#(<= main_~i~0 0)} assume true; {4753#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:53,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {4753#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4753#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:53,082 INFO L273 TraceCheckUtils]: 53: Hoare triple {4753#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4763#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:53,083 INFO L273 TraceCheckUtils]: 54: Hoare triple {4763#(<= main_~i~0 1)} assume true; {4763#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:53,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {4763#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4763#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:53,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {4763#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4773#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:53,087 INFO L273 TraceCheckUtils]: 57: Hoare triple {4773#(<= main_~i~0 2)} assume true; {4773#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:53,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {4773#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4773#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:53,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {4773#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4783#(<= main_~i~0 3)} is VALID [2018-11-14 16:50:53,090 INFO L273 TraceCheckUtils]: 60: Hoare triple {4783#(<= main_~i~0 3)} assume true; {4783#(<= main_~i~0 3)} is VALID [2018-11-14 16:50:53,092 INFO L273 TraceCheckUtils]: 61: Hoare triple {4783#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4783#(<= main_~i~0 3)} is VALID [2018-11-14 16:50:53,092 INFO L273 TraceCheckUtils]: 62: Hoare triple {4783#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4793#(<= main_~i~0 4)} is VALID [2018-11-14 16:50:53,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {4793#(<= main_~i~0 4)} assume true; {4793#(<= main_~i~0 4)} is VALID [2018-11-14 16:50:53,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {4793#(<= main_~i~0 4)} assume !(~i~0 < 100000); {4589#false} is VALID [2018-11-14 16:50:53,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {4589#false} havoc ~x~0;~x~0 := 0; {4589#false} is VALID [2018-11-14 16:50:53,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {4589#false} assume true; {4589#false} is VALID [2018-11-14 16:50:53,096 INFO L273 TraceCheckUtils]: 67: Hoare triple {4589#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {4589#false} is VALID [2018-11-14 16:50:53,096 INFO L256 TraceCheckUtils]: 68: Hoare triple {4589#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4589#false} is VALID [2018-11-14 16:50:53,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {4589#false} ~cond := #in~cond; {4589#false} is VALID [2018-11-14 16:50:53,096 INFO L273 TraceCheckUtils]: 70: Hoare triple {4589#false} assume ~cond == 0; {4589#false} is VALID [2018-11-14 16:50:53,096 INFO L273 TraceCheckUtils]: 71: Hoare triple {4589#false} assume !false; {4589#false} is VALID [2018-11-14 16:50:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-14 16:50:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-14 16:50:53,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-14 16:50:53,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:53,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:50:53,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:53,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:50:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:50:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:50:53,209 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 17 states. [2018-11-14 16:50:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:53,839 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-11-14 16:50:53,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:50:53,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-14 16:50:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:50:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2018-11-14 16:50:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:50:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2018-11-14 16:50:53,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 117 transitions. [2018-11-14 16:50:54,018 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 16:50:54,020 INFO L225 Difference]: With dead ends: 131 [2018-11-14 16:50:54,020 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 16:50:54,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:50:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 16:50:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-14 16:50:54,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:54,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 86 states. [2018-11-14 16:50:54,052 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 86 states. [2018-11-14 16:50:54,052 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 86 states. [2018-11-14 16:50:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:54,055 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-14 16:50:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-14 16:50:54,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:54,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:54,055 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 89 states. [2018-11-14 16:50:54,056 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 89 states. [2018-11-14 16:50:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:54,057 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-14 16:50:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-14 16:50:54,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:54,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:54,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:54,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 16:50:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-14 16:50:54,060 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 72 [2018-11-14 16:50:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:54,060 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-14 16:50:54,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:50:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 16:50:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 16:50:54,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:54,062 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:54,062 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:54,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash -227983999, now seen corresponding path program 10 times [2018-11-14 16:50:54,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:54,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:54,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-14 16:50:54,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-14 16:50:54,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-14 16:50:54,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #81#return; {5288#true} is VALID [2018-11-14 16:50:54,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret10 := main(); {5288#true} is VALID [2018-11-14 16:50:54,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5290#(= main_~a~0 0)} is VALID [2018-11-14 16:50:54,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {5290#(= main_~a~0 0)} assume true; {5290#(= main_~a~0 0)} is VALID [2018-11-14 16:50:54,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {5290#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5290#(= main_~a~0 0)} is VALID [2018-11-14 16:50:54,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {5290#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:54,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~a~0 1)} assume true; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:54,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {5291#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:54,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {5291#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:54,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {5292#(<= main_~a~0 2)} assume true; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:54,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {5292#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:54,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {5292#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:54,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {5293#(<= main_~a~0 3)} assume true; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:54,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {5293#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:54,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {5293#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:54,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {5294#(<= main_~a~0 4)} assume true; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:54,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {5294#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:54,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {5294#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:54,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {5295#(<= main_~a~0 5)} assume true; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:54,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {5295#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:54,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {5295#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:54,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {5296#(<= main_~a~0 6)} assume true; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:54,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {5296#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:54,737 INFO L273 TraceCheckUtils]: 26: Hoare triple {5296#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:54,738 INFO L273 TraceCheckUtils]: 27: Hoare triple {5297#(<= main_~a~0 7)} assume true; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:54,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {5297#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:54,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {5297#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:54,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {5298#(<= main_~a~0 8)} assume true; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:54,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {5298#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:54,741 INFO L273 TraceCheckUtils]: 32: Hoare triple {5298#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:54,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {5299#(<= main_~a~0 9)} assume true; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:54,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {5299#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:54,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {5299#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5300#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:54,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#(<= main_~a~0 10)} assume true; {5300#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:54,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:54,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} havoc ~i~0;~i~0 := 0; {5289#false} is VALID [2018-11-14 16:50:54,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:54,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:54,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:54,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:54,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:54,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:54,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 65: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 66: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 67: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 68: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:54,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 72: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {5289#false} havoc ~x~0;~x~0 := 0; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {5289#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L256 TraceCheckUtils]: 77: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {5289#false} is VALID [2018-11-14 16:50:54,750 INFO L273 TraceCheckUtils]: 78: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-14 16:50:54,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {5289#false} assume ~cond == 0; {5289#false} is VALID [2018-11-14 16:50:54,751 INFO L273 TraceCheckUtils]: 80: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-14 16:50:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:50:54,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:54,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:50:54,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:50:54,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:54,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:55,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-14 16:50:55,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-14 16:50:55,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-14 16:50:55,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #81#return; {5288#true} is VALID [2018-11-14 16:50:55,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret10 := main(); {5288#true} is VALID [2018-11-14 16:50:55,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5319#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:55,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {5319#(<= main_~a~0 0)} assume true; {5319#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:55,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {5319#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5319#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:55,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {5319#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:55,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~a~0 1)} assume true; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:55,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {5291#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5291#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:55,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {5291#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:55,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {5292#(<= main_~a~0 2)} assume true; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:55,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {5292#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5292#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:55,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {5292#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:55,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {5293#(<= main_~a~0 3)} assume true; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:55,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {5293#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5293#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:55,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {5293#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:55,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {5294#(<= main_~a~0 4)} assume true; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:55,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {5294#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5294#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:55,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {5294#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:55,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {5295#(<= main_~a~0 5)} assume true; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:55,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {5295#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5295#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:55,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {5295#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:55,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {5296#(<= main_~a~0 6)} assume true; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:55,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {5296#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5296#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:55,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {5296#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:55,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {5297#(<= main_~a~0 7)} assume true; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:55,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {5297#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5297#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:55,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {5297#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:55,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {5298#(<= main_~a~0 8)} assume true; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:55,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {5298#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5298#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:55,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {5298#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:55,150 INFO L273 TraceCheckUtils]: 33: Hoare triple {5299#(<= main_~a~0 9)} assume true; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:55,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {5299#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5299#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:55,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {5299#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5300#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:55,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#(<= main_~a~0 10)} assume true; {5300#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:55,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:55,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} havoc ~i~0;~i~0 := 0; {5289#false} is VALID [2018-11-14 16:50:55,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:55,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:55,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:55,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:55,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:55,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:55,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:55,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {5289#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-14 16:50:55,156 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 59: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 63: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:55,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 69: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {5289#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {5289#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 72: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 73: Hoare triple {5289#false} assume !(~i~0 < 100000); {5289#false} is VALID [2018-11-14 16:50:55,158 INFO L273 TraceCheckUtils]: 74: Hoare triple {5289#false} havoc ~x~0;~x~0 := 0; {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {5289#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L256 TraceCheckUtils]: 77: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L273 TraceCheckUtils]: 78: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L273 TraceCheckUtils]: 79: Hoare triple {5289#false} assume ~cond == 0; {5289#false} is VALID [2018-11-14 16:50:55,159 INFO L273 TraceCheckUtils]: 80: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-14 16:50:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:50:55,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:55,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:50:55,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-14 16:50:55,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:55,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:50:55,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:55,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:50:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:50:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:50:55,242 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 14 states. [2018-11-14 16:50:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:55,551 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-11-14 16:50:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:50:55,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-14 16:50:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:50:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-14 16:50:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:50:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-14 16:50:55,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 88 transitions. [2018-11-14 16:50:56,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:50:56,041 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:50:56,044 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 16:50:56,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:50:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 16:50:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-14 16:50:56,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:56,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-14 16:50:56,084 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-14 16:50:56,084 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-14 16:50:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:56,085 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-11-14 16:50:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-14 16:50:56,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:56,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:56,086 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-14 16:50:56,086 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-14 16:50:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:56,088 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-11-14 16:50:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-14 16:50:56,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:56,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:56,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:56,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 16:50:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-11-14 16:50:56,090 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 81 [2018-11-14 16:50:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-11-14 16:50:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:50:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-14 16:50:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-14 16:50:56,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:56,092 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:50:56,092 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash -688059074, now seen corresponding path program 11 times [2018-11-14 16:50:56,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:56,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:57,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {6028#true} call ULTIMATE.init(); {6028#true} is VALID [2018-11-14 16:50:57,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {6028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6028#true} is VALID [2018-11-14 16:50:57,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {6028#true} assume true; {6028#true} is VALID [2018-11-14 16:50:57,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6028#true} {6028#true} #81#return; {6028#true} is VALID [2018-11-14 16:50:57,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {6028#true} call #t~ret10 := main(); {6028#true} is VALID [2018-11-14 16:50:57,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {6028#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6030#(= main_~a~0 0)} is VALID [2018-11-14 16:50:57,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {6030#(= main_~a~0 0)} assume true; {6030#(= main_~a~0 0)} is VALID [2018-11-14 16:50:57,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {6030#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6030#(= main_~a~0 0)} is VALID [2018-11-14 16:50:57,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {6030#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:57,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {6031#(<= main_~a~0 1)} assume true; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:57,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {6031#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:57,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {6031#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:57,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~a~0 2)} assume true; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:57,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:57,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:57,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {6033#(<= main_~a~0 3)} assume true; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:57,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {6033#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:57,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {6033#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:57,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {6034#(<= main_~a~0 4)} assume true; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:57,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {6034#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:57,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {6034#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:57,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {6035#(<= main_~a~0 5)} assume true; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:57,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {6035#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:57,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {6035#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:57,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {6036#(<= main_~a~0 6)} assume true; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:57,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {6036#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:50:57,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {6036#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:57,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {6037#(<= main_~a~0 7)} assume true; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:57,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {6037#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:50:57,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {6037#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:57,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {6038#(<= main_~a~0 8)} assume true; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:57,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {6038#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:50:57,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {6038#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:57,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {6039#(<= main_~a~0 9)} assume true; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:57,351 INFO L273 TraceCheckUtils]: 34: Hoare triple {6039#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:50:57,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {6039#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:57,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {6040#(<= main_~a~0 10)} assume true; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:57,352 INFO L273 TraceCheckUtils]: 37: Hoare triple {6040#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:50:57,353 INFO L273 TraceCheckUtils]: 38: Hoare triple {6040#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6041#(<= main_~a~0 11)} is VALID [2018-11-14 16:50:57,354 INFO L273 TraceCheckUtils]: 39: Hoare triple {6041#(<= main_~a~0 11)} assume true; {6041#(<= main_~a~0 11)} is VALID [2018-11-14 16:50:57,354 INFO L273 TraceCheckUtils]: 40: Hoare triple {6041#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6029#false} is VALID [2018-11-14 16:50:57,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {6029#false} havoc ~i~0;~i~0 := 0; {6029#false} is VALID [2018-11-14 16:50:57,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,355 INFO L273 TraceCheckUtils]: 43: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:50:57,355 INFO L273 TraceCheckUtils]: 44: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:50:57,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 46: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 47: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 50: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:50:57,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:50:57,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:50:57,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:50:57,357 INFO L273 TraceCheckUtils]: 56: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:50:57,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,358 INFO L273 TraceCheckUtils]: 58: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-14 16:50:57,358 INFO L273 TraceCheckUtils]: 59: Hoare triple {6029#false} ~i~0 := 0; {6029#false} is VALID [2018-11-14 16:50:57,358 INFO L273 TraceCheckUtils]: 60: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,358 INFO L273 TraceCheckUtils]: 61: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 62: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 63: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 64: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 65: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 66: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 67: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:50:57,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 69: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 70: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 71: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 73: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,360 INFO L273 TraceCheckUtils]: 76: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {6029#false} havoc ~x~0;~x~0 := 0; {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 78: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 79: Hoare triple {6029#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L256 TraceCheckUtils]: 80: Hoare triple {6029#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 81: Hoare triple {6029#false} ~cond := #in~cond; {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 82: Hoare triple {6029#false} assume ~cond == 0; {6029#false} is VALID [2018-11-14 16:50:57,361 INFO L273 TraceCheckUtils]: 83: Hoare triple {6029#false} assume !false; {6029#false} is VALID [2018-11-14 16:50:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:50:57,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:57,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:50:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:51:23,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:51:23,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:23,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:23,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {6028#true} call ULTIMATE.init(); {6028#true} is VALID [2018-11-14 16:51:23,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {6028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6028#true} is VALID [2018-11-14 16:51:23,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {6028#true} assume true; {6028#true} is VALID [2018-11-14 16:51:23,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6028#true} {6028#true} #81#return; {6028#true} is VALID [2018-11-14 16:51:23,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {6028#true} call #t~ret10 := main(); {6028#true} is VALID [2018-11-14 16:51:23,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {6028#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6060#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:23,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#(<= main_~a~0 0)} assume true; {6060#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:23,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6060#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:23,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {6060#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:23,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {6031#(<= main_~a~0 1)} assume true; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:23,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {6031#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6031#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:23,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {6031#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:23,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~a~0 2)} assume true; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:23,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6032#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:23,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:23,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {6033#(<= main_~a~0 3)} assume true; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:23,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {6033#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6033#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:23,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {6033#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:23,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {6034#(<= main_~a~0 4)} assume true; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:23,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {6034#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6034#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:23,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {6034#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:23,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {6035#(<= main_~a~0 5)} assume true; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:23,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {6035#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6035#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:23,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {6035#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:23,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {6036#(<= main_~a~0 6)} assume true; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:23,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {6036#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6036#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:23,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {6036#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:23,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {6037#(<= main_~a~0 7)} assume true; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:23,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {6037#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6037#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:23,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {6037#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:23,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {6038#(<= main_~a~0 8)} assume true; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:23,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {6038#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6038#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:23,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {6038#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:23,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {6039#(<= main_~a~0 9)} assume true; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:23,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {6039#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6039#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:23,586 INFO L273 TraceCheckUtils]: 35: Hoare triple {6039#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:23,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {6040#(<= main_~a~0 10)} assume true; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:23,587 INFO L273 TraceCheckUtils]: 37: Hoare triple {6040#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6040#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:23,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {6040#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6041#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:23,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {6041#(<= main_~a~0 11)} assume true; {6041#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:23,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {6041#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6029#false} is VALID [2018-11-14 16:51:23,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {6029#false} havoc ~i~0;~i~0 := 0; {6029#false} is VALID [2018-11-14 16:51:23,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:51:23,590 INFO L273 TraceCheckUtils]: 44: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:51:23,590 INFO L273 TraceCheckUtils]: 45: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,591 INFO L273 TraceCheckUtils]: 46: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:51:23,591 INFO L273 TraceCheckUtils]: 47: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:51:23,591 INFO L273 TraceCheckUtils]: 48: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,591 INFO L273 TraceCheckUtils]: 49: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:51:23,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 53: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 54: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {6029#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 57: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,592 INFO L273 TraceCheckUtils]: 58: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 59: Hoare triple {6029#false} ~i~0 := 0; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 60: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 61: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 62: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 63: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 64: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 65: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 66: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 68: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 69: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 70: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 71: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 72: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 73: Hoare triple {6029#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6029#false} is VALID [2018-11-14 16:51:23,594 INFO L273 TraceCheckUtils]: 74: Hoare triple {6029#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L273 TraceCheckUtils]: 75: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L273 TraceCheckUtils]: 76: Hoare triple {6029#false} assume !(~i~0 < 100000); {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L273 TraceCheckUtils]: 77: Hoare triple {6029#false} havoc ~x~0;~x~0 := 0; {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L273 TraceCheckUtils]: 78: Hoare triple {6029#false} assume true; {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L273 TraceCheckUtils]: 79: Hoare triple {6029#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6029#false} is VALID [2018-11-14 16:51:23,595 INFO L256 TraceCheckUtils]: 80: Hoare triple {6029#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6029#false} is VALID [2018-11-14 16:51:23,596 INFO L273 TraceCheckUtils]: 81: Hoare triple {6029#false} ~cond := #in~cond; {6029#false} is VALID [2018-11-14 16:51:23,596 INFO L273 TraceCheckUtils]: 82: Hoare triple {6029#false} assume ~cond == 0; {6029#false} is VALID [2018-11-14 16:51:23,596 INFO L273 TraceCheckUtils]: 83: Hoare triple {6029#false} assume !false; {6029#false} is VALID [2018-11-14 16:51:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:51:23,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:23,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:51:23,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-14 16:51:23,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:23,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:51:23,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:23,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:51:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:51:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:51:23,692 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 15 states. [2018-11-14 16:51:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:24,360 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-14 16:51:24,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:51:24,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-14 16:51:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:51:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-14 16:51:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:51:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-14 16:51:24,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2018-11-14 16:51:24,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:24,879 INFO L225 Difference]: With dead ends: 141 [2018-11-14 16:51:24,879 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 16:51:24,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:51:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 16:51:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 16:51:24,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:24,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 16:51:24,906 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 16:51:24,906 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 16:51:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:24,908 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-14 16:51:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-14 16:51:24,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:24,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:24,909 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 16:51:24,909 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 16:51:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:24,911 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-14 16:51:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-14 16:51:24,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:24,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:24,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:24,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:51:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-14 16:51:24,914 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 84 [2018-11-14 16:51:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:24,914 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-14 16:51:24,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:51:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:51:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 16:51:24,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:24,916 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:24,916 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:24,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1543976863, now seen corresponding path program 12 times [2018-11-14 16:51:24,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:24,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:24,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:25,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {6792#true} call ULTIMATE.init(); {6792#true} is VALID [2018-11-14 16:51:25,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {6792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6792#true} is VALID [2018-11-14 16:51:25,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:25,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6792#true} {6792#true} #81#return; {6792#true} is VALID [2018-11-14 16:51:25,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {6792#true} call #t~ret10 := main(); {6792#true} is VALID [2018-11-14 16:51:25,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {6792#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6794#(= main_~a~0 0)} is VALID [2018-11-14 16:51:25,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {6794#(= main_~a~0 0)} assume true; {6794#(= main_~a~0 0)} is VALID [2018-11-14 16:51:25,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {6794#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6794#(= main_~a~0 0)} is VALID [2018-11-14 16:51:25,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {6794#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6795#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:25,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {6795#(<= main_~a~0 1)} assume true; {6795#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:25,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {6795#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6795#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:25,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {6795#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6796#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:25,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {6796#(<= main_~a~0 2)} assume true; {6796#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:25,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {6796#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6796#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:25,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {6796#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6797#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:25,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {6797#(<= main_~a~0 3)} assume true; {6797#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:25,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {6797#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6797#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:25,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {6797#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6798#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:25,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {6798#(<= main_~a~0 4)} assume true; {6798#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:25,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {6798#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6798#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:25,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {6798#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6799#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:25,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {6799#(<= main_~a~0 5)} assume true; {6799#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:25,599 INFO L273 TraceCheckUtils]: 22: Hoare triple {6799#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6799#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:25,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {6799#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6800#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:25,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {6800#(<= main_~a~0 6)} assume true; {6800#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:25,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {6800#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6800#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:25,601 INFO L273 TraceCheckUtils]: 26: Hoare triple {6800#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6801#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:25,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {6801#(<= main_~a~0 7)} assume true; {6801#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:25,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {6801#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6801#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:25,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {6801#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6802#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:25,604 INFO L273 TraceCheckUtils]: 30: Hoare triple {6802#(<= main_~a~0 8)} assume true; {6802#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:25,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {6802#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6802#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:25,605 INFO L273 TraceCheckUtils]: 32: Hoare triple {6802#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6803#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:25,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {6803#(<= main_~a~0 9)} assume true; {6803#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:25,606 INFO L273 TraceCheckUtils]: 34: Hoare triple {6803#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6803#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:25,607 INFO L273 TraceCheckUtils]: 35: Hoare triple {6803#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6804#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:25,607 INFO L273 TraceCheckUtils]: 36: Hoare triple {6804#(<= main_~a~0 10)} assume true; {6804#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:25,608 INFO L273 TraceCheckUtils]: 37: Hoare triple {6804#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6804#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:25,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {6804#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6805#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:25,609 INFO L273 TraceCheckUtils]: 39: Hoare triple {6805#(<= main_~a~0 11)} assume true; {6805#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:25,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {6805#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6805#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:25,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {6805#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6806#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:25,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {6806#(<= main_~a~0 12)} assume true; {6806#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:25,612 INFO L273 TraceCheckUtils]: 43: Hoare triple {6806#(<= main_~a~0 12)} assume !(~a~0 < 100000); {6793#false} is VALID [2018-11-14 16:51:25,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {6793#false} havoc ~i~0;~i~0 := 0; {6793#false} is VALID [2018-11-14 16:51:25,612 INFO L273 TraceCheckUtils]: 45: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,612 INFO L273 TraceCheckUtils]: 46: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6793#false} is VALID [2018-11-14 16:51:25,613 INFO L273 TraceCheckUtils]: 47: Hoare triple {6793#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6793#false} is VALID [2018-11-14 16:51:25,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6793#false} is VALID [2018-11-14 16:51:25,613 INFO L273 TraceCheckUtils]: 50: Hoare triple {6793#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6793#false} is VALID [2018-11-14 16:51:25,613 INFO L273 TraceCheckUtils]: 51: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,614 INFO L273 TraceCheckUtils]: 52: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6793#false} is VALID [2018-11-14 16:51:25,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {6793#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6793#false} is VALID [2018-11-14 16:51:25,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,614 INFO L273 TraceCheckUtils]: 55: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6793#false} is VALID [2018-11-14 16:51:25,614 INFO L273 TraceCheckUtils]: 56: Hoare triple {6793#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6793#false} is VALID [2018-11-14 16:51:25,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,615 INFO L273 TraceCheckUtils]: 58: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6793#false} is VALID [2018-11-14 16:51:25,615 INFO L273 TraceCheckUtils]: 59: Hoare triple {6793#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6793#false} is VALID [2018-11-14 16:51:25,615 INFO L273 TraceCheckUtils]: 60: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-14 16:51:25,616 INFO L273 TraceCheckUtils]: 62: Hoare triple {6793#false} ~i~0 := 0; {6793#false} is VALID [2018-11-14 16:51:25,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,616 INFO L273 TraceCheckUtils]: 64: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:25,616 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:25,616 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 71: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 72: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 73: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:25,617 INFO L273 TraceCheckUtils]: 74: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {6793#false} havoc ~x~0;~x~0 := 0; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 81: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L273 TraceCheckUtils]: 82: Hoare triple {6793#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6793#false} is VALID [2018-11-14 16:51:25,618 INFO L256 TraceCheckUtils]: 83: Hoare triple {6793#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6793#false} is VALID [2018-11-14 16:51:25,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {6793#false} ~cond := #in~cond; {6793#false} is VALID [2018-11-14 16:51:25,619 INFO L273 TraceCheckUtils]: 85: Hoare triple {6793#false} assume ~cond == 0; {6793#false} is VALID [2018-11-14 16:51:25,619 INFO L273 TraceCheckUtils]: 86: Hoare triple {6793#false} assume !false; {6793#false} is VALID [2018-11-14 16:51:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:51:25,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:25,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:51:30,844 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 16:51:30,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:30,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:31,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {6792#true} call ULTIMATE.init(); {6792#true} is VALID [2018-11-14 16:51:31,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {6792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6792#true} is VALID [2018-11-14 16:51:31,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6792#true} {6792#true} #81#return; {6792#true} is VALID [2018-11-14 16:51:31,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6792#true} call #t~ret10 := main(); {6792#true} is VALID [2018-11-14 16:51:31,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {6792#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6792#true} is VALID [2018-11-14 16:51:31,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6792#true} is VALID [2018-11-14 16:51:31,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {6792#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6792#true} is VALID [2018-11-14 16:51:31,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {6792#true} assume true; {6792#true} is VALID [2018-11-14 16:51:31,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {6792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6930#(< main_~a~0 100000)} is VALID [2018-11-14 16:51:31,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {6930#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6934#(<= main_~a~0 100000)} is VALID [2018-11-14 16:51:31,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {6934#(<= main_~a~0 100000)} assume true; {6934#(<= main_~a~0 100000)} is VALID [2018-11-14 16:51:31,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {6934#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {6792#true} is VALID [2018-11-14 16:51:31,119 INFO L273 TraceCheckUtils]: 44: Hoare triple {6792#true} havoc ~i~0;~i~0 := 0; {6944#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:31,119 INFO L273 TraceCheckUtils]: 45: Hoare triple {6944#(<= main_~i~0 0)} assume true; {6944#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:31,119 INFO L273 TraceCheckUtils]: 46: Hoare triple {6944#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6944#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:31,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {6944#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6954#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:31,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {6954#(<= main_~i~0 1)} assume true; {6954#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:31,120 INFO L273 TraceCheckUtils]: 49: Hoare triple {6954#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6954#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:31,121 INFO L273 TraceCheckUtils]: 50: Hoare triple {6954#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6964#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:31,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {6964#(<= main_~i~0 2)} assume true; {6964#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:31,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {6964#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6964#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:31,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {6964#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6974#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:31,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {6974#(<= main_~i~0 3)} assume true; {6974#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:31,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {6974#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6974#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:31,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {6974#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6984#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:31,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {6984#(<= main_~i~0 4)} assume true; {6984#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:31,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {6984#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6984#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:31,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {6984#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6994#(<= main_~i~0 5)} is VALID [2018-11-14 16:51:31,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {6994#(<= main_~i~0 5)} assume true; {6994#(<= main_~i~0 5)} is VALID [2018-11-14 16:51:31,127 INFO L273 TraceCheckUtils]: 61: Hoare triple {6994#(<= main_~i~0 5)} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-14 16:51:31,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {6793#false} ~i~0 := 0; {6793#false} is VALID [2018-11-14 16:51:31,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:31,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:31,129 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:31,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:31,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:31,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:31,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,130 INFO L273 TraceCheckUtils]: 73: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:31,130 INFO L273 TraceCheckUtils]: 74: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:31,130 INFO L273 TraceCheckUtils]: 75: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {6793#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6793#false} is VALID [2018-11-14 16:51:31,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {6793#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6793#false} is VALID [2018-11-14 16:51:31,131 INFO L273 TraceCheckUtils]: 78: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,131 INFO L273 TraceCheckUtils]: 79: Hoare triple {6793#false} assume !(~i~0 < 100000); {6793#false} is VALID [2018-11-14 16:51:31,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {6793#false} havoc ~x~0;~x~0 := 0; {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {6793#false} assume true; {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {6793#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L256 TraceCheckUtils]: 83: Hoare triple {6793#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {6793#false} ~cond := #in~cond; {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L273 TraceCheckUtils]: 85: Hoare triple {6793#false} assume ~cond == 0; {6793#false} is VALID [2018-11-14 16:51:31,132 INFO L273 TraceCheckUtils]: 86: Hoare triple {6793#false} assume !false; {6793#false} is VALID [2018-11-14 16:51:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 35 proven. 40 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-11-14 16:51:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-14 16:51:31,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-11-14 16:51:31,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:31,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:51:31,307 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 16:51:31,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:51:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:51:31,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:51:31,309 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 23 states. [2018-11-14 16:51:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:32,508 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-11-14 16:51:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 16:51:32,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-11-14 16:51:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:51:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 135 transitions. [2018-11-14 16:51:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:51:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 135 transitions. [2018-11-14 16:51:32,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 135 transitions. [2018-11-14 16:51:32,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:32,645 INFO L225 Difference]: With dead ends: 154 [2018-11-14 16:51:32,645 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 16:51:32,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:51:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 16:51:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-14 16:51:32,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:32,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-14 16:51:32,683 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-14 16:51:32,683 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-14 16:51:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:32,686 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-14 16:51:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-14 16:51:32,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:32,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:32,687 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-14 16:51:32,687 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-14 16:51:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:32,690 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-14 16:51:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-14 16:51:32,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:32,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:32,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:32,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:51:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-14 16:51:32,693 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 87 [2018-11-14 16:51:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:32,693 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-14 16:51:32,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:51:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-14 16:51:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 16:51:32,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:32,695 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:32,695 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:32,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:32,695 INFO L82 PathProgramCache]: Analyzing trace with hash -309112028, now seen corresponding path program 13 times [2018-11-14 16:51:32,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:32,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:33,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {7644#true} call ULTIMATE.init(); {7644#true} is VALID [2018-11-14 16:51:33,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {7644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7644#true} is VALID [2018-11-14 16:51:33,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {7644#true} assume true; {7644#true} is VALID [2018-11-14 16:51:33,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7644#true} {7644#true} #81#return; {7644#true} is VALID [2018-11-14 16:51:33,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {7644#true} call #t~ret10 := main(); {7644#true} is VALID [2018-11-14 16:51:33,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {7644#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7646#(= main_~a~0 0)} is VALID [2018-11-14 16:51:33,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {7646#(= main_~a~0 0)} assume true; {7646#(= main_~a~0 0)} is VALID [2018-11-14 16:51:33,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {7646#(= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7646#(= main_~a~0 0)} is VALID [2018-11-14 16:51:33,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {7646#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {7647#(<= main_~a~0 1)} assume true; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {7647#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {7647#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {7648#(<= main_~a~0 2)} assume true; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {7648#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {7648#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {7649#(<= main_~a~0 3)} assume true; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {7649#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {7649#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {7650#(<= main_~a~0 4)} assume true; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {7650#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {7650#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {7651#(<= main_~a~0 5)} assume true; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {7651#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {7651#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {7652#(<= main_~a~0 6)} assume true; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {7652#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {7652#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {7653#(<= main_~a~0 7)} assume true; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,443 INFO L273 TraceCheckUtils]: 28: Hoare triple {7653#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,444 INFO L273 TraceCheckUtils]: 29: Hoare triple {7653#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {7654#(<= main_~a~0 8)} assume true; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {7654#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {7654#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {7655#(<= main_~a~0 9)} assume true; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {7655#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {7655#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {7656#(<= main_~a~0 10)} assume true; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {7656#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {7656#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {7657#(<= main_~a~0 11)} assume true; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,451 INFO L273 TraceCheckUtils]: 40: Hoare triple {7657#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,452 INFO L273 TraceCheckUtils]: 41: Hoare triple {7657#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {7658#(<= main_~a~0 12)} assume true; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {7658#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {7658#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {7659#(<= main_~a~0 13)} assume true; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,455 INFO L273 TraceCheckUtils]: 46: Hoare triple {7659#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {7659#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7660#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:33,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {7660#(<= main_~a~0 14)} assume true; {7660#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:33,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {7660#(<= main_~a~0 14)} assume !(~a~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {7645#false} havoc ~i~0;~i~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,459 INFO L273 TraceCheckUtils]: 54: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,460 INFO L273 TraceCheckUtils]: 57: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,460 INFO L273 TraceCheckUtils]: 58: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,460 INFO L273 TraceCheckUtils]: 60: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,461 INFO L273 TraceCheckUtils]: 62: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,461 INFO L273 TraceCheckUtils]: 64: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 65: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 66: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 67: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 68: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 69: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 70: Hoare triple {7645#false} assume !(~i~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,462 INFO L273 TraceCheckUtils]: 71: Hoare triple {7645#false} ~i~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 72: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 73: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 74: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 75: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 76: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 77: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,463 INFO L273 TraceCheckUtils]: 78: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 79: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 80: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 81: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 82: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,464 INFO L273 TraceCheckUtils]: 84: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 87: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 88: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 89: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 90: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,465 INFO L273 TraceCheckUtils]: 91: Hoare triple {7645#false} assume !(~i~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 92: Hoare triple {7645#false} havoc ~x~0;~x~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 93: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 94: Hoare triple {7645#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L256 TraceCheckUtils]: 95: Hoare triple {7645#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 96: Hoare triple {7645#false} ~cond := #in~cond; {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 97: Hoare triple {7645#false} assume ~cond == 0; {7645#false} is VALID [2018-11-14 16:51:33,466 INFO L273 TraceCheckUtils]: 98: Hoare triple {7645#false} assume !false; {7645#false} is VALID [2018-11-14 16:51:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:51:33,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:33,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:33,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:33,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {7644#true} call ULTIMATE.init(); {7644#true} is VALID [2018-11-14 16:51:33,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {7644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7644#true} is VALID [2018-11-14 16:51:33,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {7644#true} assume true; {7644#true} is VALID [2018-11-14 16:51:33,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7644#true} {7644#true} #81#return; {7644#true} is VALID [2018-11-14 16:51:33,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {7644#true} call #t~ret10 := main(); {7644#true} is VALID [2018-11-14 16:51:33,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {7644#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7679#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:33,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {7679#(<= main_~a~0 0)} assume true; {7679#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:33,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {7679#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7679#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:33,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {7679#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {7647#(<= main_~a~0 1)} assume true; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {7647#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7647#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:33,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {7647#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {7648#(<= main_~a~0 2)} assume true; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {7648#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7648#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:33,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {7648#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {7649#(<= main_~a~0 3)} assume true; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {7649#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7649#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:33,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {7649#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {7650#(<= main_~a~0 4)} assume true; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {7650#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7650#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:33,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {7650#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {7651#(<= main_~a~0 5)} assume true; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {7651#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7651#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:33,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {7651#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {7652#(<= main_~a~0 6)} assume true; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {7652#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7652#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:33,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {7652#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {7653#(<= main_~a~0 7)} assume true; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,919 INFO L273 TraceCheckUtils]: 28: Hoare triple {7653#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7653#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:33,920 INFO L273 TraceCheckUtils]: 29: Hoare triple {7653#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {7654#(<= main_~a~0 8)} assume true; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {7654#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7654#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:33,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {7654#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {7655#(<= main_~a~0 9)} assume true; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {7655#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7655#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:33,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {7655#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {7656#(<= main_~a~0 10)} assume true; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {7656#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7656#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:33,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {7656#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {7657#(<= main_~a~0 11)} assume true; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {7657#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7657#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:33,929 INFO L273 TraceCheckUtils]: 41: Hoare triple {7657#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {7658#(<= main_~a~0 12)} assume true; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {7658#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7658#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:33,931 INFO L273 TraceCheckUtils]: 44: Hoare triple {7658#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {7659#(<= main_~a~0 13)} assume true; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {7659#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7659#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:33,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {7659#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7660#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:33,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {7660#(<= main_~a~0 14)} assume true; {7660#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:33,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {7660#(<= main_~a~0 14)} assume !(~a~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {7645#false} havoc ~i~0;~i~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,935 INFO L273 TraceCheckUtils]: 53: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,936 INFO L273 TraceCheckUtils]: 54: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,936 INFO L273 TraceCheckUtils]: 55: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,936 INFO L273 TraceCheckUtils]: 56: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,936 INFO L273 TraceCheckUtils]: 57: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 59: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 60: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 61: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 62: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 63: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 66: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {7645#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {7645#false} assume !(~i~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {7645#false} ~i~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,939 INFO L273 TraceCheckUtils]: 72: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,939 INFO L273 TraceCheckUtils]: 74: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,939 INFO L273 TraceCheckUtils]: 75: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,940 INFO L273 TraceCheckUtils]: 76: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,940 INFO L273 TraceCheckUtils]: 77: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,940 INFO L273 TraceCheckUtils]: 78: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,940 INFO L273 TraceCheckUtils]: 79: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,940 INFO L273 TraceCheckUtils]: 80: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,941 INFO L273 TraceCheckUtils]: 81: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,941 INFO L273 TraceCheckUtils]: 82: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,941 INFO L273 TraceCheckUtils]: 83: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,941 INFO L273 TraceCheckUtils]: 84: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,941 INFO L273 TraceCheckUtils]: 85: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,942 INFO L273 TraceCheckUtils]: 86: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,942 INFO L273 TraceCheckUtils]: 87: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,942 INFO L273 TraceCheckUtils]: 88: Hoare triple {7645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7645#false} is VALID [2018-11-14 16:51:33,942 INFO L273 TraceCheckUtils]: 89: Hoare triple {7645#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7645#false} is VALID [2018-11-14 16:51:33,942 INFO L273 TraceCheckUtils]: 90: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,943 INFO L273 TraceCheckUtils]: 91: Hoare triple {7645#false} assume !(~i~0 < 100000); {7645#false} is VALID [2018-11-14 16:51:33,943 INFO L273 TraceCheckUtils]: 92: Hoare triple {7645#false} havoc ~x~0;~x~0 := 0; {7645#false} is VALID [2018-11-14 16:51:33,943 INFO L273 TraceCheckUtils]: 93: Hoare triple {7645#false} assume true; {7645#false} is VALID [2018-11-14 16:51:33,943 INFO L273 TraceCheckUtils]: 94: Hoare triple {7645#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {7645#false} is VALID [2018-11-14 16:51:33,943 INFO L256 TraceCheckUtils]: 95: Hoare triple {7645#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {7645#false} is VALID [2018-11-14 16:51:33,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {7645#false} ~cond := #in~cond; {7645#false} is VALID [2018-11-14 16:51:33,944 INFO L273 TraceCheckUtils]: 97: Hoare triple {7645#false} assume ~cond == 0; {7645#false} is VALID [2018-11-14 16:51:33,944 INFO L273 TraceCheckUtils]: 98: Hoare triple {7645#false} assume !false; {7645#false} is VALID [2018-11-14 16:51:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:51:33,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:51:33,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-11-14 16:51:33,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:33,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:51:34,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:34,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:51:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:51:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:51:34,060 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 18 states. [2018-11-14 16:51:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:34,602 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-14 16:51:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:51:34,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-11-14 16:51:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:51:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2018-11-14 16:51:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:51:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2018-11-14 16:51:34,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 100 transitions. [2018-11-14 16:51:34,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:34,726 INFO L225 Difference]: With dead ends: 162 [2018-11-14 16:51:34,726 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 16:51:34,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:51:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 16:51:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-14 16:51:34,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:34,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-14 16:51:34,904 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-14 16:51:34,904 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-14 16:51:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:34,906 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-14 16:51:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-14 16:51:34,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:34,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:34,907 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-14 16:51:34,907 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-14 16:51:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:34,909 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-14 16:51:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-14 16:51:34,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:34,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:34,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:34,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 16:51:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-14 16:51:34,912 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2018-11-14 16:51:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:34,913 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-14 16:51:34,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:51:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-14 16:51:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 16:51:34,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:34,914 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:34,914 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:34,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922527, now seen corresponding path program 14 times [2018-11-14 16:51:34,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:35,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {8534#true} call ULTIMATE.init(); {8534#true} is VALID [2018-11-14 16:51:35,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {8534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8534#true} is VALID [2018-11-14 16:51:35,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {8534#true} assume true; {8534#true} is VALID [2018-11-14 16:51:35,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8534#true} {8534#true} #81#return; {8534#true} is VALID [2018-11-14 16:51:35,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {8534#true} call #t~ret10 := main(); {8534#true} is VALID [2018-11-14 16:51:35,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {8534#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8536#(= main_~a~0 0)} is VALID [2018-11-14 16:51:35,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {8536#(= main_~a~0 0)} assume true; {8536#(= main_~a~0 0)} is VALID [2018-11-14 16:51:35,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {8536#(= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8536#(= main_~a~0 0)} is VALID [2018-11-14 16:51:35,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {8536#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:35,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {8537#(<= main_~a~0 1)} assume true; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:35,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {8537#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:35,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {8537#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:35,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {8538#(<= main_~a~0 2)} assume true; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:35,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {8538#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:35,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {8538#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:35,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {8539#(<= main_~a~0 3)} assume true; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:35,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {8539#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:35,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {8539#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:35,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {8540#(<= main_~a~0 4)} assume true; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:35,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {8540#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:35,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {8540#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:35,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {8541#(<= main_~a~0 5)} assume true; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:35,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {8541#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:35,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {8541#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:35,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {8542#(<= main_~a~0 6)} assume true; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:35,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {8542#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:35,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {8542#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:35,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {8543#(<= main_~a~0 7)} assume true; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:35,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {8543#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:35,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {8543#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:35,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {8544#(<= main_~a~0 8)} assume true; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:35,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {8544#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:35,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {8544#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:35,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {8545#(<= main_~a~0 9)} assume true; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:35,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:35,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {8545#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:35,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {8546#(<= main_~a~0 10)} assume true; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:35,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {8546#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:35,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {8546#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:35,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {8547#(<= main_~a~0 11)} assume true; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:35,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {8547#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:35,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {8547#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:35,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {8548#(<= main_~a~0 12)} assume true; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:35,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {8548#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:35,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {8548#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:35,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {8549#(<= main_~a~0 13)} assume true; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:35,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {8549#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:35,778 INFO L273 TraceCheckUtils]: 47: Hoare triple {8549#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:35,778 INFO L273 TraceCheckUtils]: 48: Hoare triple {8550#(<= main_~a~0 14)} assume true; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:35,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {8550#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:35,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {8550#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8551#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:35,780 INFO L273 TraceCheckUtils]: 51: Hoare triple {8551#(<= main_~a~0 15)} assume true; {8551#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:35,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {8551#(<= main_~a~0 15)} assume !(~a~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:35,781 INFO L273 TraceCheckUtils]: 53: Hoare triple {8535#false} havoc ~i~0;~i~0 := 0; {8535#false} is VALID [2018-11-14 16:51:35,781 INFO L273 TraceCheckUtils]: 54: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,781 INFO L273 TraceCheckUtils]: 55: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,781 INFO L273 TraceCheckUtils]: 56: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,784 INFO L273 TraceCheckUtils]: 68: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,784 INFO L273 TraceCheckUtils]: 70: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:35,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:35,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {8535#false} assume !(~i~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:35,785 INFO L273 TraceCheckUtils]: 74: Hoare triple {8535#false} ~i~0 := 0; {8535#false} is VALID [2018-11-14 16:51:35,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,785 INFO L273 TraceCheckUtils]: 76: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,785 INFO L273 TraceCheckUtils]: 77: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 78: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 79: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 80: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 83: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 84: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,786 INFO L273 TraceCheckUtils]: 85: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 86: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 87: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 88: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 89: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 90: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 91: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,787 INFO L273 TraceCheckUtils]: 94: Hoare triple {8535#false} assume !(~i~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 95: Hoare triple {8535#false} havoc ~x~0;~x~0 := 0; {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 96: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 97: Hoare triple {8535#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L256 TraceCheckUtils]: 98: Hoare triple {8535#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 99: Hoare triple {8535#false} ~cond := #in~cond; {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 100: Hoare triple {8535#false} assume ~cond == 0; {8535#false} is VALID [2018-11-14 16:51:35,788 INFO L273 TraceCheckUtils]: 101: Hoare triple {8535#false} assume !false; {8535#false} is VALID [2018-11-14 16:51:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:51:35,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:35,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:51:35,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:51:35,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:35,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:36,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {8534#true} call ULTIMATE.init(); {8534#true} is VALID [2018-11-14 16:51:36,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {8534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8534#true} is VALID [2018-11-14 16:51:36,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {8534#true} assume true; {8534#true} is VALID [2018-11-14 16:51:36,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8534#true} {8534#true} #81#return; {8534#true} is VALID [2018-11-14 16:51:36,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {8534#true} call #t~ret10 := main(); {8534#true} is VALID [2018-11-14 16:51:36,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {8534#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8570#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:36,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {8570#(<= main_~a~0 0)} assume true; {8570#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:36,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {8570#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8570#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:36,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {8570#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:36,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {8537#(<= main_~a~0 1)} assume true; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:36,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {8537#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8537#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:36,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {8537#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:36,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {8538#(<= main_~a~0 2)} assume true; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:36,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {8538#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8538#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:36,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {8538#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:36,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {8539#(<= main_~a~0 3)} assume true; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:36,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {8539#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8539#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:36,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {8539#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:36,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {8540#(<= main_~a~0 4)} assume true; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:36,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {8540#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8540#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:36,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {8540#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:36,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {8541#(<= main_~a~0 5)} assume true; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:36,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {8541#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8541#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:36,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {8541#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:36,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {8542#(<= main_~a~0 6)} assume true; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:36,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {8542#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8542#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:36,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {8542#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:36,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {8543#(<= main_~a~0 7)} assume true; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:36,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {8543#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8543#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:36,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {8543#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:36,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {8544#(<= main_~a~0 8)} assume true; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:36,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {8544#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8544#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:36,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {8544#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:36,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {8545#(<= main_~a~0 9)} assume true; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:36,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8545#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:36,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {8545#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:36,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {8546#(<= main_~a~0 10)} assume true; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:36,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {8546#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8546#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:36,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {8546#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:36,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {8547#(<= main_~a~0 11)} assume true; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:36,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {8547#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8547#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:36,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {8547#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:36,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {8548#(<= main_~a~0 12)} assume true; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:36,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {8548#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8548#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:36,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {8548#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:36,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {8549#(<= main_~a~0 13)} assume true; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:36,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {8549#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8549#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:36,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {8549#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:36,142 INFO L273 TraceCheckUtils]: 48: Hoare triple {8550#(<= main_~a~0 14)} assume true; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:36,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {8550#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8550#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:36,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {8550#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8551#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:36,144 INFO L273 TraceCheckUtils]: 51: Hoare triple {8551#(<= main_~a~0 15)} assume true; {8551#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:36,144 INFO L273 TraceCheckUtils]: 52: Hoare triple {8551#(<= main_~a~0 15)} assume !(~a~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:36,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {8535#false} havoc ~i~0;~i~0 := 0; {8535#false} is VALID [2018-11-14 16:51:36,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,147 INFO L273 TraceCheckUtils]: 66: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 68: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 69: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 71: Hoare triple {8535#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 72: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 73: Hoare triple {8535#false} assume !(~i~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 74: Hoare triple {8535#false} ~i~0 := 0; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 75: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 77: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 80: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 81: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 82: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 83: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,149 INFO L273 TraceCheckUtils]: 84: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 85: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 86: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 87: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 88: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 89: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 90: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 91: Hoare triple {8535#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 92: Hoare triple {8535#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8535#false} is VALID [2018-11-14 16:51:36,150 INFO L273 TraceCheckUtils]: 93: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 94: Hoare triple {8535#false} assume !(~i~0 < 100000); {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 95: Hoare triple {8535#false} havoc ~x~0;~x~0 := 0; {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 96: Hoare triple {8535#false} assume true; {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 97: Hoare triple {8535#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L256 TraceCheckUtils]: 98: Hoare triple {8535#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 99: Hoare triple {8535#false} ~cond := #in~cond; {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 100: Hoare triple {8535#false} assume ~cond == 0; {8535#false} is VALID [2018-11-14 16:51:36,151 INFO L273 TraceCheckUtils]: 101: Hoare triple {8535#false} assume !false; {8535#false} is VALID [2018-11-14 16:51:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:51:36,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:36,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 16:51:36,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2018-11-14 16:51:36,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:36,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:51:36,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:36,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:51:36,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:51:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:51:36,247 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 19 states. [2018-11-14 16:51:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:36,609 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2018-11-14 16:51:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:51:36,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2018-11-14 16:51:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:51:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 103 transitions. [2018-11-14 16:51:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:51:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 103 transitions. [2018-11-14 16:51:36,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 103 transitions. [2018-11-14 16:51:36,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:36,747 INFO L225 Difference]: With dead ends: 165 [2018-11-14 16:51:36,748 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 16:51:36,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:51:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 16:51:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-14 16:51:36,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:36,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 110 states. [2018-11-14 16:51:36,792 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 110 states. [2018-11-14 16:51:36,792 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 110 states. [2018-11-14 16:51:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:36,794 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-11-14 16:51:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-11-14 16:51:36,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:36,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:36,795 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 111 states. [2018-11-14 16:51:36,795 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 111 states. [2018-11-14 16:51:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:36,797 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-11-14 16:51:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-11-14 16:51:36,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:36,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:36,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:36,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 16:51:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-11-14 16:51:36,800 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 102 [2018-11-14 16:51:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:36,801 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-11-14 16:51:36,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:51:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-14 16:51:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 16:51:36,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:36,802 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:36,802 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:36,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash -953555452, now seen corresponding path program 15 times [2018-11-14 16:51:36,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:36,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:37,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {9448#true} call ULTIMATE.init(); {9448#true} is VALID [2018-11-14 16:51:37,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {9448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9448#true} is VALID [2018-11-14 16:51:37,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:37,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9448#true} {9448#true} #81#return; {9448#true} is VALID [2018-11-14 16:51:37,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {9448#true} call #t~ret10 := main(); {9448#true} is VALID [2018-11-14 16:51:37,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {9448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9450#(= main_~a~0 0)} is VALID [2018-11-14 16:51:37,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {9450#(= main_~a~0 0)} assume true; {9450#(= main_~a~0 0)} is VALID [2018-11-14 16:51:37,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {9450#(= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9450#(= main_~a~0 0)} is VALID [2018-11-14 16:51:37,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {9450#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9451#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:37,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {9451#(<= main_~a~0 1)} assume true; {9451#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:37,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {9451#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9451#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:37,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {9451#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9452#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:37,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {9452#(<= main_~a~0 2)} assume true; {9452#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:37,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {9452#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9452#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:37,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {9452#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9453#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:37,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {9453#(<= main_~a~0 3)} assume true; {9453#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:37,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {9453#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9453#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:37,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {9453#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9454#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:37,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {9454#(<= main_~a~0 4)} assume true; {9454#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:37,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {9454#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9454#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:37,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {9454#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9455#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:37,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {9455#(<= main_~a~0 5)} assume true; {9455#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:37,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {9455#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9455#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:37,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {9455#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9456#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:37,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {9456#(<= main_~a~0 6)} assume true; {9456#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:37,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {9456#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9456#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:37,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {9456#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9457#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:37,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {9457#(<= main_~a~0 7)} assume true; {9457#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:37,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {9457#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9457#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:37,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {9457#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9458#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:37,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {9458#(<= main_~a~0 8)} assume true; {9458#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:37,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {9458#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9458#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:37,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {9458#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9459#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:37,426 INFO L273 TraceCheckUtils]: 33: Hoare triple {9459#(<= main_~a~0 9)} assume true; {9459#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:37,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {9459#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9459#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:37,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {9459#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9460#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:37,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {9460#(<= main_~a~0 10)} assume true; {9460#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:37,429 INFO L273 TraceCheckUtils]: 37: Hoare triple {9460#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9460#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:37,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {9460#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9461#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:37,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {9461#(<= main_~a~0 11)} assume true; {9461#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:37,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {9461#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9461#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:37,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {9461#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9462#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:37,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {9462#(<= main_~a~0 12)} assume true; {9462#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:37,434 INFO L273 TraceCheckUtils]: 43: Hoare triple {9462#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9462#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:37,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {9462#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9463#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:37,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {9463#(<= main_~a~0 13)} assume true; {9463#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:37,436 INFO L273 TraceCheckUtils]: 46: Hoare triple {9463#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9463#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:37,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {9463#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9464#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:37,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {9464#(<= main_~a~0 14)} assume true; {9464#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:37,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {9464#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9464#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:37,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {9464#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9465#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:37,441 INFO L273 TraceCheckUtils]: 51: Hoare triple {9465#(<= main_~a~0 15)} assume true; {9465#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:37,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {9465#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9465#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:37,443 INFO L273 TraceCheckUtils]: 53: Hoare triple {9465#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9466#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:37,443 INFO L273 TraceCheckUtils]: 54: Hoare triple {9466#(<= main_~a~0 16)} assume true; {9466#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 55: Hoare triple {9466#(<= main_~a~0 16)} assume !(~a~0 < 100000); {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {9449#false} havoc ~i~0;~i~0 := 0; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 58: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 59: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,445 INFO L273 TraceCheckUtils]: 62: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 64: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 65: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 66: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 67: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 68: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 69: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 71: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 72: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 73: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 74: Hoare triple {9449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 75: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 76: Hoare triple {9449#false} assume !(~i~0 < 100000); {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 77: Hoare triple {9449#false} ~i~0 := 0; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 78: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 80: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 81: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 82: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 83: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 84: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 85: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 86: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 87: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,448 INFO L273 TraceCheckUtils]: 88: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 90: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 91: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 92: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 93: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 94: Hoare triple {9449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 95: Hoare triple {9449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 96: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,449 INFO L273 TraceCheckUtils]: 97: Hoare triple {9449#false} assume !(~i~0 < 100000); {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 98: Hoare triple {9449#false} havoc ~x~0;~x~0 := 0; {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 99: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 100: Hoare triple {9449#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L256 TraceCheckUtils]: 101: Hoare triple {9449#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {9449#false} ~cond := #in~cond; {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {9449#false} assume ~cond == 0; {9449#false} is VALID [2018-11-14 16:51:37,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {9449#false} assume !false; {9449#false} is VALID [2018-11-14 16:51:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:51:37,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:37,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:37,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:51:38,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 16:51:38,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:38,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:38,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {9448#true} call ULTIMATE.init(); {9448#true} is VALID [2018-11-14 16:51:38,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {9448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9448#true} is VALID [2018-11-14 16:51:38,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9448#true} {9448#true} #81#return; {9448#true} is VALID [2018-11-14 16:51:38,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {9448#true} call #t~ret10 := main(); {9448#true} is VALID [2018-11-14 16:51:38,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {9448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9448#true} is VALID [2018-11-14 16:51:38,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 42: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 43: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 49: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 51: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {9448#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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 53: Hoare triple {9448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 54: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {9448#true} assume !(~a~0 < 100000); {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 56: Hoare triple {9448#true} havoc ~i~0;~i~0 := 0; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 57: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 58: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 59: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 60: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 61: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 62: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,553 INFO L273 TraceCheckUtils]: 63: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 66: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 67: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 68: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 69: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 70: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 71: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,554 INFO L273 TraceCheckUtils]: 72: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,555 INFO L273 TraceCheckUtils]: 73: Hoare triple {9448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {9448#true} is VALID [2018-11-14 16:51:38,555 INFO L273 TraceCheckUtils]: 74: Hoare triple {9448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9448#true} is VALID [2018-11-14 16:51:38,555 INFO L273 TraceCheckUtils]: 75: Hoare triple {9448#true} assume true; {9448#true} is VALID [2018-11-14 16:51:38,555 INFO L273 TraceCheckUtils]: 76: Hoare triple {9448#true} assume !(~i~0 < 100000); {9448#true} is VALID [2018-11-14 16:51:38,555 INFO L273 TraceCheckUtils]: 77: Hoare triple {9448#true} ~i~0 := 0; {9701#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:38,556 INFO L273 TraceCheckUtils]: 78: Hoare triple {9701#(<= main_~i~0 0)} assume true; {9701#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:38,556 INFO L273 TraceCheckUtils]: 79: Hoare triple {9701#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9701#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:38,556 INFO L273 TraceCheckUtils]: 80: Hoare triple {9701#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9711#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:38,557 INFO L273 TraceCheckUtils]: 81: Hoare triple {9711#(<= main_~i~0 1)} assume true; {9711#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:38,557 INFO L273 TraceCheckUtils]: 82: Hoare triple {9711#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9711#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:38,557 INFO L273 TraceCheckUtils]: 83: Hoare triple {9711#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9721#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:38,558 INFO L273 TraceCheckUtils]: 84: Hoare triple {9721#(<= main_~i~0 2)} assume true; {9721#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:38,558 INFO L273 TraceCheckUtils]: 85: Hoare triple {9721#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9721#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:38,559 INFO L273 TraceCheckUtils]: 86: Hoare triple {9721#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9731#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:38,559 INFO L273 TraceCheckUtils]: 87: Hoare triple {9731#(<= main_~i~0 3)} assume true; {9731#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:38,560 INFO L273 TraceCheckUtils]: 88: Hoare triple {9731#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9731#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:38,561 INFO L273 TraceCheckUtils]: 89: Hoare triple {9731#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9741#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:38,561 INFO L273 TraceCheckUtils]: 90: Hoare triple {9741#(<= main_~i~0 4)} assume true; {9741#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:38,562 INFO L273 TraceCheckUtils]: 91: Hoare triple {9741#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9741#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:38,562 INFO L273 TraceCheckUtils]: 92: Hoare triple {9741#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9751#(<= main_~i~0 5)} is VALID [2018-11-14 16:51:38,563 INFO L273 TraceCheckUtils]: 93: Hoare triple {9751#(<= main_~i~0 5)} assume true; {9751#(<= main_~i~0 5)} is VALID [2018-11-14 16:51:38,563 INFO L273 TraceCheckUtils]: 94: Hoare triple {9751#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {9751#(<= main_~i~0 5)} is VALID [2018-11-14 16:51:38,564 INFO L273 TraceCheckUtils]: 95: Hoare triple {9751#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {9761#(<= main_~i~0 6)} is VALID [2018-11-14 16:51:38,565 INFO L273 TraceCheckUtils]: 96: Hoare triple {9761#(<= main_~i~0 6)} assume true; {9761#(<= main_~i~0 6)} is VALID [2018-11-14 16:51:38,565 INFO L273 TraceCheckUtils]: 97: Hoare triple {9761#(<= main_~i~0 6)} assume !(~i~0 < 100000); {9449#false} is VALID [2018-11-14 16:51:38,565 INFO L273 TraceCheckUtils]: 98: Hoare triple {9449#false} havoc ~x~0;~x~0 := 0; {9449#false} is VALID [2018-11-14 16:51:38,566 INFO L273 TraceCheckUtils]: 99: Hoare triple {9449#false} assume true; {9449#false} is VALID [2018-11-14 16:51:38,566 INFO L273 TraceCheckUtils]: 100: Hoare triple {9449#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {9449#false} is VALID [2018-11-14 16:51:38,566 INFO L256 TraceCheckUtils]: 101: Hoare triple {9449#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {9449#false} is VALID [2018-11-14 16:51:38,566 INFO L273 TraceCheckUtils]: 102: Hoare triple {9449#false} ~cond := #in~cond; {9449#false} is VALID [2018-11-14 16:51:38,566 INFO L273 TraceCheckUtils]: 103: Hoare triple {9449#false} assume ~cond == 0; {9449#false} is VALID [2018-11-14 16:51:38,567 INFO L273 TraceCheckUtils]: 104: Hoare triple {9449#false} assume !false; {9449#false} is VALID [2018-11-14 16:51:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-14 16:51:38,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:38,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2018-11-14 16:51:38,594 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-11-14 16:51:38,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:38,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:51:38,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:38,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:51:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:51:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:51:38,692 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 26 states. [2018-11-14 16:51:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:39,418 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-11-14 16:51:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 16:51:39,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-11-14 16:51:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:51:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 150 transitions. [2018-11-14 16:51:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:51:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 150 transitions. [2018-11-14 16:51:39,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 150 transitions. [2018-11-14 16:51:39,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:39,557 INFO L225 Difference]: With dead ends: 176 [2018-11-14 16:51:39,557 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:51:39,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:51:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:51:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-14 16:51:39,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:39,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 119 states. [2018-11-14 16:51:39,600 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 119 states. [2018-11-14 16:51:39,600 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 119 states. [2018-11-14 16:51:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:39,601 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-11-14 16:51:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:51:39,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:39,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:39,602 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 122 states. [2018-11-14 16:51:39,602 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 122 states. [2018-11-14 16:51:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:39,604 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-11-14 16:51:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:51:39,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:39,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:39,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:39,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 16:51:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-11-14 16:51:39,606 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 105 [2018-11-14 16:51:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:39,606 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-11-14 16:51:39,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:51:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-14 16:51:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-14 16:51:39,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:39,607 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:39,607 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:39,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1010521662, now seen corresponding path program 16 times [2018-11-14 16:51:39,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:39,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:40,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {10426#true} call ULTIMATE.init(); {10426#true} is VALID [2018-11-14 16:51:40,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {10426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10426#true} is VALID [2018-11-14 16:51:40,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {10426#true} assume true; {10426#true} is VALID [2018-11-14 16:51:40,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10426#true} {10426#true} #81#return; {10426#true} is VALID [2018-11-14 16:51:40,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {10426#true} call #t~ret10 := main(); {10426#true} is VALID [2018-11-14 16:51:40,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {10426#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10428#(= main_~a~0 0)} is VALID [2018-11-14 16:51:40,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {10428#(= main_~a~0 0)} assume true; {10428#(= main_~a~0 0)} is VALID [2018-11-14 16:51:40,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {10428#(= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10428#(= main_~a~0 0)} is VALID [2018-11-14 16:51:40,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {10428#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {10429#(<= main_~a~0 1)} assume true; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {10429#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {10429#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {10430#(<= main_~a~0 2)} assume true; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {10430#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {10430#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {10431#(<= main_~a~0 3)} assume true; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {10431#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {10431#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {10432#(<= main_~a~0 4)} assume true; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {10432#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {10432#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {10433#(<= main_~a~0 5)} assume true; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {10433#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {10433#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {10434#(<= main_~a~0 6)} assume true; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {10434#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {10434#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {10435#(<= main_~a~0 7)} assume true; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {10435#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {10435#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {10436#(<= main_~a~0 8)} assume true; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {10436#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {10436#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {10437#(<= main_~a~0 9)} assume true; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {10437#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {10437#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {10438#(<= main_~a~0 10)} assume true; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {10438#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {10438#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {10439#(<= main_~a~0 11)} assume true; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {10439#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {10439#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {10440#(<= main_~a~0 12)} assume true; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {10440#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {10440#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {10441#(<= main_~a~0 13)} assume true; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,027 INFO L273 TraceCheckUtils]: 46: Hoare triple {10441#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {10441#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,028 INFO L273 TraceCheckUtils]: 48: Hoare triple {10442#(<= main_~a~0 14)} assume true; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,029 INFO L273 TraceCheckUtils]: 49: Hoare triple {10442#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,030 INFO L273 TraceCheckUtils]: 50: Hoare triple {10442#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,030 INFO L273 TraceCheckUtils]: 51: Hoare triple {10443#(<= main_~a~0 15)} assume true; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,031 INFO L273 TraceCheckUtils]: 52: Hoare triple {10443#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,031 INFO L273 TraceCheckUtils]: 53: Hoare triple {10443#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {10444#(<= main_~a~0 16)} assume true; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {10444#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,033 INFO L273 TraceCheckUtils]: 56: Hoare triple {10444#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10445#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:40,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {10445#(<= main_~a~0 17)} assume true; {10445#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:40,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {10445#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {10427#false} havoc ~i~0;~i~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,035 INFO L273 TraceCheckUtils]: 63: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,036 INFO L273 TraceCheckUtils]: 64: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,036 INFO L273 TraceCheckUtils]: 65: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,036 INFO L273 TraceCheckUtils]: 67: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,037 INFO L273 TraceCheckUtils]: 69: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,037 INFO L273 TraceCheckUtils]: 70: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,037 INFO L273 TraceCheckUtils]: 71: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,037 INFO L273 TraceCheckUtils]: 73: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 75: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 76: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 77: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 78: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 79: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 80: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,038 INFO L273 TraceCheckUtils]: 81: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 82: Hoare triple {10427#false} assume !(~i~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {10427#false} ~i~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 84: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 85: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 86: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 87: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 88: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 89: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,039 INFO L273 TraceCheckUtils]: 90: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 91: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 92: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 93: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 94: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 95: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 96: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 97: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 98: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 100: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 101: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 102: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 103: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 104: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 105: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 106: Hoare triple {10427#false} assume !(~i~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 107: Hoare triple {10427#false} havoc ~x~0;~x~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,041 INFO L273 TraceCheckUtils]: 108: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,042 INFO L273 TraceCheckUtils]: 109: Hoare triple {10427#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {10427#false} is VALID [2018-11-14 16:51:40,042 INFO L256 TraceCheckUtils]: 110: Hoare triple {10427#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {10427#false} is VALID [2018-11-14 16:51:40,042 INFO L273 TraceCheckUtils]: 111: Hoare triple {10427#false} ~cond := #in~cond; {10427#false} is VALID [2018-11-14 16:51:40,042 INFO L273 TraceCheckUtils]: 112: Hoare triple {10427#false} assume ~cond == 0; {10427#false} is VALID [2018-11-14 16:51:40,042 INFO L273 TraceCheckUtils]: 113: Hoare triple {10427#false} assume !false; {10427#false} is VALID [2018-11-14 16:51:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-14 16:51:40,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:40,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:40,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:51:40,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:51:40,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:40,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:40,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {10426#true} call ULTIMATE.init(); {10426#true} is VALID [2018-11-14 16:51:40,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {10426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10426#true} is VALID [2018-11-14 16:51:40,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {10426#true} assume true; {10426#true} is VALID [2018-11-14 16:51:40,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10426#true} {10426#true} #81#return; {10426#true} is VALID [2018-11-14 16:51:40,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {10426#true} call #t~ret10 := main(); {10426#true} is VALID [2018-11-14 16:51:40,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {10426#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10464#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:40,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {10464#(<= main_~a~0 0)} assume true; {10464#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:40,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {10464#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10464#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:40,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {10464#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {10429#(<= main_~a~0 1)} assume true; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {10429#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10429#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:40,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {10429#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {10430#(<= main_~a~0 2)} assume true; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {10430#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10430#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:40,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {10430#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {10431#(<= main_~a~0 3)} assume true; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {10431#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10431#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:40,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {10431#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {10432#(<= main_~a~0 4)} assume true; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {10432#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10432#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:40,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {10432#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {10433#(<= main_~a~0 5)} assume true; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {10433#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10433#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:40,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {10433#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {10434#(<= main_~a~0 6)} assume true; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,450 INFO L273 TraceCheckUtils]: 25: Hoare triple {10434#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10434#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:40,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {10434#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {10435#(<= main_~a~0 7)} assume true; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {10435#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10435#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:40,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {10435#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {10436#(<= main_~a~0 8)} assume true; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {10436#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10436#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:40,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {10436#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {10437#(<= main_~a~0 9)} assume true; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {10437#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10437#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:40,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {10437#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {10438#(<= main_~a~0 10)} assume true; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {10438#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10438#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:40,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {10438#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {10439#(<= main_~a~0 11)} assume true; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {10439#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10439#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:40,460 INFO L273 TraceCheckUtils]: 41: Hoare triple {10439#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {10440#(<= main_~a~0 12)} assume true; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {10440#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10440#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:40,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {10440#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,463 INFO L273 TraceCheckUtils]: 45: Hoare triple {10441#(<= main_~a~0 13)} assume true; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,463 INFO L273 TraceCheckUtils]: 46: Hoare triple {10441#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10441#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:40,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {10441#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {10442#(<= main_~a~0 14)} assume true; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {10442#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10442#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:40,466 INFO L273 TraceCheckUtils]: 50: Hoare triple {10442#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {10443#(<= main_~a~0 15)} assume true; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,467 INFO L273 TraceCheckUtils]: 52: Hoare triple {10443#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10443#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:40,467 INFO L273 TraceCheckUtils]: 53: Hoare triple {10443#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {10444#(<= main_~a~0 16)} assume true; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,468 INFO L273 TraceCheckUtils]: 55: Hoare triple {10444#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10444#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:40,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {10444#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10445#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:40,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {10445#(<= main_~a~0 17)} assume true; {10445#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:40,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {10445#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,471 INFO L273 TraceCheckUtils]: 59: Hoare triple {10427#false} havoc ~i~0;~i~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,471 INFO L273 TraceCheckUtils]: 60: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,471 INFO L273 TraceCheckUtils]: 61: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 71: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 73: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 74: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 75: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,473 INFO L273 TraceCheckUtils]: 76: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 77: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 78: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 79: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 80: Hoare triple {10427#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {10427#false} assume !(~i~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 83: Hoare triple {10427#false} ~i~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 84: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,474 INFO L273 TraceCheckUtils]: 85: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 87: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 89: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 90: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 91: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 92: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 93: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,475 INFO L273 TraceCheckUtils]: 94: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 95: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 96: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 99: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 100: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 101: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 102: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,476 INFO L273 TraceCheckUtils]: 103: Hoare triple {10427#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {10427#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 106: Hoare triple {10427#false} assume !(~i~0 < 100000); {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 107: Hoare triple {10427#false} havoc ~x~0;~x~0 := 0; {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 108: Hoare triple {10427#false} assume true; {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 109: Hoare triple {10427#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L256 TraceCheckUtils]: 110: Hoare triple {10427#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {10427#false} is VALID [2018-11-14 16:51:40,477 INFO L273 TraceCheckUtils]: 111: Hoare triple {10427#false} ~cond := #in~cond; {10427#false} is VALID [2018-11-14 16:51:40,478 INFO L273 TraceCheckUtils]: 112: Hoare triple {10427#false} assume ~cond == 0; {10427#false} is VALID [2018-11-14 16:51:40,478 INFO L273 TraceCheckUtils]: 113: Hoare triple {10427#false} assume !false; {10427#false} is VALID [2018-11-14 16:51:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-14 16:51:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 16:51:40,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-11-14 16:51:40,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:40,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:51:40,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:40,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:51:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:51:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:51:40,582 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 21 states. [2018-11-14 16:51:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:41,276 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-11-14 16:51:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:51:41,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-11-14 16:51:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:51:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2018-11-14 16:51:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:51:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2018-11-14 16:51:41,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2018-11-14 16:51:41,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:41,387 INFO L225 Difference]: With dead ends: 183 [2018-11-14 16:51:41,387 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 16:51:41,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:51:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 16:51:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 16:51:41,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:41,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:41,431 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:41,431 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:41,434 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-11-14 16:51:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-11-14 16:51:41,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:41,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:41,434 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 16:51:41,435 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 16:51:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:41,437 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-11-14 16:51:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-11-14 16:51:41,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:41,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:41,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:41,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:51:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-11-14 16:51:41,440 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 114 [2018-11-14 16:51:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:41,440 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-11-14 16:51:41,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:51:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:51:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:51:41,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:41,441 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:51:41,442 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:41,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1175532065, now seen corresponding path program 17 times [2018-11-14 16:51:41,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:41,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:41,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:42,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {11442#true} call ULTIMATE.init(); {11442#true} is VALID [2018-11-14 16:51:42,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {11442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11442#true} is VALID [2018-11-14 16:51:42,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {11442#true} assume true; {11442#true} is VALID [2018-11-14 16:51:42,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11442#true} {11442#true} #81#return; {11442#true} is VALID [2018-11-14 16:51:42,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {11442#true} call #t~ret10 := main(); {11442#true} is VALID [2018-11-14 16:51:42,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {11442#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11444#(= main_~a~0 0)} is VALID [2018-11-14 16:51:42,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {11444#(= main_~a~0 0)} assume true; {11444#(= main_~a~0 0)} is VALID [2018-11-14 16:51:42,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {11444#(= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11444#(= main_~a~0 0)} is VALID [2018-11-14 16:51:42,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {11444#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11445#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:42,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {11445#(<= main_~a~0 1)} assume true; {11445#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:42,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {11445#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11445#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:42,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {11445#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11446#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:42,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {11446#(<= main_~a~0 2)} assume true; {11446#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:42,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {11446#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11446#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:42,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {11446#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11447#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:42,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {11447#(<= main_~a~0 3)} assume true; {11447#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:42,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {11447#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11447#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:42,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {11447#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11448#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:42,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {11448#(<= main_~a~0 4)} assume true; {11448#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:42,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {11448#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11448#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:42,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {11448#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11449#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:42,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {11449#(<= main_~a~0 5)} assume true; {11449#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:42,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {11449#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11449#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:42,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {11449#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11450#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:42,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {11450#(<= main_~a~0 6)} assume true; {11450#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:42,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {11450#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11450#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:42,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {11450#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11451#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:42,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {11451#(<= main_~a~0 7)} assume true; {11451#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:42,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {11451#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11451#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:42,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {11451#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11452#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:42,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {11452#(<= main_~a~0 8)} assume true; {11452#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:42,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {11452#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11452#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:42,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {11452#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11453#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:42,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {11453#(<= main_~a~0 9)} assume true; {11453#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:42,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {11453#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11453#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:42,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {11453#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11454#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:42,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {11454#(<= main_~a~0 10)} assume true; {11454#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:42,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {11454#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11454#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:42,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {11454#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11455#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:42,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {11455#(<= main_~a~0 11)} assume true; {11455#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:42,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {11455#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11455#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:42,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {11455#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11456#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:42,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {11456#(<= main_~a~0 12)} assume true; {11456#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:42,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {11456#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11456#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:42,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {11456#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11457#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:42,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {11457#(<= main_~a~0 13)} assume true; {11457#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:42,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {11457#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11457#(<= main_~a~0 13)} is VALID [2018-11-14 16:51:42,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {11457#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11458#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:42,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {11458#(<= main_~a~0 14)} assume true; {11458#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:42,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {11458#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11458#(<= main_~a~0 14)} is VALID [2018-11-14 16:51:42,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {11458#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11459#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:42,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {11459#(<= main_~a~0 15)} assume true; {11459#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:42,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {11459#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11459#(<= main_~a~0 15)} is VALID [2018-11-14 16:51:42,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {11459#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11460#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:42,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {11460#(<= main_~a~0 16)} assume true; {11460#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:42,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {11460#(<= 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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11460#(<= main_~a~0 16)} is VALID [2018-11-14 16:51:42,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {11460#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11461#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:42,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {11461#(<= main_~a~0 17)} assume true; {11461#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:42,254 INFO L273 TraceCheckUtils]: 58: Hoare triple {11461#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11461#(<= main_~a~0 17)} is VALID [2018-11-14 16:51:42,254 INFO L273 TraceCheckUtils]: 59: Hoare triple {11461#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11462#(<= main_~a~0 18)} is VALID [2018-11-14 16:51:42,255 INFO L273 TraceCheckUtils]: 60: Hoare triple {11462#(<= main_~a~0 18)} assume true; {11462#(<= main_~a~0 18)} is VALID [2018-11-14 16:51:42,255 INFO L273 TraceCheckUtils]: 61: Hoare triple {11462#(<= main_~a~0 18)} assume !(~a~0 < 100000); {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {11443#false} havoc ~i~0;~i~0 := 0; {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 66: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,256 INFO L273 TraceCheckUtils]: 67: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,258 INFO L273 TraceCheckUtils]: 74: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,258 INFO L273 TraceCheckUtils]: 76: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 80: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {11443#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {11443#false} assume !(~i~0 < 100000); {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {11443#false} ~i~0 := 0; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 94: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 96: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 97: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,261 INFO L273 TraceCheckUtils]: 102: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 103: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {11443#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 107: Hoare triple {11443#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 108: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 109: Hoare triple {11443#false} assume !(~i~0 < 100000); {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 110: Hoare triple {11443#false} havoc ~x~0;~x~0 := 0; {11443#false} is VALID [2018-11-14 16:51:42,262 INFO L273 TraceCheckUtils]: 111: Hoare triple {11443#false} assume true; {11443#false} is VALID [2018-11-14 16:51:42,263 INFO L273 TraceCheckUtils]: 112: Hoare triple {11443#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {11443#false} is VALID [2018-11-14 16:51:42,263 INFO L256 TraceCheckUtils]: 113: Hoare triple {11443#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {11443#false} is VALID [2018-11-14 16:51:42,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {11443#false} ~cond := #in~cond; {11443#false} is VALID [2018-11-14 16:51:42,263 INFO L273 TraceCheckUtils]: 115: Hoare triple {11443#false} assume ~cond == 0; {11443#false} is VALID [2018-11-14 16:51:42,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {11443#false} assume !false; {11443#false} is VALID [2018-11-14 16:51:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-14 16:51:42,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:42,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:51:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1