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_copy5_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:54,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:54,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:54,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:54,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:54,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:54,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:54,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:54,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:54,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:54,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:54,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:54,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:54,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:54,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:54,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:54,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:54,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:54,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:54,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:54,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:54,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:54,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:54,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:54,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:54,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:54,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:54,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:54,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:54,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:54,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:54,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:54,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:54,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:54,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:54,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:54,806 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 09:54:54,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:54,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:54,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:54,831 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:54,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:54,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:54,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:54,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:54,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:54,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:54,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:54,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:54,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:54,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:54,833 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:54,833 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:54,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:54,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:54,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:54,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:54,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:54,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:54,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:54,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:54,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:54,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:54,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:54,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:54,836 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:54,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:54,836 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:54,837 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:54,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:54,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:54,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:54,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:54,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:54,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:54,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-23 09:54:54,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ac09fa6/a646316ca9e94a0a9e816aca26522b48/FLAG0565045e2 [2018-11-23 09:54:55,416 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,417 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-23 09:54:55,426 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ac09fa6/a646316ca9e94a0a9e816aca26522b48/FLAG0565045e2 [2018-11-23 09:54:55,803 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ac09fa6/a646316ca9e94a0a9e816aca26522b48 [2018-11-23 09:54:55,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:55,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:55,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:55,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:55,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:55,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1443edea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:55, skipping insertion in model container [2018-11-23 09:54:55,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:55,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,133 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,185 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,213 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (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 09:54:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,363 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 09:54:57,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:55" (1/3) ... [2018-11-23 09:54:57,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590a6000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590a6000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,372 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_false-unreach-call_ground.i [2018-11-23 09:54:57,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,392 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,412 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,450 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,451 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,451 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,451 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,452 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,452 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 09:54:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:54:57,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2095174276, now seen corresponding path program 1 times [2018-11-23 09:54:57,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,493 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 09:54:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-23 09:54:57,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {42#true} is VALID [2018-11-23 09:54:57,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-23 09:54:57,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #119#return; {42#true} is VALID [2018-11-23 09:54:57,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret16 := main(); {42#true} is VALID [2018-11-23 09:54:57,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {42#true} is VALID [2018-11-23 09:54:57,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-23 09:54:57,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#false} havoc ~i~0;~i~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 09:54:57,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 09:54:57,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 09:54:57,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 09:54:57,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 09:54:57,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {43#false} havoc ~x~0;~x~0 := 0bv32; {43#false} is VALID [2018-11-23 09:54:57,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {43#false} is VALID [2018-11-23 09:54:57,859 INFO L256 TraceCheckUtils]: 19: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {43#false} is VALID [2018-11-23 09:54:57,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2018-11-23 09:54:57,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {43#false} assume 0bv32 == ~cond; {43#false} is VALID [2018-11-23 09:54:57,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-23 09:54:57,865 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 09:54:57,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 09:54:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 09:54:57,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,945 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 09:54:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,177 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 09:54:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:58,178 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 09:54:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 09:54:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 09:54:58,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2018-11-23 09:54:58,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,775 INFO L225 Difference]: With dead ends: 70 [2018-11-23 09:54:58,775 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 09:54:58,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 09:54:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 09:54:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 09:54:58,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 09:54:58,996 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 09:54:58,996 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 09:54:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,002 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 09:54:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 09:54:59,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,003 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 09:54:59,003 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 09:54:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,009 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 09:54:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 09:54:59,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:59,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 09:54:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 09:54:59,016 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 09:54:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 09:54:59,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 09:54:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:54:59,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:59,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:59,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:59,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1625097866, now seen corresponding path program 1 times [2018-11-23 09:54:59,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:59,020 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 09:54:59,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 09:54:59,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {318#true} is VALID [2018-11-23 09:54:59,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 09:54:59,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #119#return; {318#true} is VALID [2018-11-23 09:54:59,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret16 := main(); {318#true} is VALID [2018-11-23 09:54:59,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {338#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#false} havoc ~i~0;~i~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {319#false} havoc ~x~0;~x~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {319#false} is VALID [2018-11-23 09:54:59,239 INFO L256 TraceCheckUtils]: 19: Hoare triple {319#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {319#false} is VALID [2018-11-23 09:54:59,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 09:54:59,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {319#false} assume 0bv32 == ~cond; {319#false} is VALID [2018-11-23 09:54:59,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 09:54:59,242 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 09:54:59,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 09:54:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:59,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 09:54:59,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:59,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:59,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,321 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-11-23 09:54:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,667 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 09:54:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:59,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 09:54:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 09:54:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 09:54:59,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 09:54:59,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,885 INFO L225 Difference]: With dead ends: 62 [2018-11-23 09:54:59,885 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:54:59,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 09:54:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:54:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 09:54:59,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:59,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 09:54:59,999 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 09:54:59,999 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 09:55:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,003 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 09:55:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 09:55:00,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,004 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 09:55:00,004 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 09:55:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,007 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 09:55:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 09:55:00,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 09:55:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 09:55:00,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2018-11-23 09:55:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,012 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 09:55:00,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 09:55:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:55:00,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,014 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1623092332, now seen corresponding path program 1 times [2018-11-23 09:55:00,017 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,017 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 09:55:00,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-23 09:55:00,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {594#true} is VALID [2018-11-23 09:55:00,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-23 09:55:00,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #119#return; {594#true} is VALID [2018-11-23 09:55:00,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret16 := main(); {594#true} is VALID [2018-11-23 09:55:00,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {614#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {614#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {614#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {621#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:00,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {621#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#false} havoc ~i~0;~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} havoc ~x~0;~x~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {595#false} is VALID [2018-11-23 09:55:00,222 INFO L256 TraceCheckUtils]: 21: Hoare triple {595#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {595#false} is VALID [2018-11-23 09:55:00,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-23 09:55:00,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {595#false} assume 0bv32 == ~cond; {595#false} is VALID [2018-11-23 09:55:00,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-23 09:55:00,225 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 09:55:00,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:00,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-23 09:55:00,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {595#false} assume 0bv32 == ~cond; {595#false} is VALID [2018-11-23 09:55:00,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-23 09:55:00,358 INFO L256 TraceCheckUtils]: 21: Hoare triple {595#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {595#false} is VALID [2018-11-23 09:55:00,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {595#false} is VALID [2018-11-23 09:55:00,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} havoc ~x~0;~x~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#false} havoc ~i~0;~i~0 := 0bv32; {595#false} is VALID [2018-11-23 09:55:00,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {595#false} is VALID [2018-11-23 09:55:00,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {721#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:00,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:00,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:00,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret16 := main(); {594#true} is VALID [2018-11-23 09:55:00,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #119#return; {594#true} is VALID [2018-11-23 09:55:00,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-23 09:55:00,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {594#true} is VALID [2018-11-23 09:55:00,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-23 09:55:00,370 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 09:55:00,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:00,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:00,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 09:55:00,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:00,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:00,548 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 6 states. [2018-11-23 09:55:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,906 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2018-11-23 09:55:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:00,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 09:55:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 09:55:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 09:55:00,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 09:55:01,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,070 INFO L225 Difference]: With dead ends: 67 [2018-11-23 09:55:01,070 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 09:55:01,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 09:55:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 09:55:01,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:01,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 09:55:01,108 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 09:55:01,108 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 09:55:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,112 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 09:55:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 09:55:01,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,114 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 09:55:01,114 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 09:55:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,116 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 09:55:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 09:55:01,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:01,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 09:55:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 09:55:01,120 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 25 [2018-11-23 09:55:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:01,121 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 09:55:01,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 09:55:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:55:01,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:01,123 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:01,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -213351186, now seen corresponding path program 2 times [2018-11-23 09:55:01,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:01,124 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 09:55:01,156 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:01,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:01,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {983#true} call ULTIMATE.init(); {983#true} is VALID [2018-11-23 09:55:01,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {983#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {983#true} is VALID [2018-11-23 09:55:01,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {983#true} assume true; {983#true} is VALID [2018-11-23 09:55:01,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {983#true} {983#true} #119#return; {983#true} is VALID [2018-11-23 09:55:01,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {983#true} call #t~ret16 := main(); {983#true} is VALID [2018-11-23 09:55:01,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {983#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {983#true} is VALID [2018-11-23 09:55:01,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {983#true} is VALID [2018-11-23 09:55:01,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 09:55:01,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {983#true} is VALID [2018-11-23 09:55:01,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 09:55:01,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {983#true} is VALID [2018-11-23 09:55:01,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 09:55:01,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {983#true} is VALID [2018-11-23 09:55:01,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 09:55:01,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {983#true} assume !~bvslt32(~a~0, 100000bv32); {983#true} is VALID [2018-11-23 09:55:01,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {983#true} havoc ~i~0;~i~0 := 0bv32; {1033#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {1033#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 09:55:01,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 09:55:01,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 09:55:01,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 09:55:01,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 09:55:01,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 09:55:01,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 09:55:01,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 09:55:01,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 09:55:01,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {984#false} havoc ~x~0;~x~0 := 0bv32; {984#false} is VALID [2018-11-23 09:55:01,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {984#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {984#false} is VALID [2018-11-23 09:55:01,358 INFO L256 TraceCheckUtils]: 27: Hoare triple {984#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {984#false} is VALID [2018-11-23 09:55:01,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {984#false} ~cond := #in~cond; {984#false} is VALID [2018-11-23 09:55:01,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {984#false} assume 0bv32 == ~cond; {984#false} is VALID [2018-11-23 09:55:01,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {984#false} assume !false; {984#false} is VALID [2018-11-23 09:55:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:01,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:01,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:55:01,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:01,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:01,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:01,408 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-23 09:55:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,641 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-23 09:55:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:01,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:55:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 09:55:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 09:55:01,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 09:55:01,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,888 INFO L225 Difference]: With dead ends: 74 [2018-11-23 09:55:01,888 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 09:55:01,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 09:55:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 09:55:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-23 09:55:01,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:01,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 46 states. [2018-11-23 09:55:01,934 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 46 states. [2018-11-23 09:55:01,934 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 46 states. [2018-11-23 09:55:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,937 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 09:55:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 09:55:01,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,939 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 51 states. [2018-11-23 09:55:01,939 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 51 states. [2018-11-23 09:55:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,942 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 09:55:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 09:55:01,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:01,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:55:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 09:55:01,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 31 [2018-11-23 09:55:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:01,947 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 09:55:01,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 09:55:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 09:55:01,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:01,948 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:01,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:01,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1237359932, now seen corresponding path program 1 times [2018-11-23 09:55:01,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:01,950 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 09:55:01,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:02,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 09:55:02,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 09:55:02,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 09:55:02,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #119#return; {1351#true} is VALID [2018-11-23 09:55:02,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret16 := main(); {1351#true} is VALID [2018-11-23 09:55:02,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1371#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1371#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1371#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1378#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {1378#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1378#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {1378#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1385#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {1385#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1385#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {1385#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1392#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {1392#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1392#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {1392#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1399#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:02,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {1399#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#false} havoc ~i~0;~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1352#false} is VALID [2018-11-23 09:55:02,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {1352#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1352#false} is VALID [2018-11-23 09:55:02,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1352#false} is VALID [2018-11-23 09:55:02,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1352#false} is VALID [2018-11-23 09:55:02,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1352#false} is VALID [2018-11-23 09:55:02,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1352#false} is VALID [2018-11-23 09:55:02,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1352#false} is VALID [2018-11-23 09:55:02,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1352#false} is VALID [2018-11-23 09:55:02,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {1352#false} is VALID [2018-11-23 09:55:02,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {1352#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {1352#false} is VALID [2018-11-23 09:55:02,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {1352#false} havoc ~x~0;~x~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {1352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1352#false} is VALID [2018-11-23 09:55:02,200 INFO L256 TraceCheckUtils]: 37: Hoare triple {1352#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {1352#false} is VALID [2018-11-23 09:55:02,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 09:55:02,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {1352#false} assume 0bv32 == ~cond; {1352#false} is VALID [2018-11-23 09:55:02,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 09:55:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 09:55:02,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:02,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 09:55:02,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {1352#false} assume 0bv32 == ~cond; {1352#false} is VALID [2018-11-23 09:55:02,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 09:55:02,438 INFO L256 TraceCheckUtils]: 37: Hoare triple {1352#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {1352#false} is VALID [2018-11-23 09:55:02,438 INFO L273 TraceCheckUtils]: 36: Hoare triple {1352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1352#false} is VALID [2018-11-23 09:55:02,438 INFO L273 TraceCheckUtils]: 35: Hoare triple {1352#false} havoc ~x~0;~x~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {1352#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {1352#false} is VALID [2018-11-23 09:55:02,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {1352#false} is VALID [2018-11-23 09:55:02,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,440 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1352#false} is VALID [2018-11-23 09:55:02,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1352#false} is VALID [2018-11-23 09:55:02,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1352#false} is VALID [2018-11-23 09:55:02,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1352#false} is VALID [2018-11-23 09:55:02,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1352#false} is VALID [2018-11-23 09:55:02,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1352#false} is VALID [2018-11-23 09:55:02,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {1352#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1352#false} is VALID [2018-11-23 09:55:02,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1352#false} is VALID [2018-11-23 09:55:02,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#false} havoc ~i~0;~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 09:55:02,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {1559#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1352#false} is VALID [2018-11-23 09:55:02,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1559#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:02,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret16 := main(); {1351#true} is VALID [2018-11-23 09:55:02,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #119#return; {1351#true} is VALID [2018-11-23 09:55:02,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 09:55:02,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 09:55:02,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 09:55:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 09:55:02,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:02,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:02,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 09:55:02,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:02,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:02,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:02,574 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 12 states. [2018-11-23 09:55:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,811 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2018-11-23 09:55:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:03,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 09:55:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 09:55:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 09:55:03,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2018-11-23 09:55:04,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,007 INFO L225 Difference]: With dead ends: 89 [2018-11-23 09:55:04,007 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 09:55:04,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 09:55:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 09:55:04,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:04,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:04,040 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:04,041 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,043 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 09:55:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 09:55:04,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,045 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:04,045 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,048 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 09:55:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 09:55:04,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:04,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 09:55:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 09:55:04,052 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2018-11-23 09:55:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:04,052 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 09:55:04,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 09:55:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 09:55:04,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:04,054 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:04,055 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:04,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 909668856, now seen corresponding path program 2 times [2018-11-23 09:55:04,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:04,056 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 09:55:04,076 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:04,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:04,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:04,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:04,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-23 09:55:04,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1948#true} is VALID [2018-11-23 09:55:04,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-23 09:55:04,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #119#return; {1948#true} is VALID [2018-11-23 09:55:04,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret16 := main(); {1948#true} is VALID [2018-11-23 09:55:04,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1968#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {1968#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1968#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {1968#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1975#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:04,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {1975#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1975#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:04,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {1975#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1982#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:04,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1982#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:04,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {1982#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1989#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:04,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1989#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:04,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1996#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:04,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {1996#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1996#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:04,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {1996#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2003#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:04,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {2003#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2003#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:04,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {2003#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2010#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:04,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {2010#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2010#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:04,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {2010#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2017#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:04,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {2017#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2017#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:04,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {2017#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2024#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:04,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2024#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:04,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {2024#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2031#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:04,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {2031#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2031#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:04,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {2031#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2038#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:04,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {2038#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {1949#false} havoc ~i~0;~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1949#false} is VALID [2018-11-23 09:55:04,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {1949#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1949#false} is VALID [2018-11-23 09:55:04,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1949#false} is VALID [2018-11-23 09:55:04,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {1949#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1949#false} is VALID [2018-11-23 09:55:04,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,518 INFO L273 TraceCheckUtils]: 35: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1949#false} is VALID [2018-11-23 09:55:04,519 INFO L273 TraceCheckUtils]: 37: Hoare triple {1949#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1949#false} is VALID [2018-11-23 09:55:04,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1949#false} is VALID [2018-11-23 09:55:04,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {1949#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1949#false} is VALID [2018-11-23 09:55:04,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {1949#false} is VALID [2018-11-23 09:55:04,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {1949#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {1949#false} is VALID [2018-11-23 09:55:04,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:04,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {1949#false} havoc ~x~0;~x~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:04,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {1949#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1949#false} is VALID [2018-11-23 09:55:04,523 INFO L256 TraceCheckUtils]: 49: Hoare triple {1949#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {1949#false} is VALID [2018-11-23 09:55:04,523 INFO L273 TraceCheckUtils]: 50: Hoare triple {1949#false} ~cond := #in~cond; {1949#false} is VALID [2018-11-23 09:55:04,523 INFO L273 TraceCheckUtils]: 51: Hoare triple {1949#false} assume 0bv32 == ~cond; {1949#false} is VALID [2018-11-23 09:55:04,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-23 09:55:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 09:55:04,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:05,253 INFO L273 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-23 09:55:05,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {1949#false} assume 0bv32 == ~cond; {1949#false} is VALID [2018-11-23 09:55:05,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {1949#false} ~cond := #in~cond; {1949#false} is VALID [2018-11-23 09:55:05,254 INFO L256 TraceCheckUtils]: 49: Hoare triple {1949#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {1949#false} is VALID [2018-11-23 09:55:05,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {1949#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1949#false} is VALID [2018-11-23 09:55:05,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {1949#false} havoc ~x~0;~x~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {1949#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {1949#false} is VALID [2018-11-23 09:55:05,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {1949#false} is VALID [2018-11-23 09:55:05,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {1949#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1949#false} is VALID [2018-11-23 09:55:05,256 INFO L273 TraceCheckUtils]: 40: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1949#false} is VALID [2018-11-23 09:55:05,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {1949#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1949#false} is VALID [2018-11-23 09:55:05,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1949#false} is VALID [2018-11-23 09:55:05,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {1949#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1949#false} is VALID [2018-11-23 09:55:05,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1949#false} is VALID [2018-11-23 09:55:05,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {1949#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1949#false} is VALID [2018-11-23 09:55:05,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1949#false} is VALID [2018-11-23 09:55:05,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {1949#false} havoc ~i~0;~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 09:55:05,260 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1949#false} is VALID [2018-11-23 09:55:05,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2198#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:05,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret16 := main(); {1948#true} is VALID [2018-11-23 09:55:05,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #119#return; {1948#true} is VALID [2018-11-23 09:55:05,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-23 09:55:05,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1948#true} is VALID [2018-11-23 09:55:05,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-23 09:55:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 09:55:05,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:05,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:55:05,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 09:55:05,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:05,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:55:05,579 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 09:55:05,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:55:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:55:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:55:05,580 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 24 states. [2018-11-23 09:55:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,174 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-11-23 09:55:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:55:10,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 09:55:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 09:55:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 09:55:10,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 126 transitions. [2018-11-23 09:55:10,397 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 09:55:10,399 INFO L225 Difference]: With dead ends: 113 [2018-11-23 09:55:10,399 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 09:55:10,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 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 09:55:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 09:55:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 09:55:10,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:10,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:10,434 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:10,434 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,438 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 09:55:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 09:55:10,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,438 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:10,439 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,442 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 09:55:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 09:55:10,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:10,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 09:55:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 09:55:10,446 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 53 [2018-11-23 09:55:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:10,446 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 09:55:10,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:55:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 09:55:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 09:55:10,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:10,447 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:10,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:10,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1141111200, now seen corresponding path program 3 times [2018-11-23 09:55:10,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:10,449 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 09:55:10,472 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:10,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 09:55:10,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:10,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:10,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2761#true} is VALID [2018-11-23 09:55:10,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2761#true} is VALID [2018-11-23 09:55:10,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2018-11-23 09:55:10,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #119#return; {2761#true} is VALID [2018-11-23 09:55:10,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret16 := main(); {2761#true} is VALID [2018-11-23 09:55:10,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {2761#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,841 INFO L273 TraceCheckUtils]: 39: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,843 INFO L273 TraceCheckUtils]: 45: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,844 INFO L273 TraceCheckUtils]: 50: Hoare triple {2761#true} assume !~bvslt32(~a~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,844 INFO L273 TraceCheckUtils]: 51: Hoare triple {2761#true} havoc ~i~0;~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,844 INFO L273 TraceCheckUtils]: 52: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2761#true} is VALID [2018-11-23 09:55:10,845 INFO L273 TraceCheckUtils]: 53: Hoare triple {2761#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2761#true} is VALID [2018-11-23 09:55:10,845 INFO L273 TraceCheckUtils]: 54: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,845 INFO L273 TraceCheckUtils]: 56: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2761#true} is VALID [2018-11-23 09:55:10,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {2761#true} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2761#true} is VALID [2018-11-23 09:55:10,846 INFO L273 TraceCheckUtils]: 58: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,846 INFO L273 TraceCheckUtils]: 59: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,846 INFO L273 TraceCheckUtils]: 60: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2761#true} is VALID [2018-11-23 09:55:10,847 INFO L273 TraceCheckUtils]: 61: Hoare triple {2761#true} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2761#true} is VALID [2018-11-23 09:55:10,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,854 INFO L273 TraceCheckUtils]: 63: Hoare triple {2761#true} ~i~0 := 0bv32; {2955#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,855 INFO L273 TraceCheckUtils]: 64: Hoare triple {2955#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {2955#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,857 INFO L273 TraceCheckUtils]: 65: Hoare triple {2955#(= main_~i~0 (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2962#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:10,857 INFO L273 TraceCheckUtils]: 66: Hoare triple {2962#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 09:55:10,858 INFO L273 TraceCheckUtils]: 67: Hoare triple {2762#false} ~i~0 := 0bv32; {2762#false} is VALID [2018-11-23 09:55:10,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {2762#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {2762#false} is VALID [2018-11-23 09:55:10,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {2762#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {2762#false} is VALID [2018-11-23 09:55:10,858 INFO L273 TraceCheckUtils]: 70: Hoare triple {2762#false} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 09:55:10,859 INFO L273 TraceCheckUtils]: 71: Hoare triple {2762#false} havoc ~x~0;~x~0 := 0bv32; {2762#false} is VALID [2018-11-23 09:55:10,859 INFO L273 TraceCheckUtils]: 72: Hoare triple {2762#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2762#false} is VALID [2018-11-23 09:55:10,859 INFO L256 TraceCheckUtils]: 73: Hoare triple {2762#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {2762#false} is VALID [2018-11-23 09:55:10,859 INFO L273 TraceCheckUtils]: 74: Hoare triple {2762#false} ~cond := #in~cond; {2762#false} is VALID [2018-11-23 09:55:10,860 INFO L273 TraceCheckUtils]: 75: Hoare triple {2762#false} assume 0bv32 == ~cond; {2762#false} is VALID [2018-11-23 09:55:10,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2018-11-23 09:55:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-23 09:55:10,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 76: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 75: Hoare triple {2762#false} assume 0bv32 == ~cond; {2762#false} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 74: Hoare triple {2762#false} ~cond := #in~cond; {2762#false} is VALID [2018-11-23 09:55:10,967 INFO L256 TraceCheckUtils]: 73: Hoare triple {2762#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {2762#false} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 72: Hoare triple {2762#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2762#false} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 71: Hoare triple {2762#false} havoc ~x~0;~x~0 := 0bv32; {2762#false} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 70: Hoare triple {2762#false} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {2762#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {2762#false} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {2762#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {2762#false} is VALID [2018-11-23 09:55:10,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {2762#false} ~i~0 := 0bv32; {2762#false} is VALID [2018-11-23 09:55:10,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {3026#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 09:55:10,970 INFO L273 TraceCheckUtils]: 65: Hoare triple {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3026#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:10,970 INFO L273 TraceCheckUtils]: 64: Hoare triple {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 63: Hoare triple {2761#true} ~i~0 := 0bv32; {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 62: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 61: Hoare triple {2761#true} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2761#true} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 60: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2761#true} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 59: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,971 INFO L273 TraceCheckUtils]: 57: Hoare triple {2761#true} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {2761#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {2761#true} havoc ~i~0;~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {2761#true} assume !~bvslt32(~a~0, 100000bv32); {2761#true} is VALID [2018-11-23 09:55:10,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,973 INFO L273 TraceCheckUtils]: 45: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,974 INFO L273 TraceCheckUtils]: 43: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,974 INFO L273 TraceCheckUtils]: 42: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,974 INFO L273 TraceCheckUtils]: 41: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 25: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 09:55:10,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {2761#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret16 := main(); {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #119#return; {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2761#true} is VALID [2018-11-23 09:55:10,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2761#true} is VALID [2018-11-23 09:55:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-23 09:55:10,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:10,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 09:55:10,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:10,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:11,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:11,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:11,058 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 6 states. [2018-11-23 09:55:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:11,648 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2018-11-23 09:55:11,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:11,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 09:55:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-23 09:55:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-23 09:55:11,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2018-11-23 09:55:11,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:11,891 INFO L225 Difference]: With dead ends: 139 [2018-11-23 09:55:11,891 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 09:55:11,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 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 09:55:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 09:55:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 09:55:11,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:11,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 09:55:11,963 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:55:11,964 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:55:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:11,967 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 09:55:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 09:55:11,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:11,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:11,967 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:55:11,968 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:55:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:11,971 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 09:55:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 09:55:11,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:11,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:11,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:11,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 09:55:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 09:55:11,974 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 77 [2018-11-23 09:55:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:11,974 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 09:55:11,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 09:55:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 09:55:11,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:11,976 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:11,976 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:11,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 16544226, now seen corresponding path program 4 times [2018-11-23 09:55:11,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:11,977 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 09:55:12,003 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:55:12,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:55:12,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:12,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:12,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {3827#true} call ULTIMATE.init(); {3827#true} is VALID [2018-11-23 09:55:12,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {3827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3827#true} is VALID [2018-11-23 09:55:12,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {3827#true} assume true; {3827#true} is VALID [2018-11-23 09:55:12,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3827#true} {3827#true} #119#return; {3827#true} is VALID [2018-11-23 09:55:12,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {3827#true} call #t~ret16 := main(); {3827#true} is VALID [2018-11-23 09:55:12,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {3827#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3847#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:12,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {3847#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3847#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:12,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {3847#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3854#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:12,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {3854#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3854#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:12,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {3854#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3861#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:12,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3861#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:12,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {3861#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3868#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:12,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {3868#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3868#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:12,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {3868#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3875#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:12,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {3875#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3875#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:12,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {3875#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3882#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:12,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {3882#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3882#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:12,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {3882#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3889#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:12,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {3889#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3889#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:12,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {3889#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3896#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:12,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {3896#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3896#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:12,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {3896#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3903#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:12,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {3903#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3903#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:12,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {3903#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3910#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:12,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {3910#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3910#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:12,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {3910#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3917#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:12,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {3917#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3917#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:12,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {3917#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3924#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:12,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {3924#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3924#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:12,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {3924#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3931#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:12,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {3931#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3931#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:12,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {3931#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3938#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:12,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {3938#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3938#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:12,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {3938#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3945#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:12,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {3945#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3945#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:12,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {3945#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3952#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:12,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {3952#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3952#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:12,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {3952#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3959#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:12,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {3959#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3959#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:12,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {3959#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3966#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:12,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {3966#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3966#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:12,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {3966#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3973#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:12,785 INFO L273 TraceCheckUtils]: 42: Hoare triple {3973#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3973#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:12,788 INFO L273 TraceCheckUtils]: 43: Hoare triple {3973#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3980#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:12,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {3980#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3980#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:12,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {3980#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3987#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:12,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {3987#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3987#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:12,800 INFO L273 TraceCheckUtils]: 47: Hoare triple {3987#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3994#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:12,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {3994#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3994#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:12,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {3994#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4001#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 09:55:12,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {4001#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {3828#false} havoc ~i~0;~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:12,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:12,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:12,802 INFO L273 TraceCheckUtils]: 55: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:12,802 INFO L273 TraceCheckUtils]: 56: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:12,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:12,803 INFO L273 TraceCheckUtils]: 58: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:12,803 INFO L273 TraceCheckUtils]: 59: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:12,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,803 INFO L273 TraceCheckUtils]: 61: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 66: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:12,804 INFO L273 TraceCheckUtils]: 67: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:12,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:12,805 INFO L273 TraceCheckUtils]: 69: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:12,805 INFO L273 TraceCheckUtils]: 70: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,805 INFO L273 TraceCheckUtils]: 71: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,805 INFO L273 TraceCheckUtils]: 72: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 73: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 77: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:12,806 INFO L273 TraceCheckUtils]: 78: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 81: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 83: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:12,807 INFO L273 TraceCheckUtils]: 84: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 85: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 88: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 89: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:12,808 INFO L273 TraceCheckUtils]: 90: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,809 INFO L273 TraceCheckUtils]: 91: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,809 INFO L273 TraceCheckUtils]: 92: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:12,809 INFO L273 TraceCheckUtils]: 93: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:12,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:12,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 96: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 97: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 98: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 99: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 100: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:12,810 INFO L273 TraceCheckUtils]: 101: Hoare triple {3828#false} havoc ~x~0;~x~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:12,811 INFO L273 TraceCheckUtils]: 102: Hoare triple {3828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3828#false} is VALID [2018-11-23 09:55:12,811 INFO L256 TraceCheckUtils]: 103: Hoare triple {3828#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {3828#false} is VALID [2018-11-23 09:55:12,811 INFO L273 TraceCheckUtils]: 104: Hoare triple {3828#false} ~cond := #in~cond; {3828#false} is VALID [2018-11-23 09:55:12,811 INFO L273 TraceCheckUtils]: 105: Hoare triple {3828#false} assume 0bv32 == ~cond; {3828#false} is VALID [2018-11-23 09:55:12,811 INFO L273 TraceCheckUtils]: 106: Hoare triple {3828#false} assume !false; {3828#false} is VALID [2018-11-23 09:55:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 09:55:12,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:15,231 INFO L273 TraceCheckUtils]: 106: Hoare triple {3828#false} assume !false; {3828#false} is VALID [2018-11-23 09:55:15,232 INFO L273 TraceCheckUtils]: 105: Hoare triple {3828#false} assume 0bv32 == ~cond; {3828#false} is VALID [2018-11-23 09:55:15,232 INFO L273 TraceCheckUtils]: 104: Hoare triple {3828#false} ~cond := #in~cond; {3828#false} is VALID [2018-11-23 09:55:15,233 INFO L256 TraceCheckUtils]: 103: Hoare triple {3828#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1bv32 else 0bv32)); {3828#false} is VALID [2018-11-23 09:55:15,233 INFO L273 TraceCheckUtils]: 102: Hoare triple {3828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem14 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem15 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3828#false} is VALID [2018-11-23 09:55:15,233 INFO L273 TraceCheckUtils]: 101: Hoare triple {3828#false} havoc ~x~0;~x~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,233 INFO L273 TraceCheckUtils]: 100: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 99: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 98: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 97: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 96: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 95: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 94: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 93: Hoare triple {3828#false} #t~post11 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post11);havoc #t~post11; {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 92: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem12, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem12; {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 90: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 89: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 88: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 87: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 86: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 85: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 84: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 83: Hoare triple {3828#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3828#false} is VALID [2018-11-23 09:55:15,236 INFO L273 TraceCheckUtils]: 82: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 81: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 80: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:15,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:15,238 INFO L273 TraceCheckUtils]: 75: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:15,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:15,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {3828#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3828#false} is VALID [2018-11-23 09:55:15,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3828#false} is VALID [2018-11-23 09:55:15,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:15,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:15,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:15,240 INFO L273 TraceCheckUtils]: 66: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:15,240 INFO L273 TraceCheckUtils]: 65: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:15,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:15,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {3828#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3828#false} is VALID [2018-11-23 09:55:15,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3828#false} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:15,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:15,242 INFO L273 TraceCheckUtils]: 55: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:15,242 INFO L273 TraceCheckUtils]: 54: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:15,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {3828#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3828#false} is VALID [2018-11-23 09:55:15,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3828#false} is VALID [2018-11-23 09:55:15,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {3828#false} havoc ~i~0;~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 09:55:15,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {4341#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3828#false} is VALID [2018-11-23 09:55:15,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4341#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:15,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,271 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,313 INFO L273 TraceCheckUtils]: 30: Hoare triple {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {3827#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {3827#true} call #t~ret16 := main(); {3827#true} is VALID [2018-11-23 09:55:15,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3827#true} {3827#true} #119#return; {3827#true} is VALID [2018-11-23 09:55:15,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {3827#true} assume true; {3827#true} is VALID [2018-11-23 09:55:15,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {3827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3827#true} is VALID [2018-11-23 09:55:15,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {3827#true} call ULTIMATE.init(); {3827#true} is VALID [2018-11-23 09:55:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 09:55:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:15,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:55:15,438 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 09:55:15,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:15,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:55:15,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:15,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:55:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:55:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:55:15,778 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 48 states. [2018-11-23 09:55:23,764 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:55:24,259 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:55:24,759 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:55:25,284 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:55:25,853 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:55:26,425 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:55:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:35,556 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2018-11-23 09:55:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:55:35,556 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 09:55:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 186 transitions. [2018-11-23 09:55:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 186 transitions. [2018-11-23 09:55:35,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 186 transitions. [2018-11-23 09:55:35,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:35,972 INFO L225 Difference]: With dead ends: 221 [2018-11-23 09:55:35,972 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 09:55:35,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:55:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 09:55:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-23 09:55:36,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:36,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-23 09:55:36,049 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 09:55:36,049 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 09:55:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:36,055 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-11-23 09:55:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 09:55:36,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:36,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:36,057 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 09:55:36,057 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 09:55:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:36,062 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-11-23 09:55:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 09:55:36,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:36,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:36,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:36,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 09:55:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 166 transitions. [2018-11-23 09:55:36,069 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 166 transitions. Word has length 107 [2018-11-23 09:55:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:36,070 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 166 transitions. [2018-11-23 09:55:36,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:55:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 09:55:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 09:55:36,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:36,072 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:36,073 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:36,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash -369613134, now seen corresponding path program 5 times [2018-11-23 09:55:36,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:36,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:36,100 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1