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-invgen/up_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:35:13,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:35:13,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:35:13,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:35:13,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:35:13,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:35:13,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:35:13,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:35:13,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:35:13,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:35:13,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:35:13,949 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:35:13,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:35:13,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:35:13,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:35:13,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:35:13,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:35:13,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:35:13,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:35:13,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:35:13,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:35:13,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:35:13,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:35:13,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:35:13,966 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:35:13,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:35:13,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:35:13,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:35:13,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:35:13,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:35:13,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:35:13,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:35:13,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:35:13,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:35:13,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:35:13,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:35:13,979 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:35:14,007 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:35:14,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:35:14,008 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:35:14,009 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:35:14,009 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:35:14,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:35:14,010 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:35:14,010 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:35:14,010 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:35:14,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:35:14,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:35:14,011 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:35:14,011 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:35:14,011 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:35:14,011 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:35:14,011 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:35:14,012 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:35:14,012 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:35:14,012 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:35:14,012 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:35:14,012 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:35:14,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:35:14,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:35:14,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:35:14,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:35:14,013 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:35:14,014 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:35:14,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:35:14,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:35:14,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:35:14,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:35:14,097 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:35:14,097 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:35:14,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-23 11:35:14,173 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64fba2b0e/464e661436ca46cdb71fb84d6fdde4dd/FLAGd66f9fc52 [2018-11-23 11:35:14,634 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:35:14,635 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-23 11:35:14,641 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64fba2b0e/464e661436ca46cdb71fb84d6fdde4dd/FLAGd66f9fc52 [2018-11-23 11:35:15,004 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64fba2b0e/464e661436ca46cdb71fb84d6fdde4dd [2018-11-23 11:35:15,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:35:15,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:35:15,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:35:15,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:35:15,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:35:15,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b56cf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15, skipping insertion in model container [2018-11-23 11:35:15,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:35:15,061 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:35:15,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:35:15,350 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:35:15,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:35:15,394 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:35:15,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15 WrapperNode [2018-11-23 11:35:15,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:35:15,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:35:15,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:35:15,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:35:15,405 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:35:15" (1/1) ... [2018-11-23 11:35:15,412 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:35:15" (1/1) ... [2018-11-23 11:35:15,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:35:15,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:35:15,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:35:15,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:35:15,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (1/1) ... [2018-11-23 11:35:15,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:35:15,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:35:15,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:35:15,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:35:15,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (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:35:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:35:15,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:35:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:35:15,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:35:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:35:15,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:35:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:35:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:35:16,060 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:35:16,060 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:35:16,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:16 BoogieIcfgContainer [2018-11-23 11:35:16,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:35:16,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:35:16,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:35:16,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:35:16,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:15" (1/3) ... [2018-11-23 11:35:16,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2bd849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:16, skipping insertion in model container [2018-11-23 11:35:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:15" (2/3) ... [2018-11-23 11:35:16,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2bd849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:16, skipping insertion in model container [2018-11-23 11:35:16,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:16" (3/3) ... [2018-11-23 11:35:16,072 INFO L112 eAbstractionObserver]: Analyzing ICFG up_true-unreach-call_true-termination.i [2018-11-23 11:35:16,082 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:35:16,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:35:16,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:35:16,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:35:16,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:35:16,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:35:16,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:35:16,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:35:16,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:35:16,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:35:16,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:35:16,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:35:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:35:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:35:16,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:16,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:16,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:16,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:16,179 INFO L82 PathProgramCache]: Analyzing trace with hash -634347879, now seen corresponding path program 1 times [2018-11-23 11:35:16,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:16,185 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:35:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:35:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:16,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:16,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:35:16,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:35:16,429 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2018-11-23 11:35:16,430 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2018-11-23 11:35:16,441 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {40#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:16,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {44#(not (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:16,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#(not (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {48#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:35:16,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {24#false} is VALID [2018-11-23 11:35:16,446 INFO L256 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:35:16,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:35:16,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:35:16,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:35:16,451 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:35:16,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:35:16,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:35:16,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:35:16,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:35:16,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:16,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:35:16,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:16,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:35:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:35:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:35:16,591 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 11:35:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:17,202 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-23 11:35:17,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:35:17,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:35:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:35:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 11:35:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:35:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 11:35:17,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-23 11:35:17,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:17,348 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:35:17,349 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:35:17,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:35:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:35:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:35:17,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:17,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:35:17,392 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:35:17,393 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:35:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:17,397 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:35:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:35:17,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:17,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:17,399 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:35:17,399 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:35:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:17,403 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:35:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:35:17,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:17,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:17,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:17,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:35:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:35:17,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-11-23 11:35:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:17,409 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:35:17,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:35:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:35:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:35:17,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:17,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:17,411 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:17,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -306885048, now seen corresponding path program 1 times [2018-11-23 11:35:17,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:17,412 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:35:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:35:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:17,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:17,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-23 11:35:17,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2018-11-23 11:35:17,930 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #45#return; {179#true} is VALID [2018-11-23 11:35:17,930 INFO L256 TraceCheckUtils]: 3: Hoare triple {179#true} call #t~ret6 := main(); {179#true} is VALID [2018-11-23 11:35:17,931 INFO L273 TraceCheckUtils]: 4: Hoare triple {179#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {196#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:17,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {196#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32; {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,937 INFO L256 TraceCheckUtils]: 9: Hoare triple {200#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {213#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {217#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:17,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {180#false} is VALID [2018-11-23 11:35:17,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-23 11:35:17,959 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:35:17,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:18,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-23 11:35:18,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {180#false} is VALID [2018-11-23 11:35:18,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {231#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {227#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:18,262 INFO L256 TraceCheckUtils]: 9: Hoare triple {235#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {231#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:18,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {235#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {235#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:18,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {235#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {235#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:18,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {235#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {235#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:18,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {235#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:18,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {179#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {248#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:18,268 INFO L256 TraceCheckUtils]: 3: Hoare triple {179#true} call #t~ret6 := main(); {179#true} is VALID [2018-11-23 11:35:18,268 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #45#return; {179#true} is VALID [2018-11-23 11:35:18,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2018-11-23 11:35:18,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-23 11:35:18,270 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:35:18,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:18,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:35:18,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:35:18,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:18,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:35:18,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:35:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:35:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:35:18,318 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-11-23 11:35:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:19,213 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:35:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:35:19,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:35:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:35:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:35:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:35:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:35:19,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2018-11-23 11:35:19,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:19,348 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:35:19,349 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:35:19,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:35:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:35:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-11-23 11:35:19,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:19,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 27 states. [2018-11-23 11:35:19,432 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 27 states. [2018-11-23 11:35:19,432 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 27 states. [2018-11-23 11:35:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:19,438 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:35:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:35:19,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:19,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:19,440 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 42 states. [2018-11-23 11:35:19,440 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 42 states. [2018-11-23 11:35:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:19,445 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:35:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:35:19,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:19,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:19,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:19,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:35:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:35:19,450 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2018-11-23 11:35:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:19,450 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:35:19,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:35:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:35:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:35:19,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:19,452 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:19,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:19,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -306802087, now seen corresponding path program 2 times [2018-11-23 11:35:19,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:19,453 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:35:19,471 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:19,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:19,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:19,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:19,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 11:35:19,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 11:35:19,729 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} #45#return; {463#true} is VALID [2018-11-23 11:35:19,729 INFO L256 TraceCheckUtils]: 3: Hoare triple {463#true} call #t~ret6 := main(); {463#true} is VALID [2018-11-23 11:35:19,730 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {480#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:19,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {480#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {484#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {484#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {488#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:35:19,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {492#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {492#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j~0 := 0bv32; {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,751 INFO L256 TraceCheckUtils]: 12: Hoare triple {496#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {509#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {509#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {513#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:19,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {464#false} is VALID [2018-11-23 11:35:19,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 11:35:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:19,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:20,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 11:35:20,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {523#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {464#false} is VALID [2018-11-23 11:35:20,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {527#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {523#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:20,106 INFO L256 TraceCheckUtils]: 12: Hoare triple {531#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {527#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:20,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {531#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {531#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:20,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {531#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {531#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:20,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {531#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {531#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:20,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {544#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {531#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:20,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {548#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {544#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:20,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {552#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {548#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:20,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {556#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {552#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:20,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {556#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:20,122 INFO L256 TraceCheckUtils]: 3: Hoare triple {463#true} call #t~ret6 := main(); {463#true} is VALID [2018-11-23 11:35:20,122 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} #45#return; {463#true} is VALID [2018-11-23 11:35:20,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 11:35:20,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 11:35:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:20,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:20,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:35:20,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:35:20,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:20,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:35:20,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:20,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:35:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:35:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:35:20,175 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 16 states. [2018-11-23 11:35:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:23,356 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-23 11:35:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:35:23,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:35:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-23 11:35:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-23 11:35:23,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-23 11:35:23,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:23,686 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:35:23,686 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:35:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:35:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:35:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 56. [2018-11-23 11:35:23,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:23,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 56 states. [2018-11-23 11:35:23,817 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 56 states. [2018-11-23 11:35:23,818 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 56 states. [2018-11-23 11:35:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:23,827 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2018-11-23 11:35:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2018-11-23 11:35:23,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:23,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:23,831 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 109 states. [2018-11-23 11:35:23,831 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 109 states. [2018-11-23 11:35:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:23,840 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2018-11-23 11:35:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2018-11-23 11:35:23,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:23,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:23,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:23,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:35:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-23 11:35:23,853 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 16 [2018-11-23 11:35:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:23,854 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-23 11:35:23,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:35:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-11-23 11:35:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:35:23,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:23,855 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:23,856 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:23,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1036343866, now seen corresponding path program 1 times [2018-11-23 11:35:23,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:23,858 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:35:23,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:35:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:23,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:24,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2018-11-23 11:35:24,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1081#true} assume true; {1081#true} is VALID [2018-11-23 11:35:24,280 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1081#true} {1081#true} #45#return; {1081#true} is VALID [2018-11-23 11:35:24,280 INFO L256 TraceCheckUtils]: 3: Hoare triple {1081#true} call #t~ret6 := main(); {1081#true} is VALID [2018-11-23 11:35:24,281 INFO L273 TraceCheckUtils]: 4: Hoare triple {1081#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1098#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:24,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1102#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:24,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {1106#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:24,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:24,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:24,285 INFO L256 TraceCheckUtils]: 9: Hoare triple {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1081#true} is VALID [2018-11-23 11:35:24,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2018-11-23 11:35:24,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {1081#true} assume !(0bv32 == ~cond); {1081#true} is VALID [2018-11-23 11:35:24,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {1081#true} assume true; {1081#true} is VALID [2018-11-23 11:35:24,288 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1081#true} {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #49#return; {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:24,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {1110#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1132#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:24,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {1132#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1082#false} is VALID [2018-11-23 11:35:24,290 INFO L256 TraceCheckUtils]: 16: Hoare triple {1082#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1082#false} is VALID [2018-11-23 11:35:24,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2018-11-23 11:35:24,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {1082#false} assume 0bv32 == ~cond; {1082#false} is VALID [2018-11-23 11:35:24,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2018-11-23 11:35:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:24,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:24,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2018-11-23 11:35:24,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {1082#false} assume 0bv32 == ~cond; {1082#false} is VALID [2018-11-23 11:35:24,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2018-11-23 11:35:24,775 INFO L256 TraceCheckUtils]: 16: Hoare triple {1082#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1082#false} is VALID [2018-11-23 11:35:24,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {1160#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1082#false} is VALID [2018-11-23 11:35:24,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1160#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:35:24,778 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1081#true} {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #49#return; {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:24,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {1081#true} assume true; {1081#true} is VALID [2018-11-23 11:35:24,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {1081#true} assume !(0bv32 == ~cond); {1081#true} is VALID [2018-11-23 11:35:24,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2018-11-23 11:35:24,779 INFO L256 TraceCheckUtils]: 9: Hoare triple {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1081#true} is VALID [2018-11-23 11:35:24,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:24,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {1186#(not (bvslt (_ bv1 32) main_~n~0))} ~j~0 := 0bv32; {1164#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:24,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {1190#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1186#(not (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:24,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1190#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:24,799 INFO L273 TraceCheckUtils]: 4: Hoare triple {1081#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1194#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} is VALID [2018-11-23 11:35:24,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {1081#true} call #t~ret6 := main(); {1081#true} is VALID [2018-11-23 11:35:24,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1081#true} {1081#true} #45#return; {1081#true} is VALID [2018-11-23 11:35:24,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {1081#true} assume true; {1081#true} is VALID [2018-11-23 11:35:24,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2018-11-23 11:35:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:24,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:35:24,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:35:24,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:24,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:35:24,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:24,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:35:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:35:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:35:24,902 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand 12 states. [2018-11-23 11:35:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:25,590 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:35:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:35:25,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:35:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:35:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 11:35:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:35:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 11:35:25,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 11:35:25,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:25,656 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:35:25,657 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:35:25,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:35:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:35:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 11:35:25,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:25,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 11:35:25,830 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:35:25,830 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:35:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:25,834 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:35:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:35:25,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:25,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:25,835 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:35:25,835 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:35:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:25,839 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:35:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:35:25,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:25,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:25,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:25,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:35:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-11-23 11:35:25,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 20 [2018-11-23 11:35:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:25,844 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-11-23 11:35:25,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:35:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:35:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:35:25,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:25,845 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:25,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:25,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1733213177, now seen corresponding path program 3 times [2018-11-23 11:35:25,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:25,846 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:35:25,878 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:26,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:35:26,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:26,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:26,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2018-11-23 11:35:26,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-23 11:35:26,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #45#return; {1514#true} is VALID [2018-11-23 11:35:26,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {1514#true} call #t~ret6 := main(); {1514#true} is VALID [2018-11-23 11:35:26,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {1514#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1531#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:26,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {1531#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1535#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {1535#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1539#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:35:26,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {1543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1547#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {1547#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1551#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {1551#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1555#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:35:26,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {1555#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1559#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {1559#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1563#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1567#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:35:26,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {1567#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~j~0 := 0bv32; {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,329 INFO L256 TraceCheckUtils]: 18: Hoare triple {1571#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1584#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {1584#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1588#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {1588#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1515#false} is VALID [2018-11-23 11:35:26,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2018-11-23 11:35:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:26,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:26,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2018-11-23 11:35:26,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {1598#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1515#false} is VALID [2018-11-23 11:35:26,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {1602#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1598#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:26,982 INFO L256 TraceCheckUtils]: 18: Hoare triple {1606#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1602#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:26,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {1606#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {1606#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:26,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {1606#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {1606#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:26,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {1606#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {1606#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:26,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {1619#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1606#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:26,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {1623#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1619#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {1627#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1623#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:26,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {1631#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1627#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1631#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {1639#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1635#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {1643#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1639#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {1647#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1643#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {1651#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1647#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {1655#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1651#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,025 INFO L273 TraceCheckUtils]: 4: Hoare triple {1514#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1655#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:27,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {1514#true} call #t~ret6 := main(); {1514#true} is VALID [2018-11-23 11:35:27,025 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #45#return; {1514#true} is VALID [2018-11-23 11:35:27,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-23 11:35:27,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2018-11-23 11:35:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:27,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:27,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:35:27,031 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:35:27,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:27,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:35:27,087 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:35:27,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:35:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:35:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:35:27,089 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 28 states. [2018-11-23 11:35:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:45,652 INFO L93 Difference]: Finished difference Result 328 states and 434 transitions. [2018-11-23 11:35:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-23 11:35:45,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:35:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 392 transitions. [2018-11-23 11:35:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 392 transitions. [2018-11-23 11:35:45,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 392 transitions. [2018-11-23 11:35:46,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:46,809 INFO L225 Difference]: With dead ends: 328 [2018-11-23 11:35:46,810 INFO L226 Difference]: Without dead ends: 326 [2018-11-23 11:35:46,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1821, Invalid=5151, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 11:35:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-23 11:35:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 114. [2018-11-23 11:35:47,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:47,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 114 states. [2018-11-23 11:35:47,263 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 114 states. [2018-11-23 11:35:47,263 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 114 states. [2018-11-23 11:35:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:47,285 INFO L93 Difference]: Finished difference Result 326 states and 432 transitions. [2018-11-23 11:35:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 432 transitions. [2018-11-23 11:35:47,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:47,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:47,289 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 326 states. [2018-11-23 11:35:47,289 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 326 states. [2018-11-23 11:35:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:47,311 INFO L93 Difference]: Finished difference Result 326 states and 432 transitions. [2018-11-23 11:35:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 432 transitions. [2018-11-23 11:35:47,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:47,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:47,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:47,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:35:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2018-11-23 11:35:47,319 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 22 [2018-11-23 11:35:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:47,320 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2018-11-23 11:35:47,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:35:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2018-11-23 11:35:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:35:47,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:47,321 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:47,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:47,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2027779705, now seen corresponding path program 2 times [2018-11-23 11:35:47,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:47,323 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:35:47,344 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:47,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:47,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:47,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:47,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {3163#true} call ULTIMATE.init(); {3163#true} is VALID [2018-11-23 11:35:47,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:47,764 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3163#true} {3163#true} #45#return; {3163#true} is VALID [2018-11-23 11:35:47,765 INFO L256 TraceCheckUtils]: 3: Hoare triple {3163#true} call #t~ret6 := main(); {3163#true} is VALID [2018-11-23 11:35:47,766 INFO L273 TraceCheckUtils]: 4: Hoare triple {3163#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3180#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:47,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {3180#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3184#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:47,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {3184#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3188#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:35:47,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {3188#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~n~0); {3192#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:47,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} ~j~0 := 0bv32; {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:47,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:47,771 INFO L256 TraceCheckUtils]: 10: Hoare triple {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3163#true} is VALID [2018-11-23 11:35:47,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {3163#true} ~cond := #in~cond; {3163#true} is VALID [2018-11-23 11:35:47,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {3163#true} assume !(0bv32 == ~cond); {3163#true} is VALID [2018-11-23 11:35:47,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:47,774 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3163#true} {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} #49#return; {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:47,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {3196#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:47,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:47,775 INFO L256 TraceCheckUtils]: 17: Hoare triple {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3163#true} is VALID [2018-11-23 11:35:47,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {3163#true} ~cond := #in~cond; {3163#true} is VALID [2018-11-23 11:35:47,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {3163#true} assume !(0bv32 == ~cond); {3163#true} is VALID [2018-11-23 11:35:47,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:47,777 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3163#true} {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #49#return; {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:47,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {3218#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3240#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:35:47,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {3240#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3164#false} is VALID [2018-11-23 11:35:47,779 INFO L256 TraceCheckUtils]: 24: Hoare triple {3164#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3164#false} is VALID [2018-11-23 11:35:47,779 INFO L273 TraceCheckUtils]: 25: Hoare triple {3164#false} ~cond := #in~cond; {3164#false} is VALID [2018-11-23 11:35:47,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {3164#false} assume 0bv32 == ~cond; {3164#false} is VALID [2018-11-23 11:35:47,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {3164#false} assume !false; {3164#false} is VALID [2018-11-23 11:35:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:47,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:48,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {3164#false} assume !false; {3164#false} is VALID [2018-11-23 11:35:48,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {3164#false} assume 0bv32 == ~cond; {3164#false} is VALID [2018-11-23 11:35:48,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {3164#false} ~cond := #in~cond; {3164#false} is VALID [2018-11-23 11:35:48,417 INFO L256 TraceCheckUtils]: 24: Hoare triple {3164#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3164#false} is VALID [2018-11-23 11:35:48,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {3268#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3164#false} is VALID [2018-11-23 11:35:48,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3268#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:35:48,420 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3163#true} {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #49#return; {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:48,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {3163#true} assume !(0bv32 == ~cond); {3163#true} is VALID [2018-11-23 11:35:48,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {3163#true} ~cond := #in~cond; {3163#true} is VALID [2018-11-23 11:35:48,422 INFO L256 TraceCheckUtils]: 17: Hoare triple {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3163#true} is VALID [2018-11-23 11:35:48,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3272#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,446 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3163#true} {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #49#return; {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:48,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {3163#true} assume !(0bv32 == ~cond); {3163#true} is VALID [2018-11-23 11:35:48,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {3163#true} ~cond := #in~cond; {3163#true} is VALID [2018-11-23 11:35:48,447 INFO L256 TraceCheckUtils]: 10: Hoare triple {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3163#true} is VALID [2018-11-23 11:35:48,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {3316#(not (bvslt (_ bv2 32) main_~n~0))} ~j~0 := 0bv32; {3294#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:48,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {3320#(or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {3316#(not (bvslt (_ bv2 32) main_~n~0))} is VALID [2018-11-23 11:35:48,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {3324#(or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3320#(or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:48,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {3328#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (_ bv2 32) main_~n~0)) (not (bvslt main_~i~0 main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3324#(or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:35:48,507 INFO L273 TraceCheckUtils]: 4: Hoare triple {3163#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3328#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (_ bv2 32) main_~n~0)) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-23 11:35:48,507 INFO L256 TraceCheckUtils]: 3: Hoare triple {3163#true} call #t~ret6 := main(); {3163#true} is VALID [2018-11-23 11:35:48,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3163#true} {3163#true} #45#return; {3163#true} is VALID [2018-11-23 11:35:48,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:35:48,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {3163#true} call ULTIMATE.init(); {3163#true} is VALID [2018-11-23 11:35:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:35:48,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:35:48,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:48,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:35:48,648 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:35:48,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:35:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:35:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:35:48,649 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand 16 states. [2018-11-23 11:35:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:49,622 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 11:35:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:35:49,622 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:35:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-23 11:35:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-23 11:35:49,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2018-11-23 11:35:49,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:49,703 INFO L225 Difference]: With dead ends: 128 [2018-11-23 11:35:49,703 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:35:49,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:35:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:35:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-23 11:35:49,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:49,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-23 11:35:49,808 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:35:49,808 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:35:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:49,814 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-23 11:35:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:35:49,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:49,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:49,815 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:35:49,815 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:35:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:49,820 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-23 11:35:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:35:49,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:49,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:49,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:49,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:35:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2018-11-23 11:35:49,826 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 28 [2018-11-23 11:35:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:49,826 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2018-11-23 11:35:49,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:35:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:35:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:35:49,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:49,828 INFO L402 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:49,828 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:49,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 656414618, now seen corresponding path program 3 times [2018-11-23 11:35:49,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:49,829 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:35:49,860 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:50,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 11:35:50,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:50,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:50,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {3969#true} call ULTIMATE.init(); {3969#true} is VALID [2018-11-23 11:35:50,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {3969#true} assume true; {3969#true} is VALID [2018-11-23 11:35:50,542 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3969#true} {3969#true} #45#return; {3969#true} is VALID [2018-11-23 11:35:50,542 INFO L256 TraceCheckUtils]: 3: Hoare triple {3969#true} call #t~ret6 := main(); {3969#true} is VALID [2018-11-23 11:35:50,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {3969#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3986#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:50,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {3986#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3990#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {3990#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3994#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:35:50,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {3994#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3998#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {3998#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4002#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {4002#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4006#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {4006#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4010#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:35:50,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {4010#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4014#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {4014#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4018#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {4018#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4022#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:35:50,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {4022#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4030#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:50,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {4030#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:50,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(= (_ bv11 32) main_~k~0)} ~j~0 := 0bv32; {4030#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:50,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {4030#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {4030#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:50,558 INFO L256 TraceCheckUtils]: 19: Hoare triple {4030#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3969#true} is VALID [2018-11-23 11:35:50,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {3969#true} ~cond := #in~cond; {3969#true} is VALID [2018-11-23 11:35:50,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {3969#true} assume !(0bv32 == ~cond); {3969#true} is VALID [2018-11-23 11:35:50,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {3969#true} assume true; {3969#true} is VALID [2018-11-23 11:35:50,559 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3969#true} {4030#(= (_ bv11 32) main_~k~0)} #49#return; {4030#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:50,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {4030#(= (_ bv11 32) main_~k~0)} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,561 INFO L256 TraceCheckUtils]: 26: Hoare triple {4026#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4064#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {4064#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4068#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:50,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {4068#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3970#false} is VALID [2018-11-23 11:35:50,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {3970#false} assume !false; {3970#false} is VALID [2018-11-23 11:35:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:50,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:51,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {3970#false} assume !false; {3970#false} is VALID [2018-11-23 11:35:51,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {4078#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3970#false} is VALID [2018-11-23 11:35:51,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {4082#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4078#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:51,286 INFO L256 TraceCheckUtils]: 26: Hoare triple {4086#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4082#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:51,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {4086#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {4086#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:51,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {4086#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:51,287 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3969#true} {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #49#return; {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {3969#true} assume true; {3969#true} is VALID [2018-11-23 11:35:51,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {3969#true} assume !(0bv32 == ~cond); {3969#true} is VALID [2018-11-23 11:35:51,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {3969#true} ~cond := #in~cond; {3969#true} is VALID [2018-11-23 11:35:51,289 INFO L256 TraceCheckUtils]: 19: Hoare triple {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3969#true} is VALID [2018-11-23 11:35:51,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32; {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {4086#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4093#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4086#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:51,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {4128#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4124#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {4132#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4128#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {4136#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4132#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {4140#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4136#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {4144#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4140#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {4148#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4144#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {4152#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4148#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {4156#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4152#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {4160#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4156#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {3969#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {4160#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:51,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {3969#true} call #t~ret6 := main(); {3969#true} is VALID [2018-11-23 11:35:51,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3969#true} {3969#true} #45#return; {3969#true} is VALID [2018-11-23 11:35:51,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {3969#true} assume true; {3969#true} is VALID [2018-11-23 11:35:51,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {3969#true} call ULTIMATE.init(); {3969#true} is VALID [2018-11-23 11:35:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:35:51,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-11-23 11:35:51,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:51,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:35:51,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:51,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:35:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:35:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:35:51,448 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand 30 states. [2018-11-23 11:36:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:15,169 INFO L93 Difference]: Finished difference Result 401 states and 529 transitions. [2018-11-23 11:36:15,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-23 11:36:15,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-11-23 11:36:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 448 transitions. [2018-11-23 11:36:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 448 transitions. [2018-11-23 11:36:15,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 448 transitions. [2018-11-23 11:36:18,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:18,216 INFO L225 Difference]: With dead ends: 401 [2018-11-23 11:36:18,216 INFO L226 Difference]: Without dead ends: 399 [2018-11-23 11:36:18,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2385, Invalid=6927, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:36:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-23 11:36:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 156. [2018-11-23 11:36:18,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:18,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand 156 states. [2018-11-23 11:36:18,927 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand 156 states. [2018-11-23 11:36:18,927 INFO L87 Difference]: Start difference. First operand 399 states. Second operand 156 states. [2018-11-23 11:36:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:18,951 INFO L93 Difference]: Finished difference Result 399 states and 527 transitions. [2018-11-23 11:36:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-23 11:36:18,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:18,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:18,954 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 399 states. [2018-11-23 11:36:18,954 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 399 states. [2018-11-23 11:36:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:18,979 INFO L93 Difference]: Finished difference Result 399 states and 527 transitions. [2018-11-23 11:36:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-23 11:36:18,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:18,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:18,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:18,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:36:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2018-11-23 11:36:18,989 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 30 [2018-11-23 11:36:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:18,989 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2018-11-23 11:36:18,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:36:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2018-11-23 11:36:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:36:18,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:18,991 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:18,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:18,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -193928102, now seen corresponding path program 4 times [2018-11-23 11:36:18,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:19,025 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:36:19,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:36:19,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:36:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:19,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:19,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2018-11-23 11:36:19,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:19,494 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6025#true} {6025#true} #45#return; {6025#true} is VALID [2018-11-23 11:36:19,494 INFO L256 TraceCheckUtils]: 3: Hoare triple {6025#true} call #t~ret6 := main(); {6025#true} is VALID [2018-11-23 11:36:19,494 INFO L273 TraceCheckUtils]: 4: Hoare triple {6025#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6042#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:36:19,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {6042#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6046#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:36:19,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {6046#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6050#(and (= (_ bv2 32) main_~i~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {6050#(and (= (_ bv2 32) main_~i~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6054#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {6054#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6058#(and (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {6058#(and (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,499 INFO L256 TraceCheckUtils]: 11: Hoare triple {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:19,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:19,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:19,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:19,500 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6025#true} {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #49#return; {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {6062#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,502 INFO L256 TraceCheckUtils]: 18: Hoare triple {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:19,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:19,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:19,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:19,503 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {6025#true} {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} #49#return; {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {6084#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,505 INFO L256 TraceCheckUtils]: 25: Hoare triple {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:19,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:19,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:19,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:19,505 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6025#true} {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #49#return; {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {6106#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6128#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:36:19,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {6128#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6026#false} is VALID [2018-11-23 11:36:19,508 INFO L256 TraceCheckUtils]: 32: Hoare triple {6026#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6026#false} is VALID [2018-11-23 11:36:19,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {6026#false} ~cond := #in~cond; {6026#false} is VALID [2018-11-23 11:36:19,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {6026#false} assume 0bv32 == ~cond; {6026#false} is VALID [2018-11-23 11:36:19,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2018-11-23 11:36:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:19,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:20,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2018-11-23 11:36:20,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {6026#false} assume 0bv32 == ~cond; {6026#false} is VALID [2018-11-23 11:36:20,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {6026#false} ~cond := #in~cond; {6026#false} is VALID [2018-11-23 11:36:20,087 INFO L256 TraceCheckUtils]: 32: Hoare triple {6026#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6026#false} is VALID [2018-11-23 11:36:20,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {6156#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6026#false} is VALID [2018-11-23 11:36:20,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6156#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:36:20,089 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6025#true} {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #49#return; {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:20,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:20,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:20,090 INFO L256 TraceCheckUtils]: 25: Hoare triple {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:20,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6160#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,118 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {6025#true} {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #49#return; {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:20,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:20,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:20,119 INFO L256 TraceCheckUtils]: 18: Hoare triple {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:20,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6182#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,142 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6025#true} {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} #49#return; {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:20,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {6025#true} assume !(0bv32 == ~cond); {6025#true} is VALID [2018-11-23 11:36:20,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {6025#true} ~cond := #in~cond; {6025#true} is VALID [2018-11-23 11:36:20,143 INFO L256 TraceCheckUtils]: 11: Hoare triple {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6025#true} is VALID [2018-11-23 11:36:20,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {6226#(not (bvslt (_ bv3 32) main_~n~0))} ~j~0 := 0bv32; {6204#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:36:20,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {6230#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6226#(not (bvslt (_ bv3 32) main_~n~0))} is VALID [2018-11-23 11:36:20,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {6234#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6230#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:36:20,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {6238#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6234#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:36:20,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {6242#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6238#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:36:20,197 INFO L273 TraceCheckUtils]: 4: Hoare triple {6025#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6242#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:36:20,197 INFO L256 TraceCheckUtils]: 3: Hoare triple {6025#true} call #t~ret6 := main(); {6025#true} is VALID [2018-11-23 11:36:20,197 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6025#true} {6025#true} #45#return; {6025#true} is VALID [2018-11-23 11:36:20,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {6025#true} assume true; {6025#true} is VALID [2018-11-23 11:36:20,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2018-11-23 11:36:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:36:20,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-23 11:36:20,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:20,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:36:20,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:20,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:36:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:36:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:36:20,401 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand 20 states. [2018-11-23 11:36:21,737 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:36:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,293 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 11:36:22,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:36:22,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-23 11:36:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:36:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-23 11:36:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:36:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-23 11:36:22,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2018-11-23 11:36:22,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:22,365 INFO L225 Difference]: With dead ends: 173 [2018-11-23 11:36:22,365 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:36:22,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:36:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:36:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-23 11:36:22,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:22,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 149 states. [2018-11-23 11:36:22,934 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:36:22,934 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:36:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,941 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2018-11-23 11:36:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:36:22,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,942 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:36:22,942 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:36:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,949 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2018-11-23 11:36:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:36:22,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:22,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 11:36:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2018-11-23 11:36:22,957 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 199 transitions. Word has length 36 [2018-11-23 11:36:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:22,957 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 199 transitions. [2018-11-23 11:36:22,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:36:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:36:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:36:22,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:22,959 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:22,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:22,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1711335000, now seen corresponding path program 4 times [2018-11-23 11:36:22,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:22,960 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:22,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:36:23,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:36:23,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:36:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:23,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:23,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {7099#true} call ULTIMATE.init(); {7099#true} is VALID [2018-11-23 11:36:23,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {7099#true} assume true; {7099#true} is VALID [2018-11-23 11:36:23,937 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7099#true} {7099#true} #45#return; {7099#true} is VALID [2018-11-23 11:36:23,938 INFO L256 TraceCheckUtils]: 3: Hoare triple {7099#true} call #t~ret6 := main(); {7099#true} is VALID [2018-11-23 11:36:23,938 INFO L273 TraceCheckUtils]: 4: Hoare triple {7099#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7116#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:36:23,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {7116#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7120#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {7120#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7124#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:36:23,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {7124#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7128#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {7128#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7132#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {7132#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7136#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {7136#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7140#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:36:23,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {7140#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7144#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {7144#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7148#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {7148#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7152#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:36:23,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {7152#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7156#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {7156#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7160#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:36:23,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {7160#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7164#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {7164#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7168#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 11:36:23,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {7168#(= (_ bv13 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7172#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {7172#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7176#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 11:36:23,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {7176#(= (_ bv15 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7180#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {7180#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7184#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 11:36:23,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {7184#(= (_ bv17 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7188#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {7188#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7192#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 11:36:23,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {7192#(= (_ bv19 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7196#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {7196#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7200#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 11:36:23,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {7200#(= (_ bv21 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7204#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {7204#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7208#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:36:23,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {7208#(= (_ bv23 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {7208#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:36:23,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {7208#(= (_ bv23 32) main_~k~0)} ~j~0 := 0bv32; {7208#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:36:23,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {7208#(= (_ bv23 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {7208#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:36:23,964 INFO L256 TraceCheckUtils]: 31: Hoare triple {7208#(= (_ bv23 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7221#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {7221#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7225#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {7225#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7100#false} is VALID [2018-11-23 11:36:23,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {7100#false} assume !false; {7100#false} is VALID [2018-11-23 11:36:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:23,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:26,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {7100#false} assume !false; {7100#false} is VALID [2018-11-23 11:36:26,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {7235#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {7100#false} is VALID [2018-11-23 11:36:26,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {7239#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7235#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:36:26,251 INFO L256 TraceCheckUtils]: 31: Hoare triple {7243#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7239#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:36:26,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {7243#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {7243#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:36:26,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {7243#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {7243#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:36:26,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {7243#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7243#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:36:26,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {7256#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7243#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:36:26,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {7260#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7256#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {7264#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7260#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {7268#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7264#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {7272#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7268#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {7276#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7272#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {7280#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7276#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {7284#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7280#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {7288#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7284#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {7292#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7288#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {7296#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7292#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {7300#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7296#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {7304#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7300#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {7308#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7304#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {7312#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7308#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {7316#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7312#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {7320#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7316#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {7324#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7320#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {7328#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7324#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {7332#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7328#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7332#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {7340#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7336#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {7344#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7340#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,354 INFO L273 TraceCheckUtils]: 4: Hoare triple {7099#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7344#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,354 INFO L256 TraceCheckUtils]: 3: Hoare triple {7099#true} call #t~ret6 := main(); {7099#true} is VALID [2018-11-23 11:36:26,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7099#true} {7099#true} #45#return; {7099#true} is VALID [2018-11-23 11:36:26,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {7099#true} assume true; {7099#true} is VALID [2018-11-23 11:36:26,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {7099#true} call ULTIMATE.init(); {7099#true} is VALID [2018-11-23 11:36:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:26,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:26,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:36:26,365 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 35 [2018-11-23 11:36:26,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:26,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:36:26,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:26,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:36:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:36:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2180, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:36:26,468 INFO L87 Difference]: Start difference. First operand 149 states and 199 transitions. Second operand 54 states. [2018-11-23 11:36:34,682 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:36:35,363 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:36:36,205 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:36:36,962 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:36:37,634 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:36:38,328 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:36:40,311 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:36:59,458 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-23 11:37:01,433 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:37:02,915 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 9 [2018-11-23 11:37:04,618 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:37:07,963 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:37:18,138 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-23 11:37:19,825 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:37:23,749 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:37:26,464 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:37:34,758 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:37:35,436 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:37:36,186 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:37:37,774 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 9 [2018-11-23 11:37:39,433 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 11:37:41,838 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:37:49,691 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:37:53,590 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:38:04,462 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:38:05,792 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:38:09,710 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 11:38:12,318 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 9 [2018-11-23 11:38:22,114 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9