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/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:54,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:54,430 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:54,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:54,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:54,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:54,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:54,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:54,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:54,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:54,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:54,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:54,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:54,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:54,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:54,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:54,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:54,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:54,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:54,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:54,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:54,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:54,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:54,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:54,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:54,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:54,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:54,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:54,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:54,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:54,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:54,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:54,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:54,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:54,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:54,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:54,500 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 11:30:54,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:54,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:54,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:54,516 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:54,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:54,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:54,517 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:54,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:54,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:54,519 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:54,519 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:54,519 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:54,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:54,519 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:54,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:54,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:54,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:54,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:54,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:54,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:54,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:54,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:54,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:54,521 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:54,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:54,522 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:54,522 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:54,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:54,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:54,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:54,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:54,599 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:54,600 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:54,600 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 11:30:54,674 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb625b4f/67a3b56ec52b42c6bf17804a36aeda8e/FLAGd5124cb3d [2018-11-23 11:30:55,186 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:55,186 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 11:30:55,193 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb625b4f/67a3b56ec52b42c6bf17804a36aeda8e/FLAGd5124cb3d [2018-11-23 11:30:55,522 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb625b4f/67a3b56ec52b42c6bf17804a36aeda8e [2018-11-23 11:30:55,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:55,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:55,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:55,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:55,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:55,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2193ab3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55, skipping insertion in model container [2018-11-23 11:30:55,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:55,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:55,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:55,797 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:55,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:55,850 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:55,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55 WrapperNode [2018-11-23 11:30:55,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:55,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:55,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:55,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:55,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:55,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:55,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:55,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:55,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2018-11-23 11:30:55,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:55,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:55,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:55,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:55,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (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 11:30:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:56,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:30:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:30:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:30:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:30:56,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:56,621 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:30:56,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:56 BoogieIcfgContainer [2018-11-23 11:30:56,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:56,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:56,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:56,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:56,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:55" (1/3) ... [2018-11-23 11:30:56,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6952e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:56, skipping insertion in model container [2018-11-23 11:30:56,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (2/3) ... [2018-11-23 11:30:56,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6952e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:56, skipping insertion in model container [2018-11-23 11:30:56,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:56" (3/3) ... [2018-11-23 11:30:56,632 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 11:30:56,642 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:56,649 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:56,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:56,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:56,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:56,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:56,705 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:56,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:56,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:56,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:56,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:56,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:30:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:30:56,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:56,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:56,736 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:56,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2018-11-23 11:30:56,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:56,749 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 11:30:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:56,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:56,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:30:56,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:30:56,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:30:56,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-23 11:30:56,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-23 11:30:56,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {27#true} is VALID [2018-11-23 11:30:56,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 11:30:56,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~index~0 := 0bv32; {28#false} is VALID [2018-11-23 11:30:56,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {28#false} is VALID [2018-11-23 11:30:56,907 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 11:30:56,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 11:30:56,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 11:30:56,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:30:56,911 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 11:30:56,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:56,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:30:56,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:30:56,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:56,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:30:57,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:30:57,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:30:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:30:57,050 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 11:30:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:57,291 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 11:30:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:30:57,292 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:30:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:30:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:30:57,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 11:30:57,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:57,525 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:30:57,525 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:30:57,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 11:30:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:30:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:30:57,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:57,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:30:57,607 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:30:57,607 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:30:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:57,611 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:30:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:30:57,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:57,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:57,612 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:30:57,612 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:30:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:57,616 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:30:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:30:57,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:57,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:57,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:57,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:30:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:30:57,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 11:30:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:57,622 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:30:57,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:30:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:30:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:30:57,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:57,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:57,623 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:57,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2018-11-23 11:30:57,624 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:57,625 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 11:30:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:57,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:57,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 11:30:57,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {183#true} is VALID [2018-11-23 11:30:57,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:30:57,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #49#return; {183#true} is VALID [2018-11-23 11:30:57,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret5 := main(); {183#true} is VALID [2018-11-23 11:30:57,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {203#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:57,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {203#(= (_ bv0 32) main_~index~0)} assume !~bvult32(~index~0, 10000bv32); {184#false} is VALID [2018-11-23 11:30:57,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {184#false} ~index~0 := 0bv32; {184#false} is VALID [2018-11-23 11:30:57,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {184#false} is VALID [2018-11-23 11:30:57,852 INFO L256 TraceCheckUtils]: 9: Hoare triple {184#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {184#false} is VALID [2018-11-23 11:30:57,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2018-11-23 11:30:57,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {184#false} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 11:30:57,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 11:30:57,855 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 11:30:57,855 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:57,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:57,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:30:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:30:57,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:57,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:30:57,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:57,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:30:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:30:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:57,891 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 11:30:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,027 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:30:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:30:58,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:30:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 11:30:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 11:30:58,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-23 11:30:58,339 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 11:30:58,341 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:30:58,341 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:30:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 11:30:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:30:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-23 11:30:58,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:58,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 20 states. [2018-11-23 11:30:58,463 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 20 states. [2018-11-23 11:30:58,463 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 20 states. [2018-11-23 11:30:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,467 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:30:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:30:58,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:58,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:58,468 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states. [2018-11-23 11:30:58,469 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states. [2018-11-23 11:30:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,472 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:30:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:30:58,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:58,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:58,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:58,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:30:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:30:58,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 11:30:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:58,476 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:30:58,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:30:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:30:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:30:58,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:58,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:58,477 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:58,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2018-11-23 11:30:58,478 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:58,479 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 11:30:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:58,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:58,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-23 11:30:58,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {353#true} is VALID [2018-11-23 11:30:58,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 11:30:58,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #49#return; {353#true} is VALID [2018-11-23 11:30:58,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret5 := main(); {353#true} is VALID [2018-11-23 11:30:58,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {373#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:58,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {373#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:58,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#(= (_ bv0 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {380#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:58,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~index~0, 10000bv32); {354#false} is VALID [2018-11-23 11:30:58,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {354#false} ~index~0 := 0bv32; {354#false} is VALID [2018-11-23 11:30:58,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {354#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {354#false} is VALID [2018-11-23 11:30:58,630 INFO L256 TraceCheckUtils]: 11: Hoare triple {354#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {354#false} is VALID [2018-11-23 11:30:58,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2018-11-23 11:30:58,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {354#false} assume 0bv32 == ~cond; {354#false} is VALID [2018-11-23 11:30:58,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-23 11:30:58,633 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 11:30:58,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:58,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-23 11:30:58,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {354#false} assume 0bv32 == ~cond; {354#false} is VALID [2018-11-23 11:30:58,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2018-11-23 11:30:58,778 INFO L256 TraceCheckUtils]: 11: Hoare triple {354#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {354#false} is VALID [2018-11-23 11:30:58,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {354#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {354#false} is VALID [2018-11-23 11:30:58,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {354#false} ~index~0 := 0bv32; {354#false} is VALID [2018-11-23 11:30:58,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#(bvult main_~index~0 (_ bv10000 32))} assume !~bvult32(~index~0, 10000bv32); {354#false} is VALID [2018-11-23 11:30:58,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {420#(bvult main_~index~0 (_ bv10000 32))} is VALID [2018-11-23 11:30:58,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {424#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:30:58,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {424#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:30:58,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret5 := main(); {353#true} is VALID [2018-11-23 11:30:58,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #49#return; {353#true} is VALID [2018-11-23 11:30:58,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 11:30:58,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {353#true} is VALID [2018-11-23 11:30:58,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-23 11:30:58,786 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 11:30:58,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:58,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:30:58,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:30:58,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:58,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:58,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:58,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:58,872 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 11:30:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:59,450 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 11:30:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:30:59,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:30:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 11:30:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 11:30:59,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 11:30:59,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:59,605 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:30:59,605 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:30:59,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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 11:30:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:30:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-11-23 11:30:59,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:59,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 26 states. [2018-11-23 11:30:59,631 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 26 states. [2018-11-23 11:30:59,632 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 26 states. [2018-11-23 11:30:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:59,636 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:30:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:30:59,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:59,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:59,637 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 39 states. [2018-11-23 11:30:59,638 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 39 states. [2018-11-23 11:30:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:59,642 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:30:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:30:59,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:59,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:59,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:59,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:30:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:30:59,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 15 [2018-11-23 11:30:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:59,646 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:30:59,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:30:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:30:59,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:59,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:59,648 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:59,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1149264150, now seen corresponding path program 2 times [2018-11-23 11:30:59,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:59,649 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 11:30:59,666 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:30:59,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:30:59,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:59,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:59,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {638#true} call ULTIMATE.init(); {638#true} is VALID [2018-11-23 11:30:59,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {638#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {638#true} is VALID [2018-11-23 11:30:59,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {638#true} assume true; {638#true} is VALID [2018-11-23 11:30:59,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {638#true} {638#true} #49#return; {638#true} is VALID [2018-11-23 11:30:59,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {638#true} call #t~ret5 := main(); {638#true} is VALID [2018-11-23 11:30:59,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {638#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {658#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:59,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {658#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {658#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:59,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {658#(= (_ bv0 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {665#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:59,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {665#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {665#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:59,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {665#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {672#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:59,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {672#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:59,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {679#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:30:59,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {679#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {679#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:30:59,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {679#(= (_ bv3 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {686#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:59,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {686#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvult32(~index~0, 10000bv32); {639#false} is VALID [2018-11-23 11:30:59,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {639#false} ~index~0 := 0bv32; {639#false} is VALID [2018-11-23 11:30:59,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {639#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {639#false} is VALID [2018-11-23 11:30:59,921 INFO L256 TraceCheckUtils]: 17: Hoare triple {639#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {639#false} is VALID [2018-11-23 11:30:59,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {639#false} ~cond := #in~cond; {639#false} is VALID [2018-11-23 11:30:59,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {639#false} assume 0bv32 == ~cond; {639#false} is VALID [2018-11-23 11:30:59,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {639#false} assume !false; {639#false} is VALID [2018-11-23 11:30:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:59,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:00,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {639#false} assume !false; {639#false} is VALID [2018-11-23 11:31:00,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {639#false} assume 0bv32 == ~cond; {639#false} is VALID [2018-11-23 11:31:00,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {639#false} ~cond := #in~cond; {639#false} is VALID [2018-11-23 11:31:00,145 INFO L256 TraceCheckUtils]: 17: Hoare triple {639#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {639#false} is VALID [2018-11-23 11:31:00,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {639#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {639#false} is VALID [2018-11-23 11:31:00,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {639#false} ~index~0 := 0bv32; {639#false} is VALID [2018-11-23 11:31:00,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {726#(bvult main_~index~0 (_ bv10000 32))} assume !~bvult32(~index~0, 10000bv32); {639#false} is VALID [2018-11-23 11:31:00,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {726#(bvult main_~index~0 (_ bv10000 32))} is VALID [2018-11-23 11:31:00,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {730#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {730#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {737#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {730#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {737#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {744#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {737#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {744#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {744#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {751#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {744#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {751#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {751#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {638#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {751#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:00,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {638#true} call #t~ret5 := main(); {638#true} is VALID [2018-11-23 11:31:00,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {638#true} {638#true} #49#return; {638#true} is VALID [2018-11-23 11:31:00,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {638#true} assume true; {638#true} is VALID [2018-11-23 11:31:00,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {638#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {638#true} is VALID [2018-11-23 11:31:00,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {638#true} call ULTIMATE.init(); {638#true} is VALID [2018-11-23 11:31:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:00,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:00,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:31:00,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 11:31:00,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:00,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:31:00,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:00,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:31:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:31:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:31:00,243 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-23 11:31:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:02,176 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2018-11-23 11:31:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:31:02,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 11:31:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:31:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 102 transitions. [2018-11-23 11:31:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:31:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 102 transitions. [2018-11-23 11:31:02,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 102 transitions. [2018-11-23 11:31:02,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:02,409 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:31:02,409 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:31:02,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:31:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:31:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2018-11-23 11:31:02,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:02,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 38 states. [2018-11-23 11:31:02,464 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 38 states. [2018-11-23 11:31:02,464 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 38 states. [2018-11-23 11:31:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:02,470 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-23 11:31:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-23 11:31:02,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:02,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:02,472 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 75 states. [2018-11-23 11:31:02,473 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 75 states. [2018-11-23 11:31:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:02,478 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-23 11:31:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-23 11:31:02,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:02,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:02,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:02,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:31:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 11:31:02,483 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 21 [2018-11-23 11:31:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:02,484 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 11:31:02,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:31:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 11:31:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:31:02,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:02,485 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:02,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:02,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1253693154, now seen corresponding path program 3 times [2018-11-23 11:31:02,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:02,487 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 11:31:02,516 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:31:03,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:31:03,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:31:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:03,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:03,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 11:31:03,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1115#true} is VALID [2018-11-23 11:31:03,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 11:31:03,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #49#return; {1115#true} is VALID [2018-11-23 11:31:03,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret5 := main(); {1115#true} is VALID [2018-11-23 11:31:03,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {1135#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:03,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {1135#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1135#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:03,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {1135#(= (_ bv0 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1142#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {1142#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1142#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {1142#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1149#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {1149#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1149#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {1149#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1156#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:03,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {1156#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1156#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:03,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {1156#(= (_ bv3 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1163#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {1163#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1163#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {1163#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1170#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {1170#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1170#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1177#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1177#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1184#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:03,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {1184#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1184#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:03,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {1184#(= (_ bv7 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1191#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1191#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1198#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:03,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {1198#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1198#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:03,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {1198#(= (_ bv9 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1205#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:03,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {1205#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvult32(~index~0, 10000bv32); {1116#false} is VALID [2018-11-23 11:31:03,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} ~index~0 := 0bv32; {1116#false} is VALID [2018-11-23 11:31:03,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1116#false} is VALID [2018-11-23 11:31:03,380 INFO L256 TraceCheckUtils]: 29: Hoare triple {1116#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {1116#false} is VALID [2018-11-23 11:31:03,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 11:31:03,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {1116#false} assume 0bv32 == ~cond; {1116#false} is VALID [2018-11-23 11:31:03,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 11:31:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:03,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:04,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 11:31:04,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {1116#false} assume 0bv32 == ~cond; {1116#false} is VALID [2018-11-23 11:31:04,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 11:31:04,522 INFO L256 TraceCheckUtils]: 29: Hoare triple {1116#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {1116#false} is VALID [2018-11-23 11:31:04,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1116#false} is VALID [2018-11-23 11:31:04,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} ~index~0 := 0bv32; {1116#false} is VALID [2018-11-23 11:31:04,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {1245#(bvult main_~index~0 (_ bv10000 32))} assume !~bvult32(~index~0, 10000bv32); {1116#false} is VALID [2018-11-23 11:31:04,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {1249#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1245#(bvult main_~index~0 (_ bv10000 32))} is VALID [2018-11-23 11:31:04,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {1253#(or (not (bvult main_~index~0 (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1249#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:04,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {1257#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32)))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1253#(or (not (bvult main_~index~0 (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {1257#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1257#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32)))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1257#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1264#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {1271#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1264#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1271#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1271#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#(or (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32)))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1271#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#(or (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1278#(or (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {1285#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32)))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1278#(or (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {1285#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1285#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {1292#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32)))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1285#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,555 INFO L273 TraceCheckUtils]: 12: Hoare triple {1292#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32)))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1292#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {1299#(or (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1292#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32)))} is VALID [2018-11-23 11:31:04,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {1299#(or (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1299#(or (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {1306#(or (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1299#(or (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1306#(or (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1306#(or (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#(or (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1306#(or (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {1313#(or (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1313#(or (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {1313#(or (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32)) (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))))} is VALID [2018-11-23 11:31:04,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret5 := main(); {1115#true} is VALID [2018-11-23 11:31:04,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #49#return; {1115#true} is VALID [2018-11-23 11:31:04,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 11:31:04,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1115#true} is VALID [2018-11-23 11:31:04,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 11:31:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-23 11:31:04,586 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2018-11-23 11:31:04,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:04,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:31:04,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:04,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:31:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:31:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:31:04,719 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 25 states. [2018-11-23 11:31:06,706 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:31:06,936 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:31:08,753 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:31:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:13,696 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-11-23 11:31:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:31:13,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2018-11-23 11:31:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 192 transitions. [2018-11-23 11:31:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 192 transitions. [2018-11-23 11:31:13,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 192 transitions. [2018-11-23 11:31:14,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:14,179 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:31:14,179 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 11:31:14,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:31:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 11:31:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 62. [2018-11-23 11:31:14,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:14,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 62 states. [2018-11-23 11:31:14,279 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 62 states. [2018-11-23 11:31:14,279 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 62 states. [2018-11-23 11:31:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:14,287 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2018-11-23 11:31:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-11-23 11:31:14,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:14,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:14,289 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 147 states. [2018-11-23 11:31:14,290 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 147 states. [2018-11-23 11:31:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:14,298 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2018-11-23 11:31:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-11-23 11:31:14,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:14,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:14,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:14,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:31:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 11:31:14,302 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 33 [2018-11-23 11:31:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:14,303 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 11:31:14,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:31:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 11:31:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:31:14,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:14,305 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:14,305 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1253887098, now seen corresponding path program 4 times [2018-11-23 11:31:14,306 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:14,306 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 11:31:14,332 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:31:14,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:31:14,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:31:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:14,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:14,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {1979#true} call ULTIMATE.init(); {1979#true} is VALID [2018-11-23 11:31:14,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {1979#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1979#true} is VALID [2018-11-23 11:31:14,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {1979#true} assume true; {1979#true} is VALID [2018-11-23 11:31:14,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1979#true} {1979#true} #49#return; {1979#true} is VALID [2018-11-23 11:31:14,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {1979#true} call #t~ret5 := main(); {1979#true} is VALID [2018-11-23 11:31:14,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {1979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {1999#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:14,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {1999#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1999#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:14,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {1999#(= (_ bv0 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2006#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:14,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {2006#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2006#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {2006#(= (bvadd main_~index~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2013#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {2013#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2013#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {2013#(= (bvadd main_~index~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2020#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:15,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {2020#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2020#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:15,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {2020#(= (_ bv3 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2027#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {2027#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2027#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {2027#(= (bvadd main_~index~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2034#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {2034#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2034#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {2034#(= (bvadd main_~index~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2041#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {2041#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2041#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {2041#(= (bvadd main_~index~0 (_ bv4294967290 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2048#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:15,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {2048#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2048#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:15,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {2048#(= (_ bv7 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2055#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {2055#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2055#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {2055#(= (bvadd main_~index~0 (_ bv4294967288 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2062#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:15,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {2062#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2062#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:15,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {2062#(= (_ bv9 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2069#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {2069#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2069#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {2069#(= (bvadd main_~index~0 (_ bv4294967286 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2076#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-23 11:31:15,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {2076#(= (_ bv11 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2076#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-23 11:31:15,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {2076#(= (_ bv11 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2083#(= (bvadd main_~index~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {2083#(= (bvadd main_~index~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2083#(= (bvadd main_~index~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {2083#(= (bvadd main_~index~0 (_ bv4294967284 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2090#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-23 11:31:15,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {2090#(= (_ bv13 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2090#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-23 11:31:15,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {2090#(= (_ bv13 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2097#(= (bvadd main_~index~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {2097#(= (bvadd main_~index~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2097#(= (bvadd main_~index~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {2097#(= (bvadd main_~index~0 (_ bv4294967282 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2104#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-23 11:31:15,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {2104#(= (_ bv15 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2104#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-23 11:31:15,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {2104#(= (_ bv15 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2111#(= (bvadd main_~index~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {2111#(= (bvadd main_~index~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2111#(= (bvadd main_~index~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {2111#(= (bvadd main_~index~0 (_ bv4294967280 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2118#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-23 11:31:15,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#(= (_ bv17 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2118#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-23 11:31:15,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#(= (_ bv17 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2125#(= (bvadd main_~index~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {2125#(= (bvadd main_~index~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2125#(= (bvadd main_~index~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {2125#(= (bvadd main_~index~0 (_ bv4294967278 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2132#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-23 11:31:15,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {2132#(= (_ bv19 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2132#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-23 11:31:15,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {2132#(= (_ bv19 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2139#(= (bvadd main_~index~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {2139#(= (bvadd main_~index~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2139#(= (bvadd main_~index~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {2139#(= (bvadd main_~index~0 (_ bv4294967276 32)) (_ bv0 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2146#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-23 11:31:15,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {2146#(= (_ bv21 32) main_~index~0)} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2146#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-23 11:31:15,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {2146#(= (_ bv21 32) main_~index~0)} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2153#(= (bvadd main_~index~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:15,083 INFO L273 TraceCheckUtils]: 50: Hoare triple {2153#(= (bvadd main_~index~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvult32(~index~0, 10000bv32); {1980#false} is VALID [2018-11-23 11:31:15,083 INFO L273 TraceCheckUtils]: 51: Hoare triple {1980#false} ~index~0 := 0bv32; {1980#false} is VALID [2018-11-23 11:31:15,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {1980#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1980#false} is VALID [2018-11-23 11:31:15,084 INFO L256 TraceCheckUtils]: 53: Hoare triple {1980#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {1980#false} is VALID [2018-11-23 11:31:15,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {1980#false} ~cond := #in~cond; {1980#false} is VALID [2018-11-23 11:31:15,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {1980#false} assume 0bv32 == ~cond; {1980#false} is VALID [2018-11-23 11:31:15,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {1980#false} assume !false; {1980#false} is VALID [2018-11-23 11:31:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:15,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:17,265 INFO L273 TraceCheckUtils]: 56: Hoare triple {1980#false} assume !false; {1980#false} is VALID [2018-11-23 11:31:17,265 INFO L273 TraceCheckUtils]: 55: Hoare triple {1980#false} assume 0bv32 == ~cond; {1980#false} is VALID [2018-11-23 11:31:17,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {1980#false} ~cond := #in~cond; {1980#false} is VALID [2018-11-23 11:31:17,266 INFO L256 TraceCheckUtils]: 53: Hoare triple {1980#false} call __VERIFIER_assert((if ~bvugt32(#t~mem4, ~index~0) then 1bv32 else 0bv32)); {1980#false} is VALID [2018-11-23 11:31:17,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {1980#false} assume !!~bvult32(~index~0, 10000bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1980#false} is VALID [2018-11-23 11:31:17,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {1980#false} ~index~0 := 0bv32; {1980#false} is VALID [2018-11-23 11:31:17,268 INFO L273 TraceCheckUtils]: 50: Hoare triple {2193#(bvult main_~index~0 (_ bv10000 32))} assume !~bvult32(~index~0, 10000bv32); {1980#false} is VALID [2018-11-23 11:31:17,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {2197#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2193#(bvult main_~index~0 (_ bv10000 32))} is VALID [2018-11-23 11:31:17,270 INFO L273 TraceCheckUtils]: 48: Hoare triple {2197#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2197#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,274 INFO L273 TraceCheckUtils]: 47: Hoare triple {2204#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2197#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {2204#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2204#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {2211#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2204#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {2211#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2211#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {2218#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2211#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {2218#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2218#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {2225#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2218#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {2225#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2225#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {2232#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2225#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {2232#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2232#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {2239#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2232#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {2239#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2239#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {2246#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2239#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {2246#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2246#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {2253#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2246#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {2253#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2253#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {2260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2253#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {2260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {2267#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {2267#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2267#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {2274#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2267#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {2274#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2274#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {2281#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2274#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {2281#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2281#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {2288#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2281#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2288#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {2295#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2288#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {2295#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2295#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {2302#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2295#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {2302#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2302#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {2309#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2302#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {2309#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2309#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {2316#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2309#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {2316#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2316#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {2323#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2316#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {2323#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2323#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {2330#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2323#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {2330#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2330#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {2337#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2330#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {2337#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2337#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {2344#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv10000 32))} #t~post1 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2337#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {2344#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv10000 32))} assume !!~bvult32(~index~0, 10000bv32);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvugt32(~tmp~0, ~index~0) then 1bv32 else 0bv32);call write~intINTTYPE4(~tmp~0, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2344#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {1979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000bv32);havoc ~index~0;~index~0 := 0bv32; {2344#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-23 11:31:17,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1979#true} call #t~ret5 := main(); {1979#true} is VALID [2018-11-23 11:31:17,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1979#true} {1979#true} #49#return; {1979#true} is VALID [2018-11-23 11:31:17,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {1979#true} assume true; {1979#true} is VALID [2018-11-23 11:31:17,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {1979#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1979#true} is VALID [2018-11-23 11:31:17,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {1979#true} call ULTIMATE.init(); {1979#true} is VALID [2018-11-23 11:31:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:17,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:17,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:31:17,432 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 11:31:17,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:17,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:31:17,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:17,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:31:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:31:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:31:17,707 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 48 states. [2018-11-23 11:31:22,954 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:31:23,498 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:31:24,065 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:31:24,646 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:31:25,212 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:31:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:54,472 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2018-11-23 11:31:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:31:54,473 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 11:31:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:31:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 372 transitions. [2018-11-23 11:31:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:31:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 372 transitions. [2018-11-23 11:31:54,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 372 transitions. [2018-11-23 11:31:55,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:55,329 INFO L225 Difference]: With dead ends: 302 [2018-11-23 11:31:55,330 INFO L226 Difference]: Without dead ends: 291 [2018-11-23 11:31:55,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:31:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-23 11:31:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 110. [2018-11-23 11:31:55,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:55,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 110 states. [2018-11-23 11:31:55,439 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 110 states. [2018-11-23 11:31:55,439 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 110 states. [2018-11-23 11:31:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:55,457 INFO L93 Difference]: Finished difference Result 291 states and 337 transitions. [2018-11-23 11:31:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 337 transitions. [2018-11-23 11:31:55,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:55,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:55,459 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 291 states. [2018-11-23 11:31:55,459 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 291 states. [2018-11-23 11:31:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:55,476 INFO L93 Difference]: Finished difference Result 291 states and 337 transitions. [2018-11-23 11:31:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 337 transitions. [2018-11-23 11:31:55,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:55,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:55,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:55,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:31:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-23 11:31:55,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 57 [2018-11-23 11:31:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:55,483 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-23 11:31:55,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:31:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-23 11:31:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 11:31:55,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:55,486 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:55,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:55,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:55,487 INFO L82 PathProgramCache]: Analyzing trace with hash -959897514, now seen corresponding path program 5 times [2018-11-23 11:31:55,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:55,488 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 11:31:55,517 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1