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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:58:01,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:58:01,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:58:01,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:58:01,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:58:01,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:58:01,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:58:01,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:58:01,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:58:01,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:58:01,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:58:01,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:58:01,837 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:58:01,838 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:58:01,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:58:01,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:58:01,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:58:01,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:58:01,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:58:01,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:58:01,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:58:01,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:58:01,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:58:01,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:58:01,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:58:01,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:58:01,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:58:01,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:58:01,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:58:01,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:58:01,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:58:01,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:58:01,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:58:01,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:58:01,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:58:01,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:58:01,863 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 15:58:01,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:58:01,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:58:01,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:58:01,895 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:58:01,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:58:01,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:58:01,896 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:58:01,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:58:01,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:58:01,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:58:01,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:58:01,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:58:01,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:58:01,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:58:01,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:58:01,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:58:01,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:58:01,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:58:01,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:58:01,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:58:01,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:58:01,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:58:01,900 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:58:01,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:58:01,901 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:58:01,901 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:58:01,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:58:01,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:58:01,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:58:01,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:58:01,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:58:01,967 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:58:01,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-14 15:58:02,030 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a20f83f/f55119ac352d4e18b45471e0ed53bb51/FLAG3b444f8d6 [2018-11-14 15:58:02,460 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:58:02,460 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-14 15:58:02,467 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a20f83f/f55119ac352d4e18b45471e0ed53bb51/FLAG3b444f8d6 [2018-11-14 15:58:02,485 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a20f83f/f55119ac352d4e18b45471e0ed53bb51 [2018-11-14 15:58:02,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:58:02,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:58:02,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:58:02,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:58:02,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:58:02,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6a182c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02, skipping insertion in model container [2018-11-14 15:58:02,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:58:02,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:58:02,759 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:58:02,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:58:02,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:58:02,834 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:58:02,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02 WrapperNode [2018-11-14 15:58:02,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:58:02,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:58:02,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:58:02,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:58:02,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (1/1) ... [2018-11-14 15:58:02,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:58:02,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:58:02,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:58:02,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:58:02,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (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 15:58:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:58:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:58:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:58:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:58:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:58:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:58:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 15:58:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:58:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:58:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:58:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:58:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:58:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:58:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:58:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:58:03,621 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:58:03,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:03 BoogieIcfgContainer [2018-11-14 15:58:03,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:58:03,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:58:03,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:58:03,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:58:03,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:58:02" (1/3) ... [2018-11-14 15:58:03,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e94e01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:03, skipping insertion in model container [2018-11-14 15:58:03,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:02" (2/3) ... [2018-11-14 15:58:03,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e94e01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:03, skipping insertion in model container [2018-11-14 15:58:03,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:03" (3/3) ... [2018-11-14 15:58:03,631 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_04_true-unreach-call.i [2018-11-14 15:58:03,642 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:58:03,650 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:58:03,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:58:03,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:58:03,703 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:58:03,703 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:58:03,703 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:58:03,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:58:03,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:58:03,704 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:58:03,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:58:03,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:58:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 15:58:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 15:58:03,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:03,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:03,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:03,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 15:58:03,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:03,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:58:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:03,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:03,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 15:58:03,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-14 15:58:03,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 15:58:03,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 15:58:03,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 15:58:03,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {30#true} is VALID [2018-11-14 15:58:03,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 15:58:03,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1bv32; {31#false} is VALID [2018-11-14 15:58:03,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 15:58:03,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1bv32;~j~0 := 0bv32; {31#false} is VALID [2018-11-14 15:58:03,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 15:58:03,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {31#false} is VALID [2018-11-14 15:58:03,985 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-14 15:58:03,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 15:58:03,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0bv32; {31#false} is VALID [2018-11-14 15:58:03,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 15:58:03,990 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 15:58:03,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:58:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:58:03,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:58:04,002 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:58:04,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:04,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:58:04,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:04,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:58:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:58:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:58:04,180 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 15:58:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:04,392 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 15:58:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:58:04,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:58:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:58:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 15:58:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:58:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 15:58:04,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 15:58:04,695 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 15:58:04,707 INFO L225 Difference]: With dead ends: 46 [2018-11-14 15:58:04,707 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 15:58:04,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 15:58:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 15:58:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 15:58:04,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:04,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 15:58:04,750 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 15:58:04,750 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 15:58:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:04,754 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 15:58:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 15:58:04,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:04,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:04,755 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 15:58:04,756 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 15:58:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:04,760 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 15:58:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 15:58:04,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:04,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:04,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:04,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 15:58:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 15:58:04,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 15:58:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:04,766 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 15:58:04,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:58:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 15:58:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 15:58:04,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:04,768 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 15:58:04,768 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:04,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 15:58:04,769 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:04,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:04,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:58:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:04,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:04,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-14 15:58:04,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {213#true} is VALID [2018-11-14 15:58:04,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-14 15:58:04,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #63#return; {213#true} is VALID [2018-11-14 15:58:04,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret4 := main(); {213#true} is VALID [2018-11-14 15:58:04,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:04,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume true; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:04,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {214#false} is VALID [2018-11-14 15:58:04,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#false} ~i~0 := 1bv32; {214#false} is VALID [2018-11-14 15:58:04,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-14 15:58:04,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} assume !~bvslt32(~i~0, 100000bv32); {214#false} is VALID [2018-11-14 15:58:04,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} ~i~0 := 1bv32;~j~0 := 0bv32; {214#false} is VALID [2018-11-14 15:58:04,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-14 15:58:04,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {214#false} is VALID [2018-11-14 15:58:04,933 INFO L256 TraceCheckUtils]: 14: Hoare triple {214#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-14 15:58:04,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-14 15:58:04,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {214#false} assume ~cond == 0bv32; {214#false} is VALID [2018-11-14 15:58:04,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-14 15:58:04,936 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 15:58:04,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:58:04,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:58:04,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:58:04,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 15:58:04,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:04,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:58:04,984 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 15:58:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:58:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:58:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:58:04,986 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 15:58:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:05,401 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 15:58:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:58:05,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 15:58:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:58:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 15:58:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:58:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 15:58:05,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 15:58:05,571 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 15:58:05,573 INFO L225 Difference]: With dead ends: 38 [2018-11-14 15:58:05,573 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 15:58:05,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 15:58:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 15:58:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 15:58:05,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:05,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 15:58:05,597 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 15:58:05,597 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 15:58:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:05,600 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 15:58:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 15:58:05,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:05,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:05,601 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 15:58:05,601 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 15:58:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:05,604 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 15:58:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 15:58:05,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:05,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:05,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:05,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:58:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 15:58:05,608 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 15:58:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:05,608 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 15:58:05,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:58:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 15:58:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 15:58:05,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:05,609 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:05,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 15:58:05,611 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:05,611 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:58:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:05,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:05,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2018-11-14 15:58:05,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {403#true} is VALID [2018-11-14 15:58:05,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2018-11-14 15:58:05,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #63#return; {403#true} is VALID [2018-11-14 15:58:05,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret4 := main(); {403#true} is VALID [2018-11-14 15:58:05,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {403#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {423#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:05,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#(= main_~i~0 (_ bv0 32))} assume true; {423#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:05,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:05,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:05,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {404#false} is VALID [2018-11-14 15:58:05,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#false} ~i~0 := 1bv32; {404#false} is VALID [2018-11-14 15:58:05,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 15:58:05,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {404#false} assume !~bvslt32(~i~0, 100000bv32); {404#false} is VALID [2018-11-14 15:58:05,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {404#false} ~i~0 := 1bv32;~j~0 := 0bv32; {404#false} is VALID [2018-11-14 15:58:05,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 15:58:05,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {404#false} is VALID [2018-11-14 15:58:05,762 INFO L256 TraceCheckUtils]: 16: Hoare triple {404#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {404#false} is VALID [2018-11-14 15:58:05,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2018-11-14 15:58:05,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {404#false} assume ~cond == 0bv32; {404#false} is VALID [2018-11-14 15:58:05,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#false} assume !false; {404#false} is VALID [2018-11-14 15:58:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:58:05,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:58:05,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#false} assume !false; {404#false} is VALID [2018-11-14 15:58:05,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {404#false} assume ~cond == 0bv32; {404#false} is VALID [2018-11-14 15:58:05,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2018-11-14 15:58:05,973 INFO L256 TraceCheckUtils]: 16: Hoare triple {404#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {404#false} is VALID [2018-11-14 15:58:05,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {404#false} is VALID [2018-11-14 15:58:05,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 15:58:05,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {404#false} ~i~0 := 1bv32;~j~0 := 0bv32; {404#false} is VALID [2018-11-14 15:58:05,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {404#false} assume !~bvslt32(~i~0, 100000bv32); {404#false} is VALID [2018-11-14 15:58:05,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 15:58:05,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#false} ~i~0 := 1bv32; {404#false} is VALID [2018-11-14 15:58:05,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {497#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {404#false} is VALID [2018-11-14 15:58:05,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {497#(bvslt main_~i~0 (_ bv100000 32))} assume true; {497#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:05,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {497#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:05,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:05,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {403#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:05,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret4 := main(); {403#true} is VALID [2018-11-14 15:58:05,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #63#return; {403#true} is VALID [2018-11-14 15:58:05,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2018-11-14 15:58:05,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {403#true} is VALID [2018-11-14 15:58:05,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2018-11-14 15:58:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:58:05,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:58:05,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:58:05,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 15:58:05,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:05,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:58:06,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:58:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:58:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:58:06,047 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-14 15:58:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:06,638 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-14 15:58:06,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:58:06,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 15:58:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:58:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 15:58:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:58:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 15:58:06,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 15:58:06,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:06,805 INFO L225 Difference]: With dead ends: 56 [2018-11-14 15:58:06,805 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 15:58:06,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:58:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 15:58:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-11-14 15:58:06,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:06,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 34 states. [2018-11-14 15:58:06,835 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 34 states. [2018-11-14 15:58:06,836 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 34 states. [2018-11-14 15:58:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:06,841 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 15:58:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 15:58:06,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:06,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:06,842 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 42 states. [2018-11-14 15:58:06,842 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 42 states. [2018-11-14 15:58:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:06,846 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 15:58:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 15:58:06,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:06,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:06,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:06,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 15:58:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-14 15:58:06,850 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2018-11-14 15:58:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:06,850 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-14 15:58:06,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:58:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 15:58:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 15:58:06,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:06,852 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:06,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:06,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash -858280327, now seen corresponding path program 1 times [2018-11-14 15:58:06,853 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:06,854 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:06,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:58:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:06,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:07,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {742#true} call ULTIMATE.init(); {742#true} is VALID [2018-11-14 15:58:07,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {742#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {742#true} is VALID [2018-11-14 15:58:07,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2018-11-14 15:58:07,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #63#return; {742#true} is VALID [2018-11-14 15:58:07,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {742#true} call #t~ret4 := main(); {742#true} is VALID [2018-11-14 15:58:07,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {762#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:07,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#(= main_~i~0 (_ bv0 32))} assume true; {762#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:07,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:07,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {743#false} is VALID [2018-11-14 15:58:07,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#false} ~i~0 := 1bv32; {743#false} is VALID [2018-11-14 15:58:07,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 15:58:07,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 15:58:07,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {743#false} assume !~bvslt32(~i~0, 100000bv32); {743#false} is VALID [2018-11-14 15:58:07,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {743#false} ~i~0 := 1bv32;~j~0 := 0bv32; {743#false} is VALID [2018-11-14 15:58:07,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {743#false} is VALID [2018-11-14 15:58:07,207 INFO L256 TraceCheckUtils]: 26: Hoare triple {743#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {743#false} is VALID [2018-11-14 15:58:07,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {743#false} ~cond := #in~cond; {743#false} is VALID [2018-11-14 15:58:07,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {743#false} assume ~cond == 0bv32; {743#false} is VALID [2018-11-14 15:58:07,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {743#false} assume !false; {743#false} is VALID [2018-11-14 15:58:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 15:58:07,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:58:07,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {743#false} assume !false; {743#false} is VALID [2018-11-14 15:58:07,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {743#false} assume ~cond == 0bv32; {743#false} is VALID [2018-11-14 15:58:07,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {743#false} ~cond := #in~cond; {743#false} is VALID [2018-11-14 15:58:07,503 INFO L256 TraceCheckUtils]: 26: Hoare triple {743#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {743#false} is VALID [2018-11-14 15:58:07,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {743#false} is VALID [2018-11-14 15:58:07,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {743#false} ~i~0 := 1bv32;~j~0 := 0bv32; {743#false} is VALID [2018-11-14 15:58:07,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {743#false} assume !~bvslt32(~i~0, 100000bv32); {743#false} is VALID [2018-11-14 15:58:07,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 15:58:07,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {743#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 15:58:07,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 15:58:07,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#false} ~i~0 := 1bv32; {743#false} is VALID [2018-11-14 15:58:07,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {881#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {743#false} is VALID [2018-11-14 15:58:07,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {881#(bvslt main_~i~0 (_ bv100000 32))} assume true; {881#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:07,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {881#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:07,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:07,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {742#true} call #t~ret4 := main(); {742#true} is VALID [2018-11-14 15:58:07,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #63#return; {742#true} is VALID [2018-11-14 15:58:07,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2018-11-14 15:58:07,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {742#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {742#true} is VALID [2018-11-14 15:58:07,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {742#true} call ULTIMATE.init(); {742#true} is VALID [2018-11-14 15:58:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 15:58:07,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:58:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:58:07,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 15:58:07,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:07,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:58:07,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:07,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:58:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:58:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:58:07,732 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2018-11-14 15:58:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:09,095 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 15:58:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:58:09,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 15:58:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:58:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2018-11-14 15:58:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:58:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2018-11-14 15:58:09,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 84 transitions. [2018-11-14 15:58:09,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:09,264 INFO L225 Difference]: With dead ends: 76 [2018-11-14 15:58:09,265 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 15:58:09,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 15:58:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 15:58:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-14 15:58:09,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:09,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 48 states. [2018-11-14 15:58:09,296 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 48 states. [2018-11-14 15:58:09,296 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 48 states. [2018-11-14 15:58:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:09,299 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 15:58:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 15:58:09,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:09,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:09,301 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 58 states. [2018-11-14 15:58:09,301 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 58 states. [2018-11-14 15:58:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:09,305 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 15:58:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 15:58:09,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:09,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:09,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:09,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:58:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 15:58:09,309 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2018-11-14 15:58:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:09,310 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 15:58:09,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:58:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 15:58:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 15:58:09,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:09,311 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:09,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:09,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1861489655, now seen corresponding path program 2 times [2018-11-14 15:58:09,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:09,333 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:58:09,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:58:09,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:58:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:09,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:09,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2018-11-14 15:58:09,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {1236#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1236#true} is VALID [2018-11-14 15:58:09,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2018-11-14 15:58:09,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2018-11-14 15:58:09,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret4 := main(); {1236#true} is VALID [2018-11-14 15:58:09,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {1236#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1256#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:09,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {1256#(= main_~i~0 (_ bv0 32))} assume true; {1256#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:09,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {1256#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1263#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1263#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1284#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:58:09,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {1284#(= (_ bv4 32) main_~i~0)} assume true; {1284#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:58:09,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1291#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1291#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1298#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:58:09,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {1298#(= (_ bv6 32) main_~i~0)} assume true; {1298#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:58:09,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {1298#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1305#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {1305#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1305#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {1305#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1312#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {1312#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {1312#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {1312#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1319#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 15:58:09,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {1319#(= (_ bv9 32) main_~i~0)} assume true; {1319#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 15:58:09,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {1319#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1326#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {1326#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {1326#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:09,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {1326#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1237#false} is VALID [2018-11-14 15:58:09,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {1237#false} ~i~0 := 1bv32; {1237#false} is VALID [2018-11-14 15:58:09,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:09,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:09,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:09,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:09,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:09,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:09,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:09,799 INFO L273 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !~bvslt32(~i~0, 100000bv32); {1237#false} is VALID [2018-11-14 15:58:09,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {1237#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1237#false} is VALID [2018-11-14 15:58:09,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:09,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {1237#false} is VALID [2018-11-14 15:58:09,800 INFO L256 TraceCheckUtils]: 40: Hoare triple {1237#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1237#false} is VALID [2018-11-14 15:58:09,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {1237#false} ~cond := #in~cond; {1237#false} is VALID [2018-11-14 15:58:09,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {1237#false} assume ~cond == 0bv32; {1237#false} is VALID [2018-11-14 15:58:09,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2018-11-14 15:58:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 15:58:09,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:58:10,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2018-11-14 15:58:10,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {1237#false} assume ~cond == 0bv32; {1237#false} is VALID [2018-11-14 15:58:10,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {1237#false} ~cond := #in~cond; {1237#false} is VALID [2018-11-14 15:58:10,329 INFO L256 TraceCheckUtils]: 40: Hoare triple {1237#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1237#false} is VALID [2018-11-14 15:58:10,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {1237#false} is VALID [2018-11-14 15:58:10,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:10,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {1237#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1237#false} is VALID [2018-11-14 15:58:10,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !~bvslt32(~i~0, 100000bv32); {1237#false} is VALID [2018-11-14 15:58:10,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:10,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:10,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:10,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:10,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:10,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {1237#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#false} is VALID [2018-11-14 15:58:10,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 15:58:10,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {1237#false} ~i~0 := 1bv32; {1237#false} is VALID [2018-11-14 15:58:10,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {1429#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1237#false} is VALID [2018-11-14 15:58:10,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {1429#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1429#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:10,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {1436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1429#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:10,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {1436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {1443#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {1443#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1443#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {1450#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1443#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {1450#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1450#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {1457#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1450#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {1457#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1457#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1457#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {1464#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1464#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {1471#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {1478#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1471#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {1478#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {1478#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {1485#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1478#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {1485#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {1485#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {1492#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1485#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {1492#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {1492#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1499#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1492#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {1499#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {1499#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {1236#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1499#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:10,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret4 := main(); {1236#true} is VALID [2018-11-14 15:58:10,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2018-11-14 15:58:10,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2018-11-14 15:58:10,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1236#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1236#true} is VALID [2018-11-14 15:58:10,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2018-11-14 15:58:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 15:58:10,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:58:10,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:58:10,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-14 15:58:10,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:10,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:58:10,556 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 15:58:10,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:58:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:58:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:58:10,557 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 24 states. [2018-11-14 15:58:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:15,956 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2018-11-14 15:58:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:58:15,957 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-14 15:58:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:58:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-14 15:58:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:58:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-14 15:58:15,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 140 transitions. [2018-11-14 15:58:16,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:16,279 INFO L225 Difference]: With dead ends: 122 [2018-11-14 15:58:16,279 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 15:58:16,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 15:58:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 15:58:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2018-11-14 15:58:16,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:16,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 78 states. [2018-11-14 15:58:16,336 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 78 states. [2018-11-14 15:58:16,336 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 78 states. [2018-11-14 15:58:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:16,341 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 15:58:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-14 15:58:16,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:16,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:16,343 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 102 states. [2018-11-14 15:58:16,343 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 102 states. [2018-11-14 15:58:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:16,349 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 15:58:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-14 15:58:16,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:16,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:16,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:16,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 15:58:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-14 15:58:16,354 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 44 [2018-11-14 15:58:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:16,354 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-14 15:58:16,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:58:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-14 15:58:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 15:58:16,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:16,357 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:16,357 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:16,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -758507507, now seen corresponding path program 3 times [2018-11-14 15:58:16,358 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:16,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:16,388 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:58:16,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 15:58:16,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:58:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:17,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {2040#true} call ULTIMATE.init(); {2040#true} is VALID [2018-11-14 15:58:17,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {2040#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2040#true} is VALID [2018-11-14 15:58:17,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2040#true} {2040#true} #63#return; {2040#true} is VALID [2018-11-14 15:58:17,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {2040#true} call #t~ret4 := main(); {2040#true} is VALID [2018-11-14 15:58:17,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {2040#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2040#true} is VALID [2018-11-14 15:58:17,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {2040#true} assume !~bvslt32(~i~0, 100000bv32); {2040#true} is VALID [2018-11-14 15:58:17,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {2040#true} ~i~0 := 1bv32; {2201#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {2201#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2201#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {2201#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2208#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {2208#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2208#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {2208#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2215#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {2215#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {2215#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {2215#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2222#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {2222#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {2222#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {2222#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2229#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:58:17,162 INFO L273 TraceCheckUtils]: 61: Hoare triple {2229#(= (_ bv17 32) main_~i~0)} assume true; {2229#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:58:17,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {2229#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2236#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,163 INFO L273 TraceCheckUtils]: 63: Hoare triple {2236#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {2236#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:17,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {2236#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2243#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-14 15:58:17,165 INFO L273 TraceCheckUtils]: 65: Hoare triple {2243#(= (_ bv25 32) main_~i~0)} assume true; {2243#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-14 15:58:17,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {2243#(= (_ bv25 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {2041#false} is VALID [2018-11-14 15:58:17,171 INFO L273 TraceCheckUtils]: 67: Hoare triple {2041#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2041#false} is VALID [2018-11-14 15:58:17,171 INFO L273 TraceCheckUtils]: 68: Hoare triple {2041#false} assume true; {2041#false} is VALID [2018-11-14 15:58:17,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {2041#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {2041#false} is VALID [2018-11-14 15:58:17,172 INFO L256 TraceCheckUtils]: 70: Hoare triple {2041#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2041#false} is VALID [2018-11-14 15:58:17,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {2041#false} ~cond := #in~cond; {2041#false} is VALID [2018-11-14 15:58:17,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {2041#false} assume ~cond == 0bv32; {2041#false} is VALID [2018-11-14 15:58:17,172 INFO L273 TraceCheckUtils]: 73: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2018-11-14 15:58:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 15:58:17,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:58:17,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {2041#false} assume ~cond == 0bv32; {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {2041#false} ~cond := #in~cond; {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L256 TraceCheckUtils]: 70: Hoare triple {2041#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L273 TraceCheckUtils]: 69: Hoare triple {2041#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L273 TraceCheckUtils]: 68: Hoare triple {2041#false} assume true; {2041#false} is VALID [2018-11-14 15:58:17,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {2041#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2041#false} is VALID [2018-11-14 15:58:17,641 INFO L273 TraceCheckUtils]: 66: Hoare triple {2292#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2041#false} is VALID [2018-11-14 15:58:17,641 INFO L273 TraceCheckUtils]: 65: Hoare triple {2292#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2292#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:17,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {2299#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2292#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:17,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {2299#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2299#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {2306#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2299#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,649 INFO L273 TraceCheckUtils]: 61: Hoare triple {2306#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2306#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {2313#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2306#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {2313#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {2313#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {2320#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {2320#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {2320#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,664 INFO L273 TraceCheckUtils]: 56: Hoare triple {2327#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2320#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,664 INFO L273 TraceCheckUtils]: 55: Hoare triple {2327#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {2327#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,669 INFO L273 TraceCheckUtils]: 54: Hoare triple {2334#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2327#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,669 INFO L273 TraceCheckUtils]: 53: Hoare triple {2334#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume true; {2334#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {2040#true} ~i~0 := 1bv32; {2334#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:17,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {2040#true} assume !~bvslt32(~i~0, 100000bv32); {2040#true} is VALID [2018-11-14 15:58:17,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 47: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 30: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {2040#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2040#true} is VALID [2018-11-14 15:58:17,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {2040#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2040#true} is VALID [2018-11-14 15:58:17,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {2040#true} call #t~ret4 := main(); {2040#true} is VALID [2018-11-14 15:58:17,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2040#true} {2040#true} #63#return; {2040#true} is VALID [2018-11-14 15:58:17,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {2040#true} assume true; {2040#true} is VALID [2018-11-14 15:58:17,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {2040#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2040#true} is VALID [2018-11-14 15:58:17,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {2040#true} call ULTIMATE.init(); {2040#true} is VALID [2018-11-14 15:58:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 15:58:17,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:58:17,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 15:58:17,686 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-14 15:58:17,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:17,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 15:58:17,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:17,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 15:58:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 15:58:17,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-14 15:58:17,770 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 16 states. [2018-11-14 15:58:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:21,676 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2018-11-14 15:58:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 15:58:21,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-14 15:58:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 15:58:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2018-11-14 15:58:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 15:58:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2018-11-14 15:58:21,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 152 transitions. [2018-11-14 15:58:22,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:22,051 INFO L225 Difference]: With dead ends: 159 [2018-11-14 15:58:22,051 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 15:58:22,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-14 15:58:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 15:58:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2018-11-14 15:58:22,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:22,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 94 states. [2018-11-14 15:58:22,112 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 94 states. [2018-11-14 15:58:22,112 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 94 states. [2018-11-14 15:58:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:22,119 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-14 15:58:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2018-11-14 15:58:22,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:22,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:22,120 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 148 states. [2018-11-14 15:58:22,121 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 148 states. [2018-11-14 15:58:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:22,127 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-14 15:58:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2018-11-14 15:58:22,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:22,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:22,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:22,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 15:58:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-14 15:58:22,132 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 74 [2018-11-14 15:58:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:22,133 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-14 15:58:22,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 15:58:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-14 15:58:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 15:58:22,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:22,135 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:22,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:22,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1062482653, now seen corresponding path program 4 times [2018-11-14 15:58:22,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:22,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:22,160 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:58:22,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:58:22,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:58:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:58:22,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:58:23,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2018-11-14 15:58:23,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {3186#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3186#true} is VALID [2018-11-14 15:58:23,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 15:58:23,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #63#return; {3186#true} is VALID [2018-11-14 15:58:23,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret4 := main(); {3186#true} is VALID [2018-11-14 15:58:23,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {3186#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3206#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:23,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {3206#(= main_~i~0 (_ bv0 32))} assume true; {3206#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:58:23,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {3206#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3213#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {3213#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3213#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {3213#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3220#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:58:23,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {3220#(= (_ bv2 32) main_~i~0)} assume true; {3220#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:58:23,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {3220#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3227#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {3227#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3227#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {3227#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3234#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:58:23,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {3234#(= (_ bv4 32) main_~i~0)} assume true; {3234#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:58:23,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {3234#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3241#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {3241#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3241#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {3241#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3248#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {3248#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {3248#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {3248#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3255#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3255#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3262#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:58:23,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {3262#(= (_ bv8 32) main_~i~0)} assume true; {3262#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:58:23,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {3262#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {3269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {3269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3276#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:58:23,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {3276#(= (_ bv10 32) main_~i~0)} assume true; {3276#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:58:23,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {3276#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3283#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {3283#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3283#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {3283#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3290#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {3290#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {3290#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3297#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {3297#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {3297#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {3297#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3304#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 15:58:23,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {3304#(= (_ bv14 32) main_~i~0)} assume true; {3304#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 15:58:23,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {3304#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3311#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {3311#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {3311#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,435 INFO L273 TraceCheckUtils]: 37: Hoare triple {3311#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3318#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 15:58:23,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {3318#(= (_ bv16 32) main_~i~0)} assume true; {3318#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 15:58:23,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {3318#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3325#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,438 INFO L273 TraceCheckUtils]: 40: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {3325#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,439 INFO L273 TraceCheckUtils]: 41: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3332#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-14 15:58:23,439 INFO L273 TraceCheckUtils]: 42: Hoare triple {3332#(= (_ bv18 32) main_~i~0)} assume true; {3332#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-14 15:58:23,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {3332#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3339#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {3339#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {3339#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {3339#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3346#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {3346#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3346#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {3346#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3353#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 15:58:23,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {3353#(= (_ bv21 32) main_~i~0)} assume true; {3353#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 15:58:23,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {3353#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3360#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,447 INFO L273 TraceCheckUtils]: 50: Hoare triple {3360#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3360#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:58:23,447 INFO L273 TraceCheckUtils]: 51: Hoare triple {3360#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3187#false} is VALID [2018-11-14 15:58:23,448 INFO L273 TraceCheckUtils]: 52: Hoare triple {3187#false} ~i~0 := 1bv32; {3187#false} is VALID [2018-11-14 15:58:23,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,451 INFO L273 TraceCheckUtils]: 62: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,451 INFO L273 TraceCheckUtils]: 63: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,451 INFO L273 TraceCheckUtils]: 64: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,452 INFO L273 TraceCheckUtils]: 65: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,452 INFO L273 TraceCheckUtils]: 66: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,452 INFO L273 TraceCheckUtils]: 67: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 68: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 69: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 70: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 71: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 72: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,453 INFO L273 TraceCheckUtils]: 73: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 74: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 75: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,454 INFO L273 TraceCheckUtils]: 79: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,455 INFO L273 TraceCheckUtils]: 80: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:23,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,455 INFO L273 TraceCheckUtils]: 82: Hoare triple {3187#false} assume !~bvslt32(~i~0, 100000bv32); {3187#false} is VALID [2018-11-14 15:58:23,455 INFO L273 TraceCheckUtils]: 83: Hoare triple {3187#false} ~i~0 := 1bv32;~j~0 := 0bv32; {3187#false} is VALID [2018-11-14 15:58:23,456 INFO L273 TraceCheckUtils]: 84: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:23,456 INFO L273 TraceCheckUtils]: 85: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {3187#false} is VALID [2018-11-14 15:58:23,456 INFO L256 TraceCheckUtils]: 86: Hoare triple {3187#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {3187#false} is VALID [2018-11-14 15:58:23,456 INFO L273 TraceCheckUtils]: 87: Hoare triple {3187#false} ~cond := #in~cond; {3187#false} is VALID [2018-11-14 15:58:23,457 INFO L273 TraceCheckUtils]: 88: Hoare triple {3187#false} assume ~cond == 0bv32; {3187#false} is VALID [2018-11-14 15:58:23,457 INFO L273 TraceCheckUtils]: 89: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2018-11-14 15:58:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 15:58:23,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:58:25,388 INFO L273 TraceCheckUtils]: 89: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2018-11-14 15:58:25,388 INFO L273 TraceCheckUtils]: 88: Hoare triple {3187#false} assume ~cond == 0bv32; {3187#false} is VALID [2018-11-14 15:58:25,388 INFO L273 TraceCheckUtils]: 87: Hoare triple {3187#false} ~cond := #in~cond; {3187#false} is VALID [2018-11-14 15:58:25,388 INFO L256 TraceCheckUtils]: 86: Hoare triple {3187#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {3187#false} is VALID [2018-11-14 15:58:25,389 INFO L273 TraceCheckUtils]: 85: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {3187#false} is VALID [2018-11-14 15:58:25,389 INFO L273 TraceCheckUtils]: 84: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,389 INFO L273 TraceCheckUtils]: 83: Hoare triple {3187#false} ~i~0 := 1bv32;~j~0 := 0bv32; {3187#false} is VALID [2018-11-14 15:58:25,389 INFO L273 TraceCheckUtils]: 82: Hoare triple {3187#false} assume !~bvslt32(~i~0, 100000bv32); {3187#false} is VALID [2018-11-14 15:58:25,389 INFO L273 TraceCheckUtils]: 81: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,390 INFO L273 TraceCheckUtils]: 80: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,390 INFO L273 TraceCheckUtils]: 79: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,390 INFO L273 TraceCheckUtils]: 78: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,390 INFO L273 TraceCheckUtils]: 77: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,390 INFO L273 TraceCheckUtils]: 76: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,391 INFO L273 TraceCheckUtils]: 73: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,391 INFO L273 TraceCheckUtils]: 72: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,391 INFO L273 TraceCheckUtils]: 71: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 65: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,394 INFO L273 TraceCheckUtils]: 59: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,395 INFO L273 TraceCheckUtils]: 54: Hoare triple {3187#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {3187#false} is VALID [2018-11-14 15:58:25,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {3187#false} assume true; {3187#false} is VALID [2018-11-14 15:58:25,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {3187#false} ~i~0 := 1bv32; {3187#false} is VALID [2018-11-14 15:58:25,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {3595#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3187#false} is VALID [2018-11-14 15:58:25,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {3595#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3595#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:25,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {3602#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3595#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:58:25,429 INFO L273 TraceCheckUtils]: 48: Hoare triple {3602#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3602#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,433 INFO L273 TraceCheckUtils]: 47: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3602#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3609#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {3616#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3609#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,439 INFO L273 TraceCheckUtils]: 44: Hoare triple {3616#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3616#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3616#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,445 INFO L273 TraceCheckUtils]: 42: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3623#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,448 INFO L273 TraceCheckUtils]: 41: Hoare triple {3630#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3623#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {3630#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3630#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {3637#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3630#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,455 INFO L273 TraceCheckUtils]: 38: Hoare triple {3637#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {3637#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3637#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {3644#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {3651#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3644#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {3651#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {3651#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {3658#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3651#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {3658#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {3658#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {3665#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3658#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {3665#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {3665#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,493 INFO L273 TraceCheckUtils]: 29: Hoare triple {3672#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3665#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {3672#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {3672#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3672#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {3686#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {3686#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {3686#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {3693#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3686#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {3693#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {3693#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {3700#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3693#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {3700#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {3700#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {3707#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3700#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {3707#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {3707#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3707#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {3714#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {3721#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3714#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {3721#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {3721#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {3728#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3721#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {3728#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {3728#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {3735#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3728#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {3735#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {3735#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {3742#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3735#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {3742#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {3742#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3742#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {3749#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {3186#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3749#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:58:25,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret4 := main(); {3186#true} is VALID [2018-11-14 15:58:25,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #63#return; {3186#true} is VALID [2018-11-14 15:58:25,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 15:58:25,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {3186#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3186#true} is VALID [2018-11-14 15:58:25,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2018-11-14 15:58:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 15:58:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:58:25,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:58:25,618 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2018-11-14 15:58:25,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:58:25,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:58:25,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:25,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:58:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:58:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:58:25,836 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 48 states. [2018-11-14 15:58:29,871 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:58:30,353 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:58:30,860 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:58:31,403 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:58:31,962 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:58:32,532 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:58:33,472 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 15:58:34,093 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 15:58:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:49,223 INFO L93 Difference]: Finished difference Result 232 states and 271 transitions. [2018-11-14 15:58:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:58:49,223 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2018-11-14 15:58:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:58:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:58:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 239 transitions. [2018-11-14 15:58:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:58:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 239 transitions. [2018-11-14 15:58:49,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 239 transitions. [2018-11-14 15:58:49,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:58:49,736 INFO L225 Difference]: With dead ends: 232 [2018-11-14 15:58:49,736 INFO L226 Difference]: Without dead ends: 190 [2018-11-14 15:58:49,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:58:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-14 15:58:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 142. [2018-11-14 15:58:49,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:58:49,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 142 states. [2018-11-14 15:58:49,828 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 142 states. [2018-11-14 15:58:49,829 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 142 states. [2018-11-14 15:58:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:49,836 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2018-11-14 15:58:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2018-11-14 15:58:49,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:49,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:49,838 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 190 states. [2018-11-14 15:58:49,838 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 190 states. [2018-11-14 15:58:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:58:49,845 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2018-11-14 15:58:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2018-11-14 15:58:49,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:58:49,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:58:49,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:58:49,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:58:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-14 15:58:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-11-14 15:58:49,851 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 90 [2018-11-14 15:58:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:58:49,851 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-11-14 15:58:49,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:58:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-11-14 15:58:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-14 15:58:49,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:58:49,854 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:58:49,854 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:58:49,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:58:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2111202413, now seen corresponding path program 5 times [2018-11-14 15:58:49,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:58:49,855 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:58:49,874 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1