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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:10:10,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:10:10,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:10:10,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:10:10,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:10:10,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:10:10,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:10:10,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:10:10,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:10:10,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:10:10,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:10:10,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:10:10,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:10:10,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:10:10,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:10:10,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:10:10,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:10:10,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:10:10,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:10:11,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:10:11,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:10:11,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:10:11,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:10:11,006 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:10:11,006 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:10:11,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:10:11,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:10:11,009 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:10:11,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:10:11,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:10:11,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:10:11,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:10:11,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:10:11,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:10:11,014 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:10:11,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:10:11,015 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-23 10:10:11,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:10:11,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:10:11,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:10:11,035 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:10:11,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:10:11,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:10:11,037 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:10:11,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:10:11,037 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:10:11,037 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:10:11,038 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:10:11,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:10:11,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:10:11,040 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:10:11,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:10:11,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:10:11,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:10:11,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:10:11,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:10:11,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:10:11,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:10:11,042 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:10:11,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:10:11,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:10:11,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:10:11,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:10:11,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:10:11,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:10:11,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-23 10:10:11,183 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6babfd3/4ee5bdd0bf6b407cbd9fc04ad123c1d3/FLAGd61e8a8ad [2018-11-23 10:10:11,580 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:10:11,581 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-23 10:10:11,586 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6babfd3/4ee5bdd0bf6b407cbd9fc04ad123c1d3/FLAGd61e8a8ad [2018-11-23 10:10:11,950 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6babfd3/4ee5bdd0bf6b407cbd9fc04ad123c1d3 [2018-11-23 10:10:11,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:10:11,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:10:11,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:10:11,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:10:11,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:10:11,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:11" (1/1) ... [2018-11-23 10:10:11,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bec00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:11, skipping insertion in model container [2018-11-23 10:10:11,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:11" (1/1) ... [2018-11-23 10:10:11,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:10:12,005 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:10:12,277 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:10:12,286 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:10:12,323 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:10:12,360 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:10:12,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12 WrapperNode [2018-11-23 10:10:12,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:10:12,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:10:12,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:10:12,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:10:12,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:10:12,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:10:12,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:10:12,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:10:12,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (1/1) ... [2018-11-23 10:10:12,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:10:12,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:10:12,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:10:12,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:10:12,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (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-23 10:10:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:10:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:10:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:10:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:10:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:10:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:10:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:10:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:10:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:10:12,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:10:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:10:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:10:13,099 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:10:13,099 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:10:13,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:13 BoogieIcfgContainer [2018-11-23 10:10:13,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:10:13,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:10:13,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:10:13,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:10:13,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:10:11" (1/3) ... [2018-11-23 10:10:13,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4489c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:13, skipping insertion in model container [2018-11-23 10:10:13,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:12" (2/3) ... [2018-11-23 10:10:13,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4489c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:13, skipping insertion in model container [2018-11-23 10:10:13,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:13" (3/3) ... [2018-11-23 10:10:13,108 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_01_true-unreach-call.i [2018-11-23 10:10:13,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:10:13,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:10:13,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:10:13,180 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:10:13,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:10:13,181 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:10:13,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:10:13,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:10:13,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:10:13,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:10:13,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:10:13,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:10:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:10:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:10:13,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:13,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:13,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:13,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:10:13,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:13,224 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-23 10:10:13,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:13,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:13,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:10:13,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:10:13,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:10:13,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:10:13,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:10:13,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:10:13,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:10:13,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0bv32; {28#false} is VALID [2018-11-23 10:10:13,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 10000bv32); {28#false} is VALID [2018-11-23 10:10:13,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 0bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:10:13,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {28#false} is VALID [2018-11-23 10:10:13,469 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:10:13,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:10:13,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:10:13,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:10:13,473 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-23 10:10:13,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:10:13,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:10:13,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:10:13,488 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:10:13,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:13,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:10:13,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:13,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:10:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:10:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:10:13,631 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:10:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:13,906 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:10:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:10:13,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:10:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:10:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:10:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:10:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:10:13,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:10:14,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:14,244 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:10:14,244 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:10:14,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-23 10:10:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:10:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:10:14,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:14,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:14,289 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:14,289 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:14,294 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:10:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:10:14,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:14,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:14,295 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:14,295 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:14,299 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:10:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:10:14,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:14,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:14,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:14,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:10:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:10:14,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:10:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:14,307 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:10:14,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:10:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:10:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:10:14,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:14,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:14,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:14,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:10:14,312 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:14,315 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-23 10:10:14,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:14,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:14,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:10:14,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {193#true} is VALID [2018-11-23 10:10:14,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:10:14,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:10:14,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:10:14,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:14,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {194#false} is VALID [2018-11-23 10:10:14,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 0bv32; {194#false} is VALID [2018-11-23 10:10:14,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 10000bv32); {194#false} is VALID [2018-11-23 10:10:14,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 0bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:10:14,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {194#false} is VALID [2018-11-23 10:10:14,477 INFO L256 TraceCheckUtils]: 11: Hoare triple {194#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {194#false} is VALID [2018-11-23 10:10:14,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:10:14,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:10:14,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:10:14,479 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-23 10:10:14,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:10:14,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:10:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:10:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:10:14,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:14,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:10:14,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:14,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:10:14,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:10:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:10:14,525 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:10:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:14,819 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 10:10:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:10:14,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:10:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:10:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 10:10:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:10:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 10:10:14,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 10:10:15,094 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-23 10:10:15,097 INFO L225 Difference]: With dead ends: 36 [2018-11-23 10:10:15,098 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:10:15,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-23 10:10:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:10:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 10:10:15,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:15,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-23 10:10:15,118 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-23 10:10:15,118 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-23 10:10:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:15,123 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 10:10:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:10:15,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:15,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:15,124 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-23 10:10:15,124 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-23 10:10:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:15,127 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 10:10:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:10:15,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:15,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:15,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:15,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:10:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 10:10:15,131 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-23 10:10:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:15,131 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 10:10:15,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:10:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:10:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:10:15,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:15,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:15,133 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:15,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2018-11-23 10:10:15,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:15,134 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-23 10:10:15,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:15,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:15,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 10:10:15,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 10:10:15,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 10:10:15,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #60#return; {373#true} is VALID [2018-11-23 10:10:15,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret4 := main(); {373#true} is VALID [2018-11-23 10:10:15,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {393#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:15,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {393#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {397#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {374#false} is VALID [2018-11-23 10:10:15,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 10:10:15,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {374#false} is VALID [2018-11-23 10:10:15,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !~bvslt32(~i~0, 10000bv32); {374#false} is VALID [2018-11-23 10:10:15,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} ~i~0 := 0bv32;~j~0 := 0bv32; {374#false} is VALID [2018-11-23 10:10:15,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {374#false} is VALID [2018-11-23 10:10:15,395 INFO L256 TraceCheckUtils]: 13: Hoare triple {374#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 10:10:15,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 10:10:15,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 10:10:15,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 10:10:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:10:15,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:15,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 10:10:15,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 10:10:15,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 10:10:15,773 INFO L256 TraceCheckUtils]: 13: Hoare triple {374#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 10:10:15,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {374#false} is VALID [2018-11-23 10:10:15,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} ~i~0 := 0bv32;~j~0 := 0bv32; {374#false} is VALID [2018-11-23 10:10:15,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !~bvslt32(~i~0, 10000bv32); {374#false} is VALID [2018-11-23 10:10:15,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {374#false} is VALID [2018-11-23 10:10:15,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 10:10:15,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {455#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {374#false} is VALID [2018-11-23 10:10:15,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {459#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {455#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:10:15,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {459#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:15,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret4 := main(); {373#true} is VALID [2018-11-23 10:10:15,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #60#return; {373#true} is VALID [2018-11-23 10:10:15,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 10:10:15,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 10:10:15,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 10:10:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:10:15,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:10:15,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:10:15,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:15,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:10:15,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:15,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:10:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:10:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:10:15,927 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-11-23 10:10:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:16,586 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 10:10:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:10:16,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:10:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:10:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:10:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:10:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:10:16,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 10:10:16,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:16,766 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:10:16,766 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:10:16,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:10:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:10:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-11-23 10:10:16,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:16,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2018-11-23 10:10:16,796 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2018-11-23 10:10:16,796 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2018-11-23 10:10:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:16,800 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 10:10:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 10:10:16,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:16,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:16,802 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2018-11-23 10:10:16,802 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2018-11-23 10:10:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:16,806 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 10:10:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 10:10:16,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:16,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:16,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:16,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:10:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 10:10:16,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 17 [2018-11-23 10:10:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:16,810 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 10:10:16,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:10:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 10:10:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:10:16,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:16,811 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:16,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:16,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1912151398, now seen corresponding path program 2 times [2018-11-23 10:10:16,813 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:16,813 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-23 10:10:16,831 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:10:16,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:10:16,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:16,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:17,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 10:10:17,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {679#true} is VALID [2018-11-23 10:10:17,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 10:10:17,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #60#return; {679#true} is VALID [2018-11-23 10:10:17,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 10:10:17,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {699#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:17,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {703#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:17,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {703#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {707#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:17,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {707#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {711#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:17,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {711#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {715#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:10:17,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {715#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 10000bv32); {680#false} is VALID [2018-11-23 10:10:17,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:10:17,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} assume !~bvslt32(~i~0, 10000bv32); {680#false} is VALID [2018-11-23 10:10:17,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} ~i~0 := 0bv32;~j~0 := 0bv32; {680#false} is VALID [2018-11-23 10:10:17,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {680#false} is VALID [2018-11-23 10:10:17,070 INFO L256 TraceCheckUtils]: 19: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {680#false} is VALID [2018-11-23 10:10:17,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 10:10:17,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume 0bv32 == ~cond; {680#false} is VALID [2018-11-23 10:10:17,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 10:10:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 10:10:17,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:17,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 10:10:17,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume 0bv32 == ~cond; {680#false} is VALID [2018-11-23 10:10:17,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 10:10:17,216 INFO L256 TraceCheckUtils]: 19: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {680#false} is VALID [2018-11-23 10:10:17,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {680#false} is VALID [2018-11-23 10:10:17,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} ~i~0 := 0bv32;~j~0 := 0bv32; {680#false} is VALID [2018-11-23 10:10:17,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} assume !~bvslt32(~i~0, 10000bv32); {680#false} is VALID [2018-11-23 10:10:17,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {680#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {680#false} is VALID [2018-11-23 10:10:17,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:10:17,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {791#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {680#false} is VALID [2018-11-23 10:10:17,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {791#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:10:17,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {799#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {795#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:17,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {803#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {799#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:17,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {807#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {803#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:17,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {807#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:17,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 10:10:17,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #60#return; {679#true} is VALID [2018-11-23 10:10:17,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 10:10:17,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {679#true} is VALID [2018-11-23 10:10:17,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 10:10:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 10:10:17,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:17,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:10:17,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-23 10:10:17,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:17,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:10:17,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:17,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:10:17,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:10:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:10:17,293 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2018-11-23 10:10:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:19,817 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-11-23 10:10:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:10:19,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-23 10:10:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:10:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-23 10:10:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:10:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-23 10:10:19,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 103 transitions. [2018-11-23 10:10:20,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:20,128 INFO L225 Difference]: With dead ends: 83 [2018-11-23 10:10:20,128 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 10:10:20,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:10:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 10:10:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2018-11-23 10:10:20,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:20,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 39 states. [2018-11-23 10:10:20,211 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 39 states. [2018-11-23 10:10:20,211 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 39 states. [2018-11-23 10:10:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:20,217 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-23 10:10:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 10:10:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:20,219 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 67 states. [2018-11-23 10:10:20,219 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 67 states. [2018-11-23 10:10:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:20,224 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-23 10:10:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 10:10:20,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:20,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:20,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:20,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 10:10:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 10:10:20,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 23 [2018-11-23 10:10:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:20,229 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 10:10:20,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:10:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 10:10:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:10:20,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:20,231 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:20,231 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:20,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2054257670, now seen corresponding path program 3 times [2018-11-23 10:10:20,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:20,233 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-23 10:10:20,256 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:10:21,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:10:21,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:21,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:21,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2018-11-23 10:10:21,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1177#true} is VALID [2018-11-23 10:10:21,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2018-11-23 10:10:21,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #60#return; {1177#true} is VALID [2018-11-23 10:10:21,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret4 := main(); {1177#true} is VALID [2018-11-23 10:10:21,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1177#true} is VALID [2018-11-23 10:10:21,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {1177#true} assume !~bvslt32(~i~0, 10000bv32); {1177#true} is VALID [2018-11-23 10:10:21,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {1177#true} ~i~0 := 0bv32; {1233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:21,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {1233#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1237#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1241#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:10:21,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {1241#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1245#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1245#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1249#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {1249#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1253#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {1253#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1257#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {1257#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1261#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {1261#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1265#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:10:21,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {1265#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {1269#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1273#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:21,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {1273#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {1178#false} is VALID [2018-11-23 10:10:21,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {1178#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1178#false} is VALID [2018-11-23 10:10:21,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {1178#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {1178#false} is VALID [2018-11-23 10:10:21,383 INFO L256 TraceCheckUtils]: 31: Hoare triple {1178#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1178#false} is VALID [2018-11-23 10:10:21,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {1178#false} ~cond := #in~cond; {1178#false} is VALID [2018-11-23 10:10:21,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {1178#false} assume 0bv32 == ~cond; {1178#false} is VALID [2018-11-23 10:10:21,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2018-11-23 10:10:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:10:21,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:21,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2018-11-23 10:10:21,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {1178#false} assume 0bv32 == ~cond; {1178#false} is VALID [2018-11-23 10:10:21,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {1178#false} ~cond := #in~cond; {1178#false} is VALID [2018-11-23 10:10:21,871 INFO L256 TraceCheckUtils]: 31: Hoare triple {1178#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1178#false} is VALID [2018-11-23 10:10:21,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {1178#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {1178#false} is VALID [2018-11-23 10:10:21,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {1178#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1178#false} is VALID [2018-11-23 10:10:21,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1178#false} is VALID [2018-11-23 10:10:21,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {1317#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1313#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:10:21,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {1321#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1317#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {1325#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1321#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {1329#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1325#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {1333#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1329#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {1337#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1333#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {1341#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1337#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {1345#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1341#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {1349#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1345#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {1353#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1349#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {1177#true} ~i~0 := 0bv32; {1353#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:21,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {1177#true} assume !~bvslt32(~i~0, 10000bv32); {1177#true} is VALID [2018-11-23 10:10:21,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#true} assume !!~bvslt32(~i~0, 10000bv32);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); {1177#true} is VALID [2018-11-23 10:10:21,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1177#true} is VALID [2018-11-23 10:10:21,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret4 := main(); {1177#true} is VALID [2018-11-23 10:10:21,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #60#return; {1177#true} is VALID [2018-11-23 10:10:21,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2018-11-23 10:10:21,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1177#true} is VALID [2018-11-23 10:10:21,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2018-11-23 10:10:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:10:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:21,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:10:21,933 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-23 10:10:21,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:21,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:10:22,027 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-23 10:10:22,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:10:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:10:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:10:22,028 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 24 states. [2018-11-23 10:10:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:31,904 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2018-11-23 10:10:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:10:31,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-23 10:10:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 187 transitions. [2018-11-23 10:10:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 187 transitions. [2018-11-23 10:10:31,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 187 transitions. [2018-11-23 10:10:32,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:32,416 INFO L225 Difference]: With dead ends: 149 [2018-11-23 10:10:32,416 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 10:10:32,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:10:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 10:10:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2018-11-23 10:10:32,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:32,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 63 states. [2018-11-23 10:10:32,539 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 63 states. [2018-11-23 10:10:32,539 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 63 states. [2018-11-23 10:10:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:32,548 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2018-11-23 10:10:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2018-11-23 10:10:32,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:32,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:32,550 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 127 states. [2018-11-23 10:10:32,550 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 127 states. [2018-11-23 10:10:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:32,558 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2018-11-23 10:10:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2018-11-23 10:10:32,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:32,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:32,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:32,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 10:10:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 10:10:32,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 35 [2018-11-23 10:10:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 10:10:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:10:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 10:10:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 10:10:32,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:32,565 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:32,565 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:32,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -819523258, now seen corresponding path program 4 times [2018-11-23 10:10:32,566 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:32,566 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-23 10:10:32,595 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:10:32,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:10:32,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:32,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:33,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {2069#true} call ULTIMATE.init(); {2069#true} is VALID [2018-11-23 10:10:33,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {2069#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2069#true} is VALID [2018-11-23 10:10:33,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {2069#true} assume true; {2069#true} is VALID [2018-11-23 10:10:33,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2069#true} {2069#true} #60#return; {2069#true} is VALID [2018-11-23 10:10:33,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {2069#true} call #t~ret4 := main(); {2069#true} is VALID [2018-11-23 10:10:33,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {2069#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2089#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:33,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {2089#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2093#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {2093#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2097#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {2097#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2101#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {2101#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2105#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:10:33,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {2105#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2109#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {2109#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2113#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:10:33,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {2113#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2117#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {2117#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2121#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2125#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:10:33,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {2125#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2129#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {2129#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2133#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 10:10:33,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2137#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {2137#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2141#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2145#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:10:33,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {2145#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2149#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {2149#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2153#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {2153#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2157#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:10:33,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {2157#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2161#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {2161#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2165#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:10:33,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {2165#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);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); {2169#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {2169#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2173#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {2173#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2177#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:33,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {2177#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {2070#false} is VALID [2018-11-23 10:10:33,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {2070#false} ~i~0 := 0bv32; {2070#false} is VALID [2018-11-23 10:10:33,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,552 INFO L273 TraceCheckUtils]: 35: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,553 INFO L273 TraceCheckUtils]: 40: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,554 INFO L273 TraceCheckUtils]: 43: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,555 INFO L273 TraceCheckUtils]: 45: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,555 INFO L273 TraceCheckUtils]: 47: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,555 INFO L273 TraceCheckUtils]: 48: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:33,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {2070#false} assume !~bvslt32(~i~0, 10000bv32); {2070#false} is VALID [2018-11-23 10:10:33,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {2070#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2070#false} is VALID [2018-11-23 10:10:33,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {2070#false} is VALID [2018-11-23 10:10:33,557 INFO L256 TraceCheckUtils]: 55: Hoare triple {2070#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2070#false} is VALID [2018-11-23 10:10:33,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {2070#false} ~cond := #in~cond; {2070#false} is VALID [2018-11-23 10:10:33,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {2070#false} assume 0bv32 == ~cond; {2070#false} is VALID [2018-11-23 10:10:33,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {2070#false} assume !false; {2070#false} is VALID [2018-11-23 10:10:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:10:33,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:35,608 INFO L273 TraceCheckUtils]: 58: Hoare triple {2070#false} assume !false; {2070#false} is VALID [2018-11-23 10:10:35,608 INFO L273 TraceCheckUtils]: 57: Hoare triple {2070#false} assume 0bv32 == ~cond; {2070#false} is VALID [2018-11-23 10:10:35,608 INFO L273 TraceCheckUtils]: 56: Hoare triple {2070#false} ~cond := #in~cond; {2070#false} is VALID [2018-11-23 10:10:35,609 INFO L256 TraceCheckUtils]: 55: Hoare triple {2070#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2070#false} is VALID [2018-11-23 10:10:35,609 INFO L273 TraceCheckUtils]: 54: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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, ~j~0)), 4bv32); {2070#false} is VALID [2018-11-23 10:10:35,609 INFO L273 TraceCheckUtils]: 53: Hoare triple {2070#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2070#false} is VALID [2018-11-23 10:10:35,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {2070#false} assume !~bvslt32(~i~0, 10000bv32); {2070#false} is VALID [2018-11-23 10:10:35,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 49: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 46: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,611 INFO L273 TraceCheckUtils]: 44: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {2070#false} assume !!~bvslt32(~i~0, 10000bv32);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(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2070#false} is VALID [2018-11-23 10:10:35,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {2070#false} ~i~0 := 0bv32; {2070#false} is VALID [2018-11-23 10:10:35,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {2361#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {2070#false} is VALID [2018-11-23 10:10:35,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {2365#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2361#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:10:35,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {2369#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2365#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {2373#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2369#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {2377#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2373#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {2381#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2377#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {2385#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2381#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {2389#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2385#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {2393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2389#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {2397#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {2401#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2397#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {2405#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2401#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {2409#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2405#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2409#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2417#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2413#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {2421#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2417#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {2425#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2421#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {2429#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2425#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {2433#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2429#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {2437#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2433#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {2441#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2437#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {2445#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2441#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {2449#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);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); {2445#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {2069#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2449#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-23 10:10:35,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {2069#true} call #t~ret4 := main(); {2069#true} is VALID [2018-11-23 10:10:35,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2069#true} {2069#true} #60#return; {2069#true} is VALID [2018-11-23 10:10:35,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {2069#true} assume true; {2069#true} is VALID [2018-11-23 10:10:35,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {2069#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2069#true} is VALID [2018-11-23 10:10:35,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {2069#true} call ULTIMATE.init(); {2069#true} is VALID [2018-11-23 10:10:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:10:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:35,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:10:35,765 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 59 [2018-11-23 10:10:35,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:35,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:10:35,904 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-23 10:10:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:10:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:10:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:10:35,906 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 48 states. [2018-11-23 10:10:39,582 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:10:40,117 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:10:40,647 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:10:41,236 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:10:41,783 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:10:42,349 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:11:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:11:22,517 INFO L93 Difference]: Finished difference Result 281 states and 377 transitions. [2018-11-23 10:11:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:11:22,517 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 59 [2018-11-23 10:11:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:11:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:11:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 355 transitions. [2018-11-23 10:11:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:11:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 355 transitions. [2018-11-23 10:11:22,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 355 transitions. [2018-11-23 10:11:23,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:11:23,519 INFO L225 Difference]: With dead ends: 281 [2018-11-23 10:11:23,519 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 10:11:23,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:11:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 10:11:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 111. [2018-11-23 10:11:23,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:11:23,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 111 states. [2018-11-23 10:11:23,695 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 111 states. [2018-11-23 10:11:23,695 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 111 states. [2018-11-23 10:11:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:11:23,712 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2018-11-23 10:11:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 294 transitions. [2018-11-23 10:11:23,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:11:23,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:11:23,714 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 247 states. [2018-11-23 10:11:23,714 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 247 states. [2018-11-23 10:11:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:11:23,731 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2018-11-23 10:11:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 294 transitions. [2018-11-23 10:11:23,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:11:23,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:11:23,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:11:23,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:11:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 10:11:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-11-23 10:11:23,738 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 59 [2018-11-23 10:11:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:11:23,738 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-23 10:11:23,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:11:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-23 10:11:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 10:11:23,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:11:23,741 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:11:23,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:11:23,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:11:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 406690758, now seen corresponding path program 5 times [2018-11-23 10:11:23,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:11:23,743 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-23 10:11:23,765 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1