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_02_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:08,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:08,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:08,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:08,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:08,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:08,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:08,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:08,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:08,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:08,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:08,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:08,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:08,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:08,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:08,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:08,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:08,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:08,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:08,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:08,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:08,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:08,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:08,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:08,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:08,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:08,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:08,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:08,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:08,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:08,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:08,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:08,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:08,402 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:08,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:08,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:08,405 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:13:08,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:08,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:08,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:08,436 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:08,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:08,437 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:08,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:08,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:08,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:08,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:08,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:08,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:08,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:08,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:08,441 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:08,441 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:08,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:08,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:08,442 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:08,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:08,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:08,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:08,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:08,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:08,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:08,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:08,448 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:08,448 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:08,448 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:08,449 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:08,449 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:08,449 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:08,449 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:08,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:08,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:08,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:08,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:08,529 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:08,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_02_true-unreach-call.i [2018-11-23 10:13:08,612 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9a86edb/bd3fed726cd64d5db405d52d2697469d/FLAG33e442f98 [2018-11-23 10:13:09,164 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:09,164 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_02_true-unreach-call.i [2018-11-23 10:13:09,170 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9a86edb/bd3fed726cd64d5db405d52d2697469d/FLAG33e442f98 [2018-11-23 10:13:09,508 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9a86edb/bd3fed726cd64d5db405d52d2697469d [2018-11-23 10:13:09,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:09,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:09,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:09,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:09,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:09,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347ec180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09, skipping insertion in model container [2018-11-23 10:13:09,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:09,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:09,828 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:09,835 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:09,875 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:09,909 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:09,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09 WrapperNode [2018-11-23 10:13:09,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:09,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:09,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:09,913 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:09,924 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:13:09" (1/1) ... [2018-11-23 10:13:09,939 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:13:09" (1/1) ... [2018-11-23 10:13:09,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:09,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:09,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:09,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:09,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:09,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:10,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:10,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (1/1) ... [2018-11-23 10:13:10,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:10,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:10,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:10,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:10,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (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:13:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:10,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:10,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:10,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:10,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:10,736 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:10,736 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:13:10,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:10 BoogieIcfgContainer [2018-11-23 10:13:10,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:10,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:10,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:10,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:10,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:09" (1/3) ... [2018-11-23 10:13:10,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21dc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:10, skipping insertion in model container [2018-11-23 10:13:10,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:09" (2/3) ... [2018-11-23 10:13:10,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21dc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:10, skipping insertion in model container [2018-11-23 10:13:10,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:10" (3/3) ... [2018-11-23 10:13:10,748 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_02_true-unreach-call.i [2018-11-23 10:13:10,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:10,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:10,784 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:10,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:10,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:10,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:10,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:10,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:10,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:10,822 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:10,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:10,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:13:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:10,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:10,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:10,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:10,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:13:10,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:10,864 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:13:10,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:10,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:11,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:13:11,113 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:13:11,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:13:11,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:13:11,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:13:11,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:13:11,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:13:11,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1bv32; {28#false} is VALID [2018-11-23 10:13:11,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 100000bv32); {28#false} is VALID [2018-11-23 10:13:11,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:13:11,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {28#false} is VALID [2018-11-23 10:13:11,121 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:13:11,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:13:11,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:13:11,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:13:11,125 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:13:11,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:11,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:11,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:11,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:11,226 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:13:11,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:11,240 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:13:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:11,570 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:13:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:11,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:11,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:13:11,876 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:13:11,889 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:13:11,889 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:11,893 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:13:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:11,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:11,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:11,947 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:11,947 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:11,951 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:11,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:11,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:11,953 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:11,953 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:11,957 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:11,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:11,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:11,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:11,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:13:11,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:13:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:11,964 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:13:11,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:11,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:11,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:11,966 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:11,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:13:11,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:11,967 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:13:11,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:12,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:12,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:13:12,102 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:13:12,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:13:12,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:13:12,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:13:12,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:12,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:12,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 1bv32; {194#false} is VALID [2018-11-23 10:13:12,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:12,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 1bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:13:12,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {194#false} is VALID [2018-11-23 10:13:12,128 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:13:12,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:13:12,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:13:12,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:13:12,131 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:13:12,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:12,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:12,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:12,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:12,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:12,188 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:13:12,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:12,190 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:13:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:12,332 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:13:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:12,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:12,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 10:13:12,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:12,766 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:13:12,766 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:12,768 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:13:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:12,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:12,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:12,794 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:12,795 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:12,797 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:12,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:12,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:12,798 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:12,798 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:12,801 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:12,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:12,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:12,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:12,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:12,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 10:13:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:12,805 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:12,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:13:12,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:12,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:12,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:12,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 10:13:12,808 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:12,808 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:13:12,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:12,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:12,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:12,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:12,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:12,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:12,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:12,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:12,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:12,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:12,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:12,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:12,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:12,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:12,992 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:12,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:12,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:12,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:12,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:13,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:13,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:13,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:13,072 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:13,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:13,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:13,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:13,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:13,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:13,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {432#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:13,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:13,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:13,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:13,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:13,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:13,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:13,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:13,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:13,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:13,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:13,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:13,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:13,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:13,241 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:13:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:13,856 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:13:13,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:13,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:13,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:13:14,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:14,051 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:13:14,051 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:13:14,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:13:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 10:13:14,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:14,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:14,086 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:14,086 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:14,091 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:14,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:14,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:14,092 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:14,093 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:14,096 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:14,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:14,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:14,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:14,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 10:13:14,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-23 10:13:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:14,101 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 10:13:14,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 10:13:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:14,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:14,102 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:14,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:14,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 1 times [2018-11-23 10:13:14,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:14,104 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:13:14,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:14,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:14,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:14,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:14,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:14,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:14,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:14,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {647#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:14,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:14,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:14,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:14,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:14,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:14,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:14,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:14,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:14,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:14,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:14,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:14,353 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:14,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:14,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:14,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:14,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:14,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:14,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:14,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:14,551 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:14,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:14,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:14,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:14,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:14,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:14,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:14,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:14,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {727#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:14,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:14,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:14,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:14,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:14,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:14,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:14,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:14,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:14,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:14,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:14,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:14,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:14,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:14,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:14,643 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:13:14,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:14,644 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-11-23 10:13:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:16,495 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 10:13:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:16,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 10:13:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 10:13:16,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2018-11-23 10:13:16,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:16,693 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:13:16,693 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 10:13:16,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 10:13:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-23 10:13:16,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:16,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 34 states. [2018-11-23 10:13:16,772 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 34 states. [2018-11-23 10:13:16,773 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 34 states. [2018-11-23 10:13:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:16,779 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 10:13:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 10:13:16,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:16,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:16,781 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 47 states. [2018-11-23 10:13:16,781 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 47 states. [2018-11-23 10:13:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:16,792 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 10:13:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 10:13:16,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:16,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:16,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:16,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:13:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 10:13:16,799 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 21 [2018-11-23 10:13:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:16,799 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 10:13:16,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 10:13:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:13:16,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:16,801 INFO L402 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:16,801 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:16,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1963168809, now seen corresponding path program 2 times [2018-11-23 10:13:16,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:16,807 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:13:16,832 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:16,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:16,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:16,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:17,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 10:13:17,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1024#true} is VALID [2018-11-23 10:13:17,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:13:17,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2018-11-23 10:13:17,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret4 := main(); {1024#true} is VALID [2018-11-23 10:13:17,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1044#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:17,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1044#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1048#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1048#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1052#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1056#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1056#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1060#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:17,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1060#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1064#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1064#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1068#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:17,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1068#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1072#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {1072#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1076#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {1076#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1080#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:17,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1084#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:17,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1025#false} is VALID [2018-11-23 10:13:17,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} ~i~0 := 1bv32; {1025#false} is VALID [2018-11-23 10:13:17,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {1025#false} assume !~bvslt32(~i~0, 100000bv32); {1025#false} is VALID [2018-11-23 10:13:17,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1025#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1025#false} is VALID [2018-11-23 10:13:17,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {1025#false} is VALID [2018-11-23 10:13:17,271 INFO L256 TraceCheckUtils]: 26: Hoare triple {1025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1025#false} is VALID [2018-11-23 10:13:17,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2018-11-23 10:13:17,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1025#false} assume 0bv32 == ~cond; {1025#false} is VALID [2018-11-23 10:13:17,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 10:13:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:13:17,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:17,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 10:13:17,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {1025#false} assume 0bv32 == ~cond; {1025#false} is VALID [2018-11-23 10:13:17,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2018-11-23 10:13:17,799 INFO L256 TraceCheckUtils]: 26: Hoare triple {1025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1025#false} is VALID [2018-11-23 10:13:17,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {1025#false} is VALID [2018-11-23 10:13:17,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {1025#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1025#false} is VALID [2018-11-23 10:13:17,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {1025#false} assume !~bvslt32(~i~0, 100000bv32); {1025#false} is VALID [2018-11-23 10:13:17,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {1025#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1025#false} is VALID [2018-11-23 10:13:17,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} ~i~0 := 1bv32; {1025#false} is VALID [2018-11-23 10:13:17,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {1166#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1025#false} is VALID [2018-11-23 10:13:17,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {1170#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1166#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:17,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {1174#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1170#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {1178#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1174#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1178#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {1186#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {1190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1186#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {1194#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1194#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1198#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {1206#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1202#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1206#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:17,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret4 := main(); {1024#true} is VALID [2018-11-23 10:13:17,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2018-11-23 10:13:17,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:13:17,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1024#true} is VALID [2018-11-23 10:13:17,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 10:13:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:13:17,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:17,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:13:17,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 10:13:17,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:17,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:13:17,978 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:13:17,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:13:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:13:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:13:17,979 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 24 states. [2018-11-23 10:13:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:24,731 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2018-11-23 10:13:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:13:24,731 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 10:13:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 10:13:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 10:13:24,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 126 transitions. [2018-11-23 10:13:25,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:25,070 INFO L225 Difference]: With dead ends: 100 [2018-11-23 10:13:25,070 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 10:13:25,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:13:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 10:13:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2018-11-23 10:13:25,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:25,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 52 states. [2018-11-23 10:13:25,217 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 52 states. [2018-11-23 10:13:25,217 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 52 states. [2018-11-23 10:13:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:25,223 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-23 10:13:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-23 10:13:25,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:25,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:25,225 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 83 states. [2018-11-23 10:13:25,225 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 83 states. [2018-11-23 10:13:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:25,231 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-23 10:13:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-23 10:13:25,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:25,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:25,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:25,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 10:13:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 10:13:25,235 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2018-11-23 10:13:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:25,236 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 10:13:25,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:13:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 10:13:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:13:25,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:25,237 INFO L402 BasicCegarLoop]: trace histogram [22, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:25,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:25,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:25,238 INFO L82 PathProgramCache]: Analyzing trace with hash 544254985, now seen corresponding path program 3 times [2018-11-23 10:13:25,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:25,239 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:13:25,258 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:26,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 10:13:26,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:26,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:26,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2018-11-23 10:13:26,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1679#true} is VALID [2018-11-23 10:13:26,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {1679#true} assume true; {1679#true} is VALID [2018-11-23 10:13:26,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1679#true} {1679#true} #60#return; {1679#true} is VALID [2018-11-23 10:13:26,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1679#true} call #t~ret4 := main(); {1679#true} is VALID [2018-11-23 10:13:26,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {1679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1679#true} is VALID [2018-11-23 10:13:26,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:26,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {1679#true} assume !~bvslt32(~i~0, 100000bv32); {1679#true} is VALID [2018-11-23 10:13:26,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {1679#true} ~i~0 := 1bv32; {1771#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {1771#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1775#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {1775#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1779#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {1779#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1783#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,960 INFO L273 TraceCheckUtils]: 33: Hoare triple {1783#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1787#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:26,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {1787#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1791#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {1791#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1795#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {1795#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1799#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:13:26,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {1799#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1803#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {1803#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1807#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {1807#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1811#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 10:13:26,979 INFO L273 TraceCheckUtils]: 40: Hoare triple {1811#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1815#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:26,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {1815#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1680#false} is VALID [2018-11-23 10:13:26,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {1680#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1680#false} is VALID [2018-11-23 10:13:26,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {1680#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {1680#false} is VALID [2018-11-23 10:13:26,980 INFO L256 TraceCheckUtils]: 44: Hoare triple {1680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1680#false} is VALID [2018-11-23 10:13:26,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2018-11-23 10:13:26,980 INFO L273 TraceCheckUtils]: 46: Hoare triple {1680#false} assume 0bv32 == ~cond; {1680#false} is VALID [2018-11-23 10:13:26,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2018-11-23 10:13:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:26,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:27,914 INFO L273 TraceCheckUtils]: 47: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2018-11-23 10:13:27,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {1680#false} assume 0bv32 == ~cond; {1680#false} is VALID [2018-11-23 10:13:27,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2018-11-23 10:13:27,915 INFO L256 TraceCheckUtils]: 44: Hoare triple {1680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1680#false} is VALID [2018-11-23 10:13:27,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {1680#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {1680#false} is VALID [2018-11-23 10:13:27,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {1680#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1680#false} is VALID [2018-11-23 10:13:27,917 INFO L273 TraceCheckUtils]: 41: Hoare triple {1855#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1680#false} is VALID [2018-11-23 10:13:27,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {1859#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt main_~i~0 (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1855#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:27,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {1863#(or (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1859#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt main_~i~0 (_ bv100000 32))))} is VALID [2018-11-23 10:13:27,929 INFO L273 TraceCheckUtils]: 38: Hoare triple {1867#(or (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1863#(or (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:13:27,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {1871#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1867#(or (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {1875#(or (not (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1871#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,948 INFO L273 TraceCheckUtils]: 35: Hoare triple {1879#(or (not (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1875#(or (not (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {1883#(or (bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1879#(or (not (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {1887#(or (not (bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1883#(or (bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:13:27,968 INFO L273 TraceCheckUtils]: 32: Hoare triple {1891#(or (bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1887#(or (not (bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {1895#(or (not (bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1891#(or (bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:13:27,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#(or (not (bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1895#(or (not (bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {1679#true} ~i~0 := 1bv32; {1899#(or (not (bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:13:27,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {1679#true} assume !~bvslt32(~i~0, 100000bv32); {1679#true} is VALID [2018-11-23 10:13:27,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {1679#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1679#true} is VALID [2018-11-23 10:13:27,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {1679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1679#true} is VALID [2018-11-23 10:13:27,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {1679#true} call #t~ret4 := main(); {1679#true} is VALID [2018-11-23 10:13:27,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1679#true} {1679#true} #60#return; {1679#true} is VALID [2018-11-23 10:13:27,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {1679#true} assume true; {1679#true} is VALID [2018-11-23 10:13:27,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1679#true} is VALID [2018-11-23 10:13:27,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2018-11-23 10:13:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:13:28,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-11-23 10:13:28,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:28,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:13:28,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:28,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:13:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:13:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:13:28,123 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-11-23 10:13:28,613 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2018-11-23 10:13:29,020 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-23 10:13:29,419 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:13:29,805 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2018-11-23 10:13:30,126 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 7 [2018-11-23 10:13:31,844 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 10:13:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:40,450 INFO L93 Difference]: Finished difference Result 145 states and 183 transitions. [2018-11-23 10:13:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 10:13:40,450 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-11-23 10:13:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:13:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 173 transitions. [2018-11-23 10:13:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:13:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 173 transitions. [2018-11-23 10:13:40,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 173 transitions. [2018-11-23 10:13:41,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:41,022 INFO L225 Difference]: With dead ends: 145 [2018-11-23 10:13:41,022 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 10:13:41,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=505, Invalid=901, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 10:13:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 10:13:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 65. [2018-11-23 10:13:41,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:41,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 65 states. [2018-11-23 10:13:41,184 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 65 states. [2018-11-23 10:13:41,184 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 65 states. [2018-11-23 10:13:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:41,192 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-11-23 10:13:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2018-11-23 10:13:41,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:41,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:41,193 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 135 states. [2018-11-23 10:13:41,194 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 135 states. [2018-11-23 10:13:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:41,201 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-11-23 10:13:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2018-11-23 10:13:41,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:41,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:41,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:41,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 10:13:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 10:13:41,205 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 48 [2018-11-23 10:13:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:41,205 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 10:13:41,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:13:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 10:13:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 10:13:41,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:41,207 INFO L402 BasicCegarLoop]: trace histogram [24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:41,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:41,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -634904154, now seen corresponding path program 4 times [2018-11-23 10:13:41,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:41,208 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:13:41,232 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:13:41,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:13:41,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:41,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:42,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {2668#true} call ULTIMATE.init(); {2668#true} is VALID [2018-11-23 10:13:42,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {2668#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2668#true} is VALID [2018-11-23 10:13:42,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID [2018-11-23 10:13:42,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #60#return; {2668#true} is VALID [2018-11-23 10:13:42,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {2668#true} call #t~ret4 := main(); {2668#true} is VALID [2018-11-23 10:13:42,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {2668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2688#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:42,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {2688#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2692#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {2692#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2696#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:42,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {2700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2704#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:42,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {2704#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2708#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {2708#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2712#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:42,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {2712#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2716#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {2716#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2720#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {2720#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2724#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:42,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {2724#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2728#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {2728#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2732#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {2732#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2736#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:13:42,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {2736#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2740#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {2740#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2744#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,207 INFO L273 TraceCheckUtils]: 20: Hoare triple {2744#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2748#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {2748#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2752#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:13:42,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {2752#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2756#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {2756#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2760#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {2760#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2764#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {2764#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2768#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {2768#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2772#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {2772#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2776#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:42,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {2776#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2669#false} is VALID [2018-11-23 10:13:42,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {2669#false} ~i~0 := 1bv32; {2669#false} is VALID [2018-11-23 10:13:42,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,221 INFO L273 TraceCheckUtils]: 49: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:42,222 INFO L273 TraceCheckUtils]: 54: Hoare triple {2669#false} assume !~bvslt32(~i~0, 100000bv32); {2669#false} is VALID [2018-11-23 10:13:42,222 INFO L273 TraceCheckUtils]: 55: Hoare triple {2669#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2669#false} is VALID [2018-11-23 10:13:42,222 INFO L273 TraceCheckUtils]: 56: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {2669#false} is VALID [2018-11-23 10:13:42,222 INFO L256 TraceCheckUtils]: 57: Hoare triple {2669#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2669#false} is VALID [2018-11-23 10:13:42,223 INFO L273 TraceCheckUtils]: 58: Hoare triple {2669#false} ~cond := #in~cond; {2669#false} is VALID [2018-11-23 10:13:42,223 INFO L273 TraceCheckUtils]: 59: Hoare triple {2669#false} assume 0bv32 == ~cond; {2669#false} is VALID [2018-11-23 10:13:42,223 INFO L273 TraceCheckUtils]: 60: Hoare triple {2669#false} assume !false; {2669#false} is VALID [2018-11-23 10:13:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 10:13:42,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:43,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {2669#false} assume !false; {2669#false} is VALID [2018-11-23 10:13:43,999 INFO L273 TraceCheckUtils]: 59: Hoare triple {2669#false} assume 0bv32 == ~cond; {2669#false} is VALID [2018-11-23 10:13:43,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {2669#false} ~cond := #in~cond; {2669#false} is VALID [2018-11-23 10:13:43,999 INFO L256 TraceCheckUtils]: 57: Hoare triple {2669#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2669#false} is VALID [2018-11-23 10:13:43,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(2bv32, ~j~0)))), 4bv32); {2669#false} is VALID [2018-11-23 10:13:43,999 INFO L273 TraceCheckUtils]: 55: Hoare triple {2669#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {2669#false} assume !~bvslt32(~i~0, 100000bv32); {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 51: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,000 INFO L273 TraceCheckUtils]: 49: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,003 INFO L273 TraceCheckUtils]: 35: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {2669#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2669#false} is VALID [2018-11-23 10:13:44,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {2669#false} ~i~0 := 1bv32; {2669#false} is VALID [2018-11-23 10:13:44,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {2972#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2669#false} is VALID [2018-11-23 10:13:44,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {2976#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2972#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:44,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {2980#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2976#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {2984#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2980#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {2988#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2984#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {2992#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2988#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {2996#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2992#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {3000#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2996#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {3004#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3000#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {3008#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3004#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {3012#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3008#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {3016#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3012#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {3020#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3016#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {3024#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3020#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {3028#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3024#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {3032#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3028#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {3036#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3032#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {3040#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3036#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {3044#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3040#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {3048#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3044#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {3052#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3048#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {3056#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3052#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {3060#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3056#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {2668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3060#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:44,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {2668#true} call #t~ret4 := main(); {2668#true} is VALID [2018-11-23 10:13:44,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #60#return; {2668#true} is VALID [2018-11-23 10:13:44,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID [2018-11-23 10:13:44,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {2668#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2668#true} is VALID [2018-11-23 10:13:44,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {2668#true} call ULTIMATE.init(); {2668#true} is VALID [2018-11-23 10:13:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 10:13:44,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:44,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:13:44,125 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2018-11-23 10:13:44,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:44,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:13:44,251 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:13:44,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:13:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:13:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:13:44,253 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 48 states. [2018-11-23 10:13:47,972 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:13:48,457 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:13:49,081 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:13:49,638 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:13:50,221 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:13:50,777 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:13:51,334 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:13:51,913 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:14:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:16,497 INFO L93 Difference]: Finished difference Result 192 states and 241 transitions. [2018-11-23 10:14:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:14:16,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2018-11-23 10:14:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 216 transitions. [2018-11-23 10:14:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 216 transitions. [2018-11-23 10:14:16,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 216 transitions. [2018-11-23 10:14:17,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:17,174 INFO L225 Difference]: With dead ends: 192 [2018-11-23 10:14:17,174 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 10:14:17,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:14:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 10:14:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2018-11-23 10:14:17,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:17,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 89 states. [2018-11-23 10:14:17,273 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 89 states. [2018-11-23 10:14:17,273 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 89 states. [2018-11-23 10:14:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:17,281 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-11-23 10:14:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-11-23 10:14:17,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:17,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:17,282 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 156 states. [2018-11-23 10:14:17,282 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 156 states. [2018-11-23 10:14:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:17,290 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-11-23 10:14:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-11-23 10:14:17,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:17,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:17,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:17,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 10:14:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-23 10:14:17,294 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 61 [2018-11-23 10:14:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:17,295 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-23 10:14:17,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:14:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-23 10:14:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 10:14:17,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:17,296 INFO L402 BasicCegarLoop]: trace histogram [46, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:17,296 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -95316058, now seen corresponding path program 5 times [2018-11-23 10:14:17,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:17,322 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1