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/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:36:00,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:36:00,509 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:36:00,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:36:00,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:36:00,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:36:00,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:36:00,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:36:00,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:36:00,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:36:00,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:36:00,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:36:00,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:36:00,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:36:00,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:36:00,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:36:00,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:36:00,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:36:00,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:36:00,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:36:00,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:36:00,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:36:00,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:36:00,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:36:00,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:36:00,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:36:00,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:36:00,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:36:00,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:36:00,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:36:00,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:36:00,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:36:00,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:36:00,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:36:00,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:36:00,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:36:00,579 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:36:00,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:36:00,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:36:00,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:36:00,609 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:36:00,610 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:36:00,610 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:36:00,611 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:36:00,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:36:00,611 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:36:00,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:36:00,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:36:00,612 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:36:00,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:36:00,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:36:00,612 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:36:00,612 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:36:00,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:36:00,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:36:00,614 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:36:00,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:36:00,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:36:00,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:36:00,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:36:00,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:36:00,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:00,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:36:00,615 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:36:00,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:36:00,616 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:36:00,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:36:00,617 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:36:00,617 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:36:00,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:36:00,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:36:00,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:36:00,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:36:00,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:36:00,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:36:00,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-23 11:36:00,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de6acd67/6e598cc711e8462a811efd801ea92741/FLAG246c03670 [2018-11-23 11:36:01,325 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:36:01,326 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-23 11:36:01,340 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de6acd67/6e598cc711e8462a811efd801ea92741/FLAG246c03670 [2018-11-23 11:36:01,601 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de6acd67/6e598cc711e8462a811efd801ea92741 [2018-11-23 11:36:01,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:36:01,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:36:01,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:01,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:36:01,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:36:01,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:01" (1/1) ... [2018-11-23 11:36:01,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239a5e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:01, skipping insertion in model container [2018-11-23 11:36:01,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:01" (1/1) ... [2018-11-23 11:36:01,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:36:01,698 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:36:02,146 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:02,152 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:36:02,237 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:02,264 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:36:02,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02 WrapperNode [2018-11-23 11:36:02,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:02,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:02,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:36:02,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:36:02,275 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:36:02" (1/1) ... [2018-11-23 11:36:02,289 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:36:02" (1/1) ... [2018-11-23 11:36:02,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:02,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:36:02,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:36:02,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:36:02,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2018-11-23 11:36:02,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:36:02,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:36:02,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:36:02,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:36:02,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (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:36:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:36:02,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:36:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:36:02,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:36:02,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:36:02,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:36:04,590 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:36:04,591 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:36:04,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:04 BoogieIcfgContainer [2018-11-23 11:36:04,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:36:04,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:36:04,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:36:04,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:36:04,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:01" (1/3) ... [2018-11-23 11:36:04,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679e5ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:04, skipping insertion in model container [2018-11-23 11:36:04,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (2/3) ... [2018-11-23 11:36:04,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679e5ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:04, skipping insertion in model container [2018-11-23 11:36:04,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:04" (3/3) ... [2018-11-23 11:36:04,605 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-23 11:36:04,613 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:36:04,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-23 11:36:04,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-23 11:36:04,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:36:04,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:36:04,673 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:36:04,673 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:36:04,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:36:04,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:36:04,673 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:36:04,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:36:04,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:36:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-23 11:36:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:36:04,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:04,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:04,707 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:04,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-23 11:36:04,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:04,719 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:36:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:04,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:05,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {128#true} is VALID [2018-11-23 11:36:05,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {128#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {128#true} is VALID [2018-11-23 11:36:05,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2018-11-23 11:36:05,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #388#return; {128#true} is VALID [2018-11-23 11:36:05,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret15 := main(); {128#true} is VALID [2018-11-23 11:36:05,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {128#true} is VALID [2018-11-23 11:36:05,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {128#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:05,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:05,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:05,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {129#false} is VALID [2018-11-23 11:36:05,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2018-11-23 11:36:05,072 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:36:05,072 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:05,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:05,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:05,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:36:05,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:05,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:05,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:05,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:05,142 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-23 11:36:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:07,036 INFO L93 Difference]: Finished difference Result 141 states and 219 transitions. [2018-11-23 11:36:07,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:36:07,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:36:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-23 11:36:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-23 11:36:07,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2018-11-23 11:36:07,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:07,477 INFO L225 Difference]: With dead ends: 141 [2018-11-23 11:36:07,478 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:36:07,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:36:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-23 11:36:07,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:07,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-23 11:36:07,555 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-23 11:36:07,556 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-23 11:36:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:07,569 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:36:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-23 11:36:07,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:07,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:07,571 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-23 11:36:07,571 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-23 11:36:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:07,582 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:36:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-23 11:36:07,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:07,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:07,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:07,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:36:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2018-11-23 11:36:07,601 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 11 [2018-11-23 11:36:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:07,602 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-11-23 11:36:07,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2018-11-23 11:36:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:07,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:07,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:07,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:07,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-23 11:36:07,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:07,607 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:36:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:07,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:07,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {699#true} is VALID [2018-11-23 11:36:07,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {699#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {699#true} is VALID [2018-11-23 11:36:07,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2018-11-23 11:36:07,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #388#return; {699#true} is VALID [2018-11-23 11:36:07,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret15 := main(); {699#true} is VALID [2018-11-23 11:36:07,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {699#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {699#true} is VALID [2018-11-23 11:36:07,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:07,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {722#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:07,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:07,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:07,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {700#false} is VALID [2018-11-23 11:36:07,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {700#false} assume !false; {700#false} is VALID [2018-11-23 11:36:07,828 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:36:07,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:07,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:07,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:07,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:36:07,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:07,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:07,860 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:36:07,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:07,862 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 5 states. [2018-11-23 11:36:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:08,960 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:36:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:08,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:36:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-23 11:36:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-23 11:36:08,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2018-11-23 11:36:09,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:09,259 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:36:09,259 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 11:36:09,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 11:36:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-23 11:36:09,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:09,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-23 11:36:09,282 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 11:36:09,282 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 11:36:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:09,288 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-23 11:36:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-23 11:36:09,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:09,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:09,290 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 11:36:09,290 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 11:36:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:09,296 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-23 11:36:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-23 11:36:09,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:09,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:09,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:09,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:36:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-11-23 11:36:09,303 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 12 [2018-11-23 11:36:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:09,304 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-11-23 11:36:09,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-23 11:36:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:09,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:09,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:09,306 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:09,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 489213650, now seen corresponding path program 1 times [2018-11-23 11:36:09,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:09,307 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:36:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:09,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:09,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-23 11:36:09,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1243#true} is VALID [2018-11-23 11:36:09,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-23 11:36:09,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #388#return; {1243#true} is VALID [2018-11-23 11:36:09,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret15 := main(); {1243#true} is VALID [2018-11-23 11:36:09,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1243#true} is VALID [2018-11-23 11:36:09,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {1243#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:09,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:09,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {1244#false} is VALID [2018-11-23 11:36:09,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-23 11:36:09,468 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:36:09,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:09,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:09,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:09,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:09,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:09,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:09,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:09,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:09,506 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 5 states. [2018-11-23 11:36:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:10,782 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2018-11-23 11:36:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:10,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-23 11:36:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-23 11:36:10,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 178 transitions. [2018-11-23 11:36:11,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:11,207 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:36:11,208 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 11:36:11,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 11:36:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2018-11-23 11:36:11,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:11,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 122 states. [2018-11-23 11:36:11,236 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 122 states. [2018-11-23 11:36:11,236 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 122 states. [2018-11-23 11:36:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:11,243 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-23 11:36:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-23 11:36:11,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:11,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:11,244 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 155 states. [2018-11-23 11:36:11,245 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 155 states. [2018-11-23 11:36:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:11,251 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-23 11:36:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-23 11:36:11,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:11,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:11,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:11,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:36:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-11-23 11:36:11,258 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 15 [2018-11-23 11:36:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:11,258 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-11-23 11:36:11,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-23 11:36:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:11,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:11,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:11,260 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:11,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-23 11:36:11,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:11,261 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:36:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:11,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:11,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1903#true} is VALID [2018-11-23 11:36:11,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {1903#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1903#true} is VALID [2018-11-23 11:36:11,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2018-11-23 11:36:11,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #388#return; {1903#true} is VALID [2018-11-23 11:36:11,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret15 := main(); {1903#true} is VALID [2018-11-23 11:36:11,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {1903#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1903#true} is VALID [2018-11-23 11:36:11,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {1903#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:11,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:11,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {1904#false} is VALID [2018-11-23 11:36:11,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2018-11-23 11:36:11,487 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:36:11,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:11,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:11,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:11,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:11,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:11,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:11,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:11,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:11,509 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 5 states. [2018-11-23 11:36:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:13,013 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-23 11:36:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:13,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-23 11:36:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-23 11:36:13,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 176 transitions. [2018-11-23 11:36:13,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:13,377 INFO L225 Difference]: With dead ends: 155 [2018-11-23 11:36:13,377 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 11:36:13,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 11:36:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 125. [2018-11-23 11:36:13,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:13,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 125 states. [2018-11-23 11:36:13,396 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 125 states. [2018-11-23 11:36:13,396 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 125 states. [2018-11-23 11:36:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:13,401 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-23 11:36:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-23 11:36:13,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:13,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:13,402 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 153 states. [2018-11-23 11:36:13,402 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 153 states. [2018-11-23 11:36:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:13,407 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-23 11:36:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-23 11:36:13,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:13,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:13,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:13,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 11:36:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-23 11:36:13,413 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 15 [2018-11-23 11:36:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:13,413 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-23 11:36:13,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-23 11:36:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:13,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:13,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:13,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:13,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2014242973, now seen corresponding path program 1 times [2018-11-23 11:36:13,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:13,416 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:36:13,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:13,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:13,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2561#true} is VALID [2018-11-23 11:36:13,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {2561#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {2561#true} is VALID [2018-11-23 11:36:13,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2018-11-23 11:36:13,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #388#return; {2561#true} is VALID [2018-11-23 11:36:13,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret15 := main(); {2561#true} is VALID [2018-11-23 11:36:13,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {2561#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2561#true} is VALID [2018-11-23 11:36:13,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {2561#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:13,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:13,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:13,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:13,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2597#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:13,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {2597#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:13,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:13,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:13,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {2562#false} is VALID [2018-11-23 11:36:13,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2018-11-23 11:36:13,583 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:36:13,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:13,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:13,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:13,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:13,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:13,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:13,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:13,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:13,606 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 6 states. [2018-11-23 11:36:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:15,049 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-23 11:36:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:15,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-23 11:36:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-23 11:36:15,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 174 transitions. [2018-11-23 11:36:15,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:15,351 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:36:15,352 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 11:36:15,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 11:36:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 123. [2018-11-23 11:36:15,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:15,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 123 states. [2018-11-23 11:36:15,367 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 123 states. [2018-11-23 11:36:15,368 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 123 states. [2018-11-23 11:36:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:15,372 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-23 11:36:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-23 11:36:15,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:15,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:15,373 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 148 states. [2018-11-23 11:36:15,373 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 148 states. [2018-11-23 11:36:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:15,378 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-23 11:36:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-23 11:36:15,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:15,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:15,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:15,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:36:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-11-23 11:36:15,383 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 16 [2018-11-23 11:36:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:15,384 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-11-23 11:36:15,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-23 11:36:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:15,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:15,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:15,385 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:15,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-23 11:36:15,386 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:15,386 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:36:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:15,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:15,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {3208#true} call ULTIMATE.init(); {3208#true} is VALID [2018-11-23 11:36:15,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {3208#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3208#true} is VALID [2018-11-23 11:36:15,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {3208#true} assume true; {3208#true} is VALID [2018-11-23 11:36:15,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3208#true} {3208#true} #388#return; {3208#true} is VALID [2018-11-23 11:36:15,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {3208#true} call #t~ret15 := main(); {3208#true} is VALID [2018-11-23 11:36:15,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {3208#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3208#true} is VALID [2018-11-23 11:36:15,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {3208#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:15,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:15,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:15,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {3209#false} is VALID [2018-11-23 11:36:15,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {3209#false} assume !false; {3209#false} is VALID [2018-11-23 11:36:15,544 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:36:15,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:15,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:15,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:15,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:15,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:15,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:15,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:15,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:15,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:15,565 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 6 states. [2018-11-23 11:36:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:17,177 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-23 11:36:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:17,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-23 11:36:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-23 11:36:17,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 169 transitions. [2018-11-23 11:36:17,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:17,951 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:36:17,951 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 11:36:17,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 11:36:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2018-11-23 11:36:17,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:17,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 122 states. [2018-11-23 11:36:17,970 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 122 states. [2018-11-23 11:36:17,970 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 122 states. [2018-11-23 11:36:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:17,974 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-23 11:36:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-23 11:36:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:17,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:17,975 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 144 states. [2018-11-23 11:36:17,975 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 144 states. [2018-11-23 11:36:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:17,980 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-23 11:36:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-23 11:36:17,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:17,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:17,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:17,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:36:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2018-11-23 11:36:17,985 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 16 [2018-11-23 11:36:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:17,985 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2018-11-23 11:36:17,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-23 11:36:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:17,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:17,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:17,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:17,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-23 11:36:17,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:17,988 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:36:18,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:18,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:18,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2018-11-23 11:36:18,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {3840#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3840#true} is VALID [2018-11-23 11:36:18,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2018-11-23 11:36:18,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #388#return; {3840#true} is VALID [2018-11-23 11:36:18,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret15 := main(); {3840#true} is VALID [2018-11-23 11:36:18,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {3840#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3840#true} is VALID [2018-11-23 11:36:18,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:18,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:18,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {3841#false} is VALID [2018-11-23 11:36:18,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2018-11-23 11:36:18,172 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:36:18,172 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:18,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:18,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:18,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:18,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:18,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:18,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:18,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:18,200 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 5 states. [2018-11-23 11:36:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:19,364 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-11-23 11:36:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:19,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-23 11:36:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-23 11:36:19,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-23 11:36:19,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:19,590 INFO L225 Difference]: With dead ends: 175 [2018-11-23 11:36:19,590 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:36:19,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:36:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 125. [2018-11-23 11:36:19,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:19,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 125 states. [2018-11-23 11:36:19,715 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 125 states. [2018-11-23 11:36:19,715 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 125 states. [2018-11-23 11:36:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:19,721 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 11:36:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-23 11:36:19,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:19,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:19,722 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 173 states. [2018-11-23 11:36:19,722 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 173 states. [2018-11-23 11:36:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:19,728 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 11:36:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-23 11:36:19,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:19,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:19,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:19,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 11:36:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-23 11:36:19,733 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 17 [2018-11-23 11:36:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:19,734 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-23 11:36:19,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-23 11:36:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:19,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:19,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:19,735 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:19,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:19,736 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-23 11:36:19,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:19,736 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,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:19,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:20,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {4564#true} call ULTIMATE.init(); {4564#true} is VALID [2018-11-23 11:36:20,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {4564#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {4564#true} is VALID [2018-11-23 11:36:20,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {4564#true} assume true; {4564#true} is VALID [2018-11-23 11:36:20,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4564#true} {4564#true} #388#return; {4564#true} is VALID [2018-11-23 11:36:20,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {4564#true} call #t~ret15 := main(); {4564#true} is VALID [2018-11-23 11:36:20,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {4564#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4564#true} is VALID [2018-11-23 11:36:20,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {4564#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:20,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:20,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {4565#false} is VALID [2018-11-23 11:36:20,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {4565#false} assume !false; {4565#false} is VALID [2018-11-23 11:36:20,074 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:36:20,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:20,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:20,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:20,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:20,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:20,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:20,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:20,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:20,099 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 5 states. [2018-11-23 11:36:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,098 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-11-23 11:36:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:22,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-23 11:36:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-23 11:36:22,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 163 transitions. [2018-11-23 11:36:22,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:22,317 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:36:22,317 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 11:36:22,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 11:36:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-11-23 11:36:22,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:22,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 127 states. [2018-11-23 11:36:22,331 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 127 states. [2018-11-23 11:36:22,331 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 127 states. [2018-11-23 11:36:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,336 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-23 11:36:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-23 11:36:22,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,338 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 140 states. [2018-11-23 11:36:22,338 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 140 states. [2018-11-23 11:36:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,343 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-23 11:36:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-23 11:36:22,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:22,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 11:36:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2018-11-23 11:36:22,348 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 17 [2018-11-23 11:36:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:22,348 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2018-11-23 11:36:22,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2018-11-23 11:36:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:22,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:22,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:22,350 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-23 11:36:22,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:22,351 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,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:22,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:22,782 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:36:23,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {5189#true} call ULTIMATE.init(); {5189#true} is VALID [2018-11-23 11:36:23,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {5189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5189#true} is VALID [2018-11-23 11:36:23,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {5189#true} assume true; {5189#true} is VALID [2018-11-23 11:36:23,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5189#true} {5189#true} #388#return; {5189#true} is VALID [2018-11-23 11:36:23,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {5189#true} call #t~ret15 := main(); {5189#true} is VALID [2018-11-23 11:36:23,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {5189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5189#true} is VALID [2018-11-23 11:36:23,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {5189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {5212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:23,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:23,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:36:23,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:23,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:23,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:23,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:23,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:23,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {5190#false} is VALID [2018-11-23 11:36:23,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2018-11-23 11:36:23,138 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:36:23,138 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:23,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:23,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:23,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:23,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:23,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:23,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:23,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:23,203 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand 7 states. [2018-11-23 11:36:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:25,302 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-23 11:36:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:25,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-23 11:36:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-23 11:36:25,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-23 11:36:25,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:25,530 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:36:25,530 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:36:25,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 11:36:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2018-11-23 11:36:25,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:25,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 128 states. [2018-11-23 11:36:25,544 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 128 states. [2018-11-23 11:36:25,544 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 128 states. [2018-11-23 11:36:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:25,549 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-23 11:36:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-23 11:36:25,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:25,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:25,550 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 172 states. [2018-11-23 11:36:25,550 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 172 states. [2018-11-23 11:36:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:25,554 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-23 11:36:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-23 11:36:25,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:25,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:25,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:25,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 11:36:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2018-11-23 11:36:25,558 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2018-11-23 11:36:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:25,558 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-11-23 11:36:25,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2018-11-23 11:36:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:25,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:25,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:25,559 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:25,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-23 11:36:25,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:25,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:25,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:25,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {5918#true} call ULTIMATE.init(); {5918#true} is VALID [2018-11-23 11:36:25,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {5918#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5918#true} is VALID [2018-11-23 11:36:25,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {5918#true} assume true; {5918#true} is VALID [2018-11-23 11:36:25,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5918#true} {5918#true} #388#return; {5918#true} is VALID [2018-11-23 11:36:25,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {5918#true} call #t~ret15 := main(); {5918#true} is VALID [2018-11-23 11:36:25,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {5918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5918#true} is VALID [2018-11-23 11:36:25,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {5918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:25,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {5919#false} is VALID [2018-11-23 11:36:25,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {5919#false} assume !false; {5919#false} is VALID [2018-11-23 11:36:25,731 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:36:25,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:25,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:25,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:25,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:25,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:25,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:25,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:25,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:25,764 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand 5 states. [2018-11-23 11:36:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:27,277 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-11-23 11:36:27,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:27,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-23 11:36:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-23 11:36:27,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 192 transitions. [2018-11-23 11:36:27,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:27,925 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:36:27,925 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:36:27,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:36:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2018-11-23 11:36:27,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:27,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 130 states. [2018-11-23 11:36:27,932 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 130 states. [2018-11-23 11:36:27,932 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 130 states. [2018-11-23 11:36:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:27,936 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-23 11:36:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-23 11:36:27,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:27,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:27,937 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 167 states. [2018-11-23 11:36:27,937 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 167 states. [2018-11-23 11:36:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:27,941 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-23 11:36:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-23 11:36:27,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:27,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:27,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:27,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 11:36:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-11-23 11:36:27,945 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 18 [2018-11-23 11:36:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:27,945 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-11-23 11:36:27,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-11-23 11:36:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:27,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:27,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:27,947 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:27,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-23 11:36:27,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:27,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:28,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2018-11-23 11:36:28,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {6633#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {6633#true} is VALID [2018-11-23 11:36:28,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2018-11-23 11:36:28,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #388#return; {6633#true} is VALID [2018-11-23 11:36:28,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret15 := main(); {6633#true} is VALID [2018-11-23 11:36:28,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6633#true} is VALID [2018-11-23 11:36:28,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6656#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {6656#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:28,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:28,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:36:28,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:28,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {6634#false} is VALID [2018-11-23 11:36:28,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2018-11-23 11:36:28,757 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:36:28,757 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:28,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:28,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:28,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:28,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:28,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:28,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:28,811 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 7 states. [2018-11-23 11:36:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:29,967 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2018-11-23 11:36:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:29,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-23 11:36:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-23 11:36:29,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 157 transitions. [2018-11-23 11:36:30,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:30,144 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:36:30,144 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 11:36:30,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 11:36:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-23 11:36:30,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:30,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 129 states. [2018-11-23 11:36:30,168 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 129 states. [2018-11-23 11:36:30,168 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 129 states. [2018-11-23 11:36:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,171 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-23 11:36:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-23 11:36:30,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:30,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:30,172 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 132 states. [2018-11-23 11:36:30,172 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 132 states. [2018-11-23 11:36:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,175 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-23 11:36:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-23 11:36:30,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:30,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:30,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:30,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:36:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-11-23 11:36:30,179 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 18 [2018-11-23 11:36:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:30,179 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-11-23 11:36:30,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-11-23 11:36:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:30,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:30,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:30,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:30,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash -481853988, now seen corresponding path program 1 times [2018-11-23 11:36:30,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:30,181 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:30,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:30,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {7244#true} call ULTIMATE.init(); {7244#true} is VALID [2018-11-23 11:36:30,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {7244#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7244#true} is VALID [2018-11-23 11:36:30,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {7244#true} assume true; {7244#true} is VALID [2018-11-23 11:36:30,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7244#true} {7244#true} #388#return; {7244#true} is VALID [2018-11-23 11:36:30,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {7244#true} call #t~ret15 := main(); {7244#true} is VALID [2018-11-23 11:36:30,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {7244#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7244#true} is VALID [2018-11-23 11:36:30,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {7244#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:30,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {7245#false} is VALID [2018-11-23 11:36:30,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {7245#false} assume !false; {7245#false} is VALID [2018-11-23 11:36:30,715 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:36:30,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:30,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:30,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:30,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:30,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:30,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:30,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:30,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:30,743 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 6 states. [2018-11-23 11:36:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,512 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-11-23 11:36:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:32,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-23 11:36:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-23 11:36:32,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-23 11:36:33,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:33,183 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:36:33,183 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 11:36:33,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 11:36:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2018-11-23 11:36:33,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:33,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 133 states. [2018-11-23 11:36:33,213 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 133 states. [2018-11-23 11:36:33,213 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 133 states. [2018-11-23 11:36:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,218 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-23 11:36:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-23 11:36:33,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,219 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 174 states. [2018-11-23 11:36:33,219 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 174 states. [2018-11-23 11:36:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,224 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-23 11:36:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-23 11:36:33,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:33,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 11:36:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-11-23 11:36:33,229 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 19 [2018-11-23 11:36:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:33,229 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-11-23 11:36:33,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-11-23 11:36:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:33,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:33,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:33,231 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:33,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 102497833, now seen corresponding path program 1 times [2018-11-23 11:36:33,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:33,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:33,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {7989#true} call ULTIMATE.init(); {7989#true} is VALID [2018-11-23 11:36:33,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {7989#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7989#true} is VALID [2018-11-23 11:36:33,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {7989#true} assume true; {7989#true} is VALID [2018-11-23 11:36:33,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7989#true} {7989#true} #388#return; {7989#true} is VALID [2018-11-23 11:36:33,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {7989#true} call #t~ret15 := main(); {7989#true} is VALID [2018-11-23 11:36:33,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {7989#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7989#true} is VALID [2018-11-23 11:36:33,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {7989#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:33,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {7990#false} is VALID [2018-11-23 11:36:33,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {7990#false} assume !false; {7990#false} is VALID [2018-11-23 11:36:33,813 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:36:33,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:33,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:33,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:33,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:33,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:33,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:33,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:33,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:33,841 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 6 states. [2018-11-23 11:36:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,528 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-23 11:36:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:35,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-23 11:36:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-23 11:36:35,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2018-11-23 11:36:36,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,201 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:36:36,201 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:36:36,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 11:36:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2018-11-23 11:36:36,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:36,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 135 states. [2018-11-23 11:36:36,233 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 135 states. [2018-11-23 11:36:36,234 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 135 states. [2018-11-23 11:36:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,238 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-23 11:36:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-23 11:36:36,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,239 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 172 states. [2018-11-23 11:36:36,239 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 172 states. [2018-11-23 11:36:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,242 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-23 11:36:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-23 11:36:36,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:36,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:36:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-11-23 11:36:36,246 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 19 [2018-11-23 11:36:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:36,246 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-11-23 11:36:36,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-11-23 11:36:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:36,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:36,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:36,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:36,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-23 11:36:36,248 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:36,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:36,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {8731#true} call ULTIMATE.init(); {8731#true} is VALID [2018-11-23 11:36:36,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {8731#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {8731#true} is VALID [2018-11-23 11:36:36,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {8731#true} assume true; {8731#true} is VALID [2018-11-23 11:36:36,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8731#true} {8731#true} #388#return; {8731#true} is VALID [2018-11-23 11:36:36,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {8731#true} call #t~ret15 := main(); {8731#true} is VALID [2018-11-23 11:36:36,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {8731#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8731#true} is VALID [2018-11-23 11:36:36,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {8731#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {8754#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:36,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:36,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:36:36,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:36,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {8732#false} is VALID [2018-11-23 11:36:36,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {8732#false} assume !false; {8732#false} is VALID [2018-11-23 11:36:36,715 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:36:36,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:36,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:36,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:36:36,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:36,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:36,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:36,772 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand 7 states. [2018-11-23 11:36:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,059 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-11-23 11:36:38,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:38,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:36:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-23 11:36:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-23 11:36:38,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 187 transitions. [2018-11-23 11:36:38,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:38,339 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:36:38,339 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:36:38,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:36:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2018-11-23 11:36:38,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:38,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 135 states. [2018-11-23 11:36:38,367 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 135 states. [2018-11-23 11:36:38,367 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 135 states. [2018-11-23 11:36:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,371 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-23 11:36:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-23 11:36:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:38,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:38,372 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 167 states. [2018-11-23 11:36:38,372 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 167 states. [2018-11-23 11:36:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,375 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-23 11:36:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-23 11:36:38,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:38,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:38,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:38,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:36:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-11-23 11:36:38,379 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 19 [2018-11-23 11:36:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:38,379 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-11-23 11:36:38,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-11-23 11:36:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:38,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:38,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:38,380 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:38,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2052568648, now seen corresponding path program 1 times [2018-11-23 11:36:38,380 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:38,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:38,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:38,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2018-11-23 11:36:38,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {9460#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {9460#true} is VALID [2018-11-23 11:36:38,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2018-11-23 11:36:38,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #388#return; {9460#true} is VALID [2018-11-23 11:36:38,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret15 := main(); {9460#true} is VALID [2018-11-23 11:36:38,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {9460#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9460#true} is VALID [2018-11-23 11:36:38,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {9460#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:38,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:38,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {9461#false} is VALID [2018-11-23 11:36:38,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2018-11-23 11:36:38,576 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:36:38,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:38,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:38,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:38,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:38,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:38,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:38,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:38,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:38,678 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 7 states. [2018-11-23 11:36:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:40,262 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2018-11-23 11:36:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:40,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-23 11:36:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-23 11:36:40,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 192 transitions. [2018-11-23 11:36:40,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:40,493 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:36:40,493 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 11:36:40,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 11:36:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2018-11-23 11:36:40,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:40,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 134 states. [2018-11-23 11:36:40,518 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 134 states. [2018-11-23 11:36:40,518 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 134 states. [2018-11-23 11:36:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:40,521 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-23 11:36:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-23 11:36:40,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:40,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:40,522 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 166 states. [2018-11-23 11:36:40,523 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 166 states. [2018-11-23 11:36:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:40,526 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-23 11:36:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-23 11:36:40,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:40,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:40,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:40,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 11:36:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-23 11:36:40,529 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-23 11:36:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-23 11:36:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-23 11:36:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:40,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:40,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:40,531 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:40,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1117531412, now seen corresponding path program 1 times [2018-11-23 11:36:40,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:40,532 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:40,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:40,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:40,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {10189#true} call ULTIMATE.init(); {10189#true} is VALID [2018-11-23 11:36:40,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {10189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10189#true} is VALID [2018-11-23 11:36:40,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {10189#true} assume true; {10189#true} is VALID [2018-11-23 11:36:40,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10189#true} {10189#true} #388#return; {10189#true} is VALID [2018-11-23 11:36:40,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {10189#true} call #t~ret15 := main(); {10189#true} is VALID [2018-11-23 11:36:40,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {10189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10189#true} is VALID [2018-11-23 11:36:40,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {10189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10238#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {10238#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:40,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:40,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:40,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {10190#false} is VALID [2018-11-23 11:36:40,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {10190#false} assume !false; {10190#false} is VALID [2018-11-23 11:36:40,718 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:36:40,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:40,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:40,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:40,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:40,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:40,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:40,746 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 7 states. [2018-11-23 11:36:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:42,714 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-23 11:36:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:42,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-23 11:36:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-23 11:36:42,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 188 transitions. [2018-11-23 11:36:42,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:42,918 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:36:42,918 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:36:42,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:36:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2018-11-23 11:36:42,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:42,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 132 states. [2018-11-23 11:36:42,928 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 132 states. [2018-11-23 11:36:42,928 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 132 states. [2018-11-23 11:36:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:42,932 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-23 11:36:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-23 11:36:42,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:42,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:42,933 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 161 states. [2018-11-23 11:36:42,933 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 161 states. [2018-11-23 11:36:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:42,936 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-23 11:36:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-23 11:36:42,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:42,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:42,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:42,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:36:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-11-23 11:36:42,939 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 20 [2018-11-23 11:36:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:42,940 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-11-23 11:36:42,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-11-23 11:36:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:42,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:42,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:42,941 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:42,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-23 11:36:42,942 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:42,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:43,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:43,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {10901#true} call ULTIMATE.init(); {10901#true} is VALID [2018-11-23 11:36:43,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {10901#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10901#true} is VALID [2018-11-23 11:36:43,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {10901#true} assume true; {10901#true} is VALID [2018-11-23 11:36:43,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10901#true} {10901#true} #388#return; {10901#true} is VALID [2018-11-23 11:36:43,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {10901#true} call #t~ret15 := main(); {10901#true} is VALID [2018-11-23 11:36:43,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {10901#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10901#true} is VALID [2018-11-23 11:36:43,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {10901#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10956#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {10956#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:43,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {10902#false} is VALID [2018-11-23 11:36:43,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {10902#false} assume !false; {10902#false} is VALID [2018-11-23 11:36:43,099 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:36:43,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:43,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:43,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:43,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:43,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:43,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:43,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:43,132 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 6 states. [2018-11-23 11:36:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,605 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-23 11:36:44,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:44,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-23 11:36:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-23 11:36:44,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 183 transitions. [2018-11-23 11:36:44,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:44,803 INFO L225 Difference]: With dead ends: 161 [2018-11-23 11:36:44,804 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 11:36:44,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 11:36:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-11-23 11:36:44,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:44,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 134 states. [2018-11-23 11:36:44,817 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 134 states. [2018-11-23 11:36:44,817 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 134 states. [2018-11-23 11:36:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,821 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-23 11:36:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-23 11:36:44,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,822 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 159 states. [2018-11-23 11:36:44,822 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 159 states. [2018-11-23 11:36:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,825 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-23 11:36:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-23 11:36:44,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:44,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 11:36:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-23 11:36:44,828 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-23 11:36:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:44,828 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-23 11:36:44,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-23 11:36:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:44,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:44,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:44,830 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:44,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 808149389, now seen corresponding path program 1 times [2018-11-23 11:36:44,830 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:44,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:45,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {11604#true} call ULTIMATE.init(); {11604#true} is VALID [2018-11-23 11:36:45,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {11604#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {11604#true} is VALID [2018-11-23 11:36:45,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {11604#true} assume true; {11604#true} is VALID [2018-11-23 11:36:45,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11604#true} {11604#true} #388#return; {11604#true} is VALID [2018-11-23 11:36:45,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {11604#true} call #t~ret15 := main(); {11604#true} is VALID [2018-11-23 11:36:45,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {11604#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11604#true} is VALID [2018-11-23 11:36:45,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {11604#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:45,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {11605#false} is VALID [2018-11-23 11:36:45,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {11605#false} assume !false; {11605#false} is VALID [2018-11-23 11:36:45,061 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:36:45,062 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (19)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:36:45,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:45,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:45,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:45,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:45,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:45,090 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:36:45,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:45,091 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 6 states. [2018-11-23 11:36:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:46,736 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-11-23 11:36:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:46,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-23 11:36:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-23 11:36:46,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 221 transitions. [2018-11-23 11:36:46,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:46,990 INFO L225 Difference]: With dead ends: 197 [2018-11-23 11:36:46,990 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 11:36:46,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 11:36:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2018-11-23 11:36:47,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:47,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 137 states. [2018-11-23 11:36:47,069 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 137 states. [2018-11-23 11:36:47,069 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 137 states. [2018-11-23 11:36:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:47,073 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-23 11:36:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-23 11:36:47,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:47,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:47,073 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 195 states. [2018-11-23 11:36:47,073 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 195 states. [2018-11-23 11:36:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:47,076 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-23 11:36:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-23 11:36:47,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:47,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:47,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:47,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 11:36:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2018-11-23 11:36:47,079 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2018-11-23 11:36:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:47,079 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2018-11-23 11:36:47,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2018-11-23 11:36:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:47,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:47,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:47,080 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:47,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 809688589, now seen corresponding path program 1 times [2018-11-23 11:36:47,081 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:47,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:47,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2018-11-23 11:36:47,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {12426#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {12426#true} is VALID [2018-11-23 11:36:47,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2018-11-23 11:36:47,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #388#return; {12426#true} is VALID [2018-11-23 11:36:47,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret15 := main(); {12426#true} is VALID [2018-11-23 11:36:47,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {12426#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12426#true} is VALID [2018-11-23 11:36:47,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {12426#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:47,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {12427#false} is VALID [2018-11-23 11:36:47,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2018-11-23 11:36:47,215 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:36:47,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:47,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:47,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:47,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:47,302 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:36:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:47,303 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 6 states. [2018-11-23 11:36:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,950 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-23 11:36:48,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:48,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-23 11:36:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-23 11:36:48,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2018-11-23 11:36:49,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:49,163 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:36:49,163 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 11:36:49,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 11:36:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2018-11-23 11:36:49,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:49,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 139 states. [2018-11-23 11:36:49,172 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 139 states. [2018-11-23 11:36:49,172 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 139 states. [2018-11-23 11:36:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:49,175 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-23 11:36:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-23 11:36:49,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:49,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:49,176 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 155 states. [2018-11-23 11:36:49,176 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 155 states. [2018-11-23 11:36:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:49,179 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-23 11:36:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-23 11:36:49,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:49,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:49,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:49,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 11:36:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2018-11-23 11:36:49,182 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 21 [2018-11-23 11:36:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:49,182 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2018-11-23 11:36:49,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2018-11-23 11:36:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:49,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:49,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:49,184 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:49,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1797106325, now seen corresponding path program 1 times [2018-11-23 11:36:49,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:49,184 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:49,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {13125#true} call ULTIMATE.init(); {13125#true} is VALID [2018-11-23 11:36:49,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {13125#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13125#true} is VALID [2018-11-23 11:36:49,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {13125#true} assume true; {13125#true} is VALID [2018-11-23 11:36:49,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13125#true} {13125#true} #388#return; {13125#true} is VALID [2018-11-23 11:36:49,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {13125#true} call #t~ret15 := main(); {13125#true} is VALID [2018-11-23 11:36:49,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {13125#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13125#true} is VALID [2018-11-23 11:36:49,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {13125#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:49,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {13126#false} is VALID [2018-11-23 11:36:49,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {13126#false} assume !false; {13126#false} is VALID [2018-11-23 11:36:49,417 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:36:49,417 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:49,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:49,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:49,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:49,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:49,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:49,468 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:36:49,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:49,469 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 6 states. [2018-11-23 11:36:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:51,151 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2018-11-23 11:36:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:51,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:36:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-23 11:36:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-23 11:36:51,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 226 transitions. [2018-11-23 11:36:51,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:51,424 INFO L225 Difference]: With dead ends: 200 [2018-11-23 11:36:51,424 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 11:36:51,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 11:36:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 141. [2018-11-23 11:36:51,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:51,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 141 states. [2018-11-23 11:36:51,436 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 141 states. [2018-11-23 11:36:51,436 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 141 states. [2018-11-23 11:36:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:51,440 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-23 11:36:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-23 11:36:51,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:51,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:51,440 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 198 states. [2018-11-23 11:36:51,440 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 198 states. [2018-11-23 11:36:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:51,443 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-23 11:36:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-23 11:36:51,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:51,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:51,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:51,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:36:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-11-23 11:36:51,447 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 21 [2018-11-23 11:36:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:51,448 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-11-23 11:36:51,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-11-23 11:36:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:51,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:51,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:51,449 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:51,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-23 11:36:51,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:51,450 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:51,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:51,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {13962#true} call ULTIMATE.init(); {13962#true} is VALID [2018-11-23 11:36:51,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {13962#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13962#true} is VALID [2018-11-23 11:36:51,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {13962#true} assume true; {13962#true} is VALID [2018-11-23 11:36:51,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13962#true} {13962#true} #388#return; {13962#true} is VALID [2018-11-23 11:36:51,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {13962#true} call #t~ret15 := main(); {13962#true} is VALID [2018-11-23 11:36:51,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {13962#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13962#true} is VALID [2018-11-23 11:36:51,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14017#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {14017#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:51,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:51,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {13963#false} is VALID [2018-11-23 11:36:51,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {13963#false} assume !false; {13963#false} is VALID [2018-11-23 11:36:51,684 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:36:51,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:51,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:51,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:36:51,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:51,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:51,726 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:36:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:51,726 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 7 states. [2018-11-23 11:36:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,330 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-11-23 11:36:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:53,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:36:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-23 11:36:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-23 11:36:53,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 175 transitions. [2018-11-23 11:36:53,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:53,551 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:36:53,551 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:36:53,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:36:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-23 11:36:53,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:53,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 140 states. [2018-11-23 11:36:53,563 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 140 states. [2018-11-23 11:36:53,563 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 140 states. [2018-11-23 11:36:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,566 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-23 11:36:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-23 11:36:53,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,566 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 149 states. [2018-11-23 11:36:53,566 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 149 states. [2018-11-23 11:36:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,568 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-23 11:36:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-23 11:36:53,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:53,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 11:36:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-11-23 11:36:53,571 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 21 [2018-11-23 11:36:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:53,571 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-11-23 11:36:53,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-11-23 11:36:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:36:53,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:53,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:53,573 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:53,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -717169605, now seen corresponding path program 1 times [2018-11-23 11:36:53,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:53,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:53,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:53,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {14648#true} call ULTIMATE.init(); {14648#true} is VALID [2018-11-23 11:36:53,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {14648#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {14648#true} is VALID [2018-11-23 11:36:53,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {14648#true} assume true; {14648#true} is VALID [2018-11-23 11:36:53,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14648#true} {14648#true} #388#return; {14648#true} is VALID [2018-11-23 11:36:53,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {14648#true} call #t~ret15 := main(); {14648#true} is VALID [2018-11-23 11:36:53,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {14648#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14648#true} is VALID [2018-11-23 11:36:53,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {14648#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14671#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {14671#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:53,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:53,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:53,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:53,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:53,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:53,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:53,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:53,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:53,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:53,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:53,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:53,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:53,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {14649#false} is VALID [2018-11-23 11:36:53,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {14649#false} assume !false; {14649#false} is VALID [2018-11-23 11:36:53,960 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:36:53,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:53,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:53,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:36:53,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:36:53,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:53,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:36:53,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:53,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:36:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:36:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:36:53,994 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 9 states. [2018-11-23 11:36:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:56,731 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-11-23 11:36:56,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:36:56,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:36:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:36:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-23 11:36:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:36:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-23 11:36:56,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 194 transitions. [2018-11-23 11:36:57,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:57,025 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:36:57,025 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 11:36:57,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 11:36:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-11-23 11:36:57,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:57,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 146 states. [2018-11-23 11:36:57,365 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 146 states. [2018-11-23 11:36:57,365 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 146 states. [2018-11-23 11:36:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:57,370 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-23 11:36:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-23 11:36:57,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:57,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:57,371 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 190 states. [2018-11-23 11:36:57,371 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 190 states. [2018-11-23 11:36:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:57,373 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-23 11:36:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-23 11:36:57,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:57,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:57,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:57,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 11:36:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-11-23 11:36:57,376 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 22 [2018-11-23 11:36:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:57,376 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-11-23 11:36:57,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:36:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-11-23 11:36:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:36:57,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:57,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:57,377 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:57,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -669454355, now seen corresponding path program 1 times [2018-11-23 11:36:57,378 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:57,378 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:57,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:57,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:57,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {15471#true} call ULTIMATE.init(); {15471#true} is VALID [2018-11-23 11:36:57,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {15471#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {15471#true} is VALID [2018-11-23 11:36:57,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {15471#true} assume true; {15471#true} is VALID [2018-11-23 11:36:57,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15471#true} {15471#true} #388#return; {15471#true} is VALID [2018-11-23 11:36:57,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {15471#true} call #t~ret15 := main(); {15471#true} is VALID [2018-11-23 11:36:57,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {15471#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15471#true} is VALID [2018-11-23 11:36:57,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {15471#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15494#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:57,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {15494#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:57,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:57,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:57,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:57,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:57,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:57,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:57,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:57,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:57,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:57,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:57,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:57,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:57,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {15472#false} is VALID [2018-11-23 11:36:57,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {15472#false} assume !false; {15472#false} is VALID [2018-11-23 11:36:57,699 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:36:57,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:36:57,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:36:57,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:57,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:36:57,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:57,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:36:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:36:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:36:57,733 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 9 states. [2018-11-23 11:36:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,779 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2018-11-23 11:36:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:59,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:36:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:36:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-23 11:36:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:36:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-23 11:36:59,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2018-11-23 11:36:59,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:59,961 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:36:59,961 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:36:59,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:37:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-11-23 11:37:00,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:00,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 147 states. [2018-11-23 11:37:00,052 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 147 states. [2018-11-23 11:37:00,052 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 147 states. [2018-11-23 11:37:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:00,055 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-23 11:37:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-23 11:37:00,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:00,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:00,056 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 152 states. [2018-11-23 11:37:00,056 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 152 states. [2018-11-23 11:37:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:00,058 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-23 11:37:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-23 11:37:00,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:00,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:00,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:00,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 11:37:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-11-23 11:37:00,060 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 22 [2018-11-23 11:37:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:00,061 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-11-23 11:37:00,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-11-23 11:37:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:00,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:00,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:00,062 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:00,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash 124281916, now seen corresponding path program 1 times [2018-11-23 11:37:00,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:00,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:00,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:00,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {16181#true} call ULTIMATE.init(); {16181#true} is VALID [2018-11-23 11:37:00,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {16181#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {16181#true} is VALID [2018-11-23 11:37:00,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {16181#true} assume true; {16181#true} is VALID [2018-11-23 11:37:00,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16181#true} {16181#true} #388#return; {16181#true} is VALID [2018-11-23 11:37:00,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {16181#true} call #t~ret15 := main(); {16181#true} is VALID [2018-11-23 11:37:00,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {16181#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16181#true} is VALID [2018-11-23 11:37:00,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {16181#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16204#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {16204#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:00,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:00,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:37:00,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:00,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:00,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:00,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:00,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {16182#false} is VALID [2018-11-23 11:37:00,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#false} assume !false; {16182#false} is VALID [2018-11-23 11:37:00,335 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:37:00,335 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:00,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:00,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:37:00,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:37:00,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:00,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:00,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:00,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:00,370 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 9 states. [2018-11-23 11:37:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:03,169 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-23 11:37:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:03,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:37:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-23 11:37:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-23 11:37:03,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 209 transitions. [2018-11-23 11:37:03,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:03,439 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:37:03,440 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 11:37:03,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 11:37:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2018-11-23 11:37:03,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:03,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 150 states. [2018-11-23 11:37:03,598 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 150 states. [2018-11-23 11:37:03,598 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 150 states. [2018-11-23 11:37:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:03,609 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-23 11:37:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-23 11:37:03,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:03,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:03,612 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 192 states. [2018-11-23 11:37:03,612 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 192 states. [2018-11-23 11:37:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:03,625 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-23 11:37:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-23 11:37:03,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:03,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:03,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:03,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:37:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-23 11:37:03,634 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 22 [2018-11-23 11:37:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:03,635 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-23 11:37:03,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-23 11:37:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:03,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:03,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:03,636 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:03,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -715090112, now seen corresponding path program 1 times [2018-11-23 11:37:03,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:03,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:03,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {17018#true} call ULTIMATE.init(); {17018#true} is VALID [2018-11-23 11:37:03,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {17018#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17018#true} is VALID [2018-11-23 11:37:03,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {17018#true} assume true; {17018#true} is VALID [2018-11-23 11:37:03,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17018#true} {17018#true} #388#return; {17018#true} is VALID [2018-11-23 11:37:03,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {17018#true} call #t~ret15 := main(); {17018#true} is VALID [2018-11-23 11:37:03,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {17018#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17018#true} is VALID [2018-11-23 11:37:03,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {17018#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {17041#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:03,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:03,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:03,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:03,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:03,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:03,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:03,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:03,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:03,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {17019#false} is VALID [2018-11-23 11:37:03,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {17019#false} assume !false; {17019#false} is VALID [2018-11-23 11:37:03,926 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:37:03,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:03,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:03,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:37:03,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 11:37:03,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:03,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:03,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:03,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:03,960 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 9 states. [2018-11-23 11:37:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,782 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2018-11-23 11:37:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:05,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 11:37:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-23 11:37:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-23 11:37:05,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 188 transitions. [2018-11-23 11:37:06,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:06,056 INFO L225 Difference]: With dead ends: 187 [2018-11-23 11:37:06,056 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:37:06,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:37:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2018-11-23 11:37:06,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:06,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 148 states. [2018-11-23 11:37:06,081 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 148 states. [2018-11-23 11:37:06,081 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 148 states. [2018-11-23 11:37:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,085 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-23 11:37:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-23 11:37:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:06,085 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 185 states. [2018-11-23 11:37:06,086 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 185 states. [2018-11-23 11:37:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,089 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-23 11:37:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-23 11:37:06,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:06,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:06,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:06,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 11:37:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-11-23 11:37:06,094 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 23 [2018-11-23 11:37:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:06,094 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-11-23 11:37:06,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-23 11:37:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:06,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:06,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:06,095 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:06,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1709433728, now seen corresponding path program 1 times [2018-11-23 11:37:06,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:06,096 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:06,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:06,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:06,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {17831#true} call ULTIMATE.init(); {17831#true} is VALID [2018-11-23 11:37:06,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {17831#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17831#true} is VALID [2018-11-23 11:37:06,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {17831#true} assume true; {17831#true} is VALID [2018-11-23 11:37:06,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17831#true} {17831#true} #388#return; {17831#true} is VALID [2018-11-23 11:37:06,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {17831#true} call #t~ret15 := main(); {17831#true} is VALID [2018-11-23 11:37:06,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {17831#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17831#true} is VALID [2018-11-23 11:37:06,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {17831#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:06,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {17832#false} is VALID [2018-11-23 11:37:06,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {17832#false} assume !false; {17832#false} is VALID [2018-11-23 11:37:06,256 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:37:06,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:06,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:06,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:06,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:37:06,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:06,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:06,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:06,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:06,288 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 7 states. [2018-11-23 11:37:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:08,409 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2018-11-23 11:37:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:08,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:37:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-23 11:37:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-23 11:37:08,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 214 transitions. [2018-11-23 11:37:09,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:09,171 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:37:09,171 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 11:37:09,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 11:37:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 150. [2018-11-23 11:37:09,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:09,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 150 states. [2018-11-23 11:37:09,204 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 150 states. [2018-11-23 11:37:09,205 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 150 states. [2018-11-23 11:37:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,209 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-23 11:37:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-23 11:37:09,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,210 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 196 states. [2018-11-23 11:37:09,210 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 196 states. [2018-11-23 11:37:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,215 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-23 11:37:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-23 11:37:09,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:09,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:37:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-23 11:37:09,219 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 23 [2018-11-23 11:37:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:09,220 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-23 11:37:09,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-23 11:37:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:09,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:09,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:09,221 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:09,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1124307341, now seen corresponding path program 1 times [2018-11-23 11:37:09,222 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:10,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {18678#true} call ULTIMATE.init(); {18678#true} is VALID [2018-11-23 11:37:10,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {18678#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {18678#true} is VALID [2018-11-23 11:37:10,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {18678#true} assume true; {18678#true} is VALID [2018-11-23 11:37:10,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18678#true} {18678#true} #388#return; {18678#true} is VALID [2018-11-23 11:37:10,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {18678#true} call #t~ret15 := main(); {18678#true} is VALID [2018-11-23 11:37:10,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {18678#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18678#true} is VALID [2018-11-23 11:37:10,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {18678#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:10,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {18679#false} is VALID [2018-11-23 11:37:10,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {18679#false} assume !false; {18679#false} is VALID [2018-11-23 11:37:10,069 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:37:10,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:10,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:10,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:10,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:37:10,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:10,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:10,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:10,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:10,103 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 7 states. [2018-11-23 11:37:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,570 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-23 11:37:12,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:12,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:37:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-23 11:37:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-23 11:37:12,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 212 transitions. [2018-11-23 11:37:13,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:13,405 INFO L225 Difference]: With dead ends: 196 [2018-11-23 11:37:13,405 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:37:13,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:37:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 153. [2018-11-23 11:37:13,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:13,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 153 states. [2018-11-23 11:37:13,425 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 153 states. [2018-11-23 11:37:13,425 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 153 states. [2018-11-23 11:37:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,430 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-23 11:37:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-23 11:37:13,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,431 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 194 states. [2018-11-23 11:37:13,431 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 194 states. [2018-11-23 11:37:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,436 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-23 11:37:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-23 11:37:13,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:13,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:37:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-23 11:37:13,440 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 23 [2018-11-23 11:37:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:13,440 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-23 11:37:13,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-23 11:37:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:13,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:13,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:13,441 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:13,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2005126242, now seen corresponding path program 1 times [2018-11-23 11:37:13,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:13,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:13,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:14,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {19523#true} call ULTIMATE.init(); {19523#true} is VALID [2018-11-23 11:37:14,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {19523#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {19523#true} is VALID [2018-11-23 11:37:14,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {19523#true} assume true; {19523#true} is VALID [2018-11-23 11:37:14,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19523#true} {19523#true} #388#return; {19523#true} is VALID [2018-11-23 11:37:14,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {19523#true} call #t~ret15 := main(); {19523#true} is VALID [2018-11-23 11:37:14,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {19523#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19523#true} is VALID [2018-11-23 11:37:14,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {19523#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19591#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:14,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {19591#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:14,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {19524#false} is VALID [2018-11-23 11:37:14,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {19524#false} assume !false; {19524#false} is VALID [2018-11-23 11:37:14,099 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:37:14,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:14,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 11:37:14,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:14,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:14,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:14,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:14,133 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-23 11:37:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,135 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-23 11:37:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:16,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 11:37:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-23 11:37:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-23 11:37:16,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 210 transitions. [2018-11-23 11:37:16,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:16,415 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:37:16,415 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 11:37:16,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 11:37:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-11-23 11:37:16,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:16,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 156 states. [2018-11-23 11:37:16,432 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 156 states. [2018-11-23 11:37:16,433 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 156 states. [2018-11-23 11:37:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,437 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-23 11:37:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-23 11:37:16,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:16,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:16,438 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 192 states. [2018-11-23 11:37:16,438 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 192 states. [2018-11-23 11:37:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,440 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-23 11:37:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-23 11:37:16,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:16,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:16,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:16,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:37:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-11-23 11:37:16,443 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 24 [2018-11-23 11:37:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:16,443 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-11-23 11:37:16,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-11-23 11:37:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:16,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:16,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:16,444 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:16,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1452841077, now seen corresponding path program 1 times [2018-11-23 11:37:16,444 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:16,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:16,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:16,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2018-11-23 11:37:16,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {20368#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {20368#true} is VALID [2018-11-23 11:37:16,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {20368#true} assume true; {20368#true} is VALID [2018-11-23 11:37:16,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20368#true} {20368#true} #388#return; {20368#true} is VALID [2018-11-23 11:37:16,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {20368#true} call #t~ret15 := main(); {20368#true} is VALID [2018-11-23 11:37:16,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {20368#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20368#true} is VALID [2018-11-23 11:37:16,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {20368#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20430#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {20430#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:16,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:16,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:16,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {20369#false} is VALID [2018-11-23 11:37:16,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2018-11-23 11:37:16,630 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:37:16,630 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:16,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:16,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:16,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:16,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:16,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:16,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:16,663 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 8 states. [2018-11-23 11:37:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:19,261 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-23 11:37:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:19,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-23 11:37:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-23 11:37:19,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 208 transitions. [2018-11-23 11:37:19,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:19,497 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:37:19,497 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:37:19,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:37:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-11-23 11:37:19,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:19,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 154 states. [2018-11-23 11:37:19,535 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 154 states. [2018-11-23 11:37:19,535 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 154 states. [2018-11-23 11:37:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:19,540 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-23 11:37:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-23 11:37:19,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:19,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:19,540 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 187 states. [2018-11-23 11:37:19,540 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 187 states. [2018-11-23 11:37:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:19,543 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-23 11:37:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-23 11:37:19,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:19,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:19,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:19,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 11:37:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-11-23 11:37:19,545 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 24 [2018-11-23 11:37:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:19,546 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-11-23 11:37:19,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-11-23 11:37:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:19,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:19,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:19,546 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:19,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 493792295, now seen corresponding path program 1 times [2018-11-23 11:37:19,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:19,547 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 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 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:19,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:19,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:19,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {21199#true} call ULTIMATE.init(); {21199#true} is VALID [2018-11-23 11:37:19,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {21199#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {21199#true} is VALID [2018-11-23 11:37:19,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {21199#true} assume true; {21199#true} is VALID [2018-11-23 11:37:19,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21199#true} {21199#true} #388#return; {21199#true} is VALID [2018-11-23 11:37:19,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {21199#true} call #t~ret15 := main(); {21199#true} is VALID [2018-11-23 11:37:19,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {21199#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21199#true} is VALID [2018-11-23 11:37:19,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {21199#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:19,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:19,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {21200#false} is VALID [2018-11-23 11:37:19,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {21200#false} assume !false; {21200#false} is VALID [2018-11-23 11:37:19,727 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:37:19,727 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:19,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:19,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:19,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:19,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:19,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:19,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:19,777 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 8 states. [2018-11-23 11:37:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,173 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-23 11:37:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:22,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-23 11:37:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-23 11:37:22,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 203 transitions. [2018-11-23 11:37:22,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:22,473 INFO L225 Difference]: With dead ends: 187 [2018-11-23 11:37:22,473 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 11:37:22,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 11:37:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-11-23 11:37:22,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:22,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 153 states. [2018-11-23 11:37:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 153 states. [2018-11-23 11:37:22,564 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 153 states. [2018-11-23 11:37:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,566 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-23 11:37:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-23 11:37:22,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,567 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 183 states. [2018-11-23 11:37:22,567 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 183 states. [2018-11-23 11:37:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,569 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-23 11:37:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-23 11:37:22,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:22,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:37:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-23 11:37:22,573 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 24 [2018-11-23 11:37:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:22,573 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-23 11:37:22,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-23 11:37:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:22,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:22,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:22,574 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:22,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2028941227, now seen corresponding path program 1 times [2018-11-23 11:37:22,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:22,575 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 32 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 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:22,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:22,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {22015#true} call ULTIMATE.init(); {22015#true} is VALID [2018-11-23 11:37:22,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {22015#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {22015#true} is VALID [2018-11-23 11:37:22,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-23 11:37:22,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22015#true} {22015#true} #388#return; {22015#true} is VALID [2018-11-23 11:37:22,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {22015#true} call #t~ret15 := main(); {22015#true} is VALID [2018-11-23 11:37:22,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {22015#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22015#true} is VALID [2018-11-23 11:37:22,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {22015#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:22,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {22016#false} is VALID [2018-11-23 11:37:22,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {22016#false} assume !false; {22016#false} is VALID [2018-11-23 11:37:22,783 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:37:22,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:22,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:22,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:22,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:22,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:22,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:22,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:22,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:22,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:22,883 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-23 11:37:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,328 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2018-11-23 11:37:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:25,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-23 11:37:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-23 11:37:25,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 267 transitions. [2018-11-23 11:37:25,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:25,645 INFO L225 Difference]: With dead ends: 238 [2018-11-23 11:37:25,646 INFO L226 Difference]: Without dead ends: 236 [2018-11-23 11:37:25,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-23 11:37:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 158. [2018-11-23 11:37:25,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:25,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 158 states. [2018-11-23 11:37:25,675 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 158 states. [2018-11-23 11:37:25,676 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 158 states. [2018-11-23 11:37:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,681 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-23 11:37:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-23 11:37:25,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:25,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:25,681 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 236 states. [2018-11-23 11:37:25,681 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 236 states. [2018-11-23 11:37:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,686 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-23 11:37:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-23 11:37:25,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:25,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:25,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:25,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 11:37:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2018-11-23 11:37:25,689 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 25 [2018-11-23 11:37:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:25,690 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2018-11-23 11:37:25,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2018-11-23 11:37:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:25,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:25,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:25,691 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:25,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2029368231, now seen corresponding path program 1 times [2018-11-23 11:37:25,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:25,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 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 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:25,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:25,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:25,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {23005#true} call ULTIMATE.init(); {23005#true} is VALID [2018-11-23 11:37:25,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {23005#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23005#true} is VALID [2018-11-23 11:37:25,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {23005#true} assume true; {23005#true} is VALID [2018-11-23 11:37:25,913 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23005#true} {23005#true} #388#return; {23005#true} is VALID [2018-11-23 11:37:25,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {23005#true} call #t~ret15 := main(); {23005#true} is VALID [2018-11-23 11:37:25,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {23005#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23005#true} is VALID [2018-11-23 11:37:25,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {23005#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23073#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {23073#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:25,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {23006#false} is VALID [2018-11-23 11:37:25,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {23006#false} assume !false; {23006#false} is VALID [2018-11-23 11:37:25,924 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:37:25,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:25,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:25,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:25,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:37:25,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:25,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:25,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:25,956 INFO L87 Difference]: Start difference. First operand 158 states and 187 transitions. Second operand 8 states. [2018-11-23 11:37:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,082 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-23 11:37:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:28,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:37:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-23 11:37:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-23 11:37:28,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-23 11:37:28,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:28,308 INFO L225 Difference]: With dead ends: 181 [2018-11-23 11:37:28,308 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 11:37:28,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 11:37:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2018-11-23 11:37:28,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:28,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 157 states. [2018-11-23 11:37:28,431 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 157 states. [2018-11-23 11:37:28,432 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 157 states. [2018-11-23 11:37:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,435 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-23 11:37:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-23 11:37:28,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,436 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 177 states. [2018-11-23 11:37:28,436 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 177 states. [2018-11-23 11:37:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,439 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-23 11:37:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-23 11:37:28,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:28,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 11:37:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2018-11-23 11:37:28,443 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 25 [2018-11-23 11:37:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:28,443 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-11-23 11:37:28,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2018-11-23 11:37:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:28,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:28,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:28,445 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:28,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1859040002, now seen corresponding path program 1 times [2018-11-23 11:37:28,445 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:28,445 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 34 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 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:28,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:28,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {23811#true} call ULTIMATE.init(); {23811#true} is VALID [2018-11-23 11:37:28,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {23811#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23811#true} is VALID [2018-11-23 11:37:28,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {23811#true} assume true; {23811#true} is VALID [2018-11-23 11:37:28,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23811#true} {23811#true} #388#return; {23811#true} is VALID [2018-11-23 11:37:28,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {23811#true} call #t~ret15 := main(); {23811#true} is VALID [2018-11-23 11:37:28,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {23811#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23811#true} is VALID [2018-11-23 11:37:28,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {23811#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:28,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {23812#false} is VALID [2018-11-23 11:37:28,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {23812#false} assume !false; {23812#false} is VALID [2018-11-23 11:37:28,668 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:37:28,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:28,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:28,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:28,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:28,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:28,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:28,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:28,704 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 7 states. [2018-11-23 11:37:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:30,861 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2018-11-23 11:37:30,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:30,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-23 11:37:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-23 11:37:30,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 247 transitions. [2018-11-23 11:37:31,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:31,143 INFO L225 Difference]: With dead ends: 227 [2018-11-23 11:37:31,143 INFO L226 Difference]: Without dead ends: 225 [2018-11-23 11:37:31,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-23 11:37:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 158. [2018-11-23 11:37:31,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:31,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 158 states. [2018-11-23 11:37:31,172 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 158 states. [2018-11-23 11:37:31,172 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 158 states. [2018-11-23 11:37:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:31,177 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-23 11:37:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-23 11:37:31,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:31,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:31,177 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 225 states. [2018-11-23 11:37:31,178 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 225 states. [2018-11-23 11:37:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:31,182 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-23 11:37:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-23 11:37:31,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:31,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:31,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:31,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 11:37:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-23 11:37:31,185 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-23 11:37:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:31,185 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-23 11:37:31,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-23 11:37:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:31,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:31,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:31,187 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:31,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1857500802, now seen corresponding path program 1 times [2018-11-23 11:37:31,187 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 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 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:31,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:31,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {24768#true} call ULTIMATE.init(); {24768#true} is VALID [2018-11-23 11:37:31,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {24768#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {24768#true} is VALID [2018-11-23 11:37:31,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {24768#true} assume true; {24768#true} is VALID [2018-11-23 11:37:31,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24768#true} {24768#true} #388#return; {24768#true} is VALID [2018-11-23 11:37:31,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {24768#true} call #t~ret15 := main(); {24768#true} is VALID [2018-11-23 11:37:31,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {24768#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24768#true} is VALID [2018-11-23 11:37:31,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {24768#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:31,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:31,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {24769#false} is VALID [2018-11-23 11:37:31,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {24769#false} assume !false; {24769#false} is VALID [2018-11-23 11:37:31,423 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:37:31,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:31,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:31,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:31,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:31,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:31,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:31,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:31,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:31,455 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 7 states. [2018-11-23 11:37:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,543 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-11-23 11:37:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:33,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-23 11:37:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-23 11:37:33,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2018-11-23 11:37:33,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:33,758 INFO L225 Difference]: With dead ends: 175 [2018-11-23 11:37:33,758 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:37:33,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:37:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-11-23 11:37:33,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:33,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 158 states. [2018-11-23 11:37:33,783 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 158 states. [2018-11-23 11:37:33,783 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 158 states. [2018-11-23 11:37:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,786 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-23 11:37:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-23 11:37:33,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:33,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:33,787 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 173 states. [2018-11-23 11:37:33,787 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 173 states. [2018-11-23 11:37:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,789 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-23 11:37:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-23 11:37:33,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:33,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:33,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:33,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 11:37:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-23 11:37:33,792 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-23 11:37:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:33,792 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-23 11:37:33,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-23 11:37:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:33,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:33,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:33,793 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:33,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -920208099, now seen corresponding path program 1 times [2018-11-23 11:37:33,795 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 36 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 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:33,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:34,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-23 11:37:34,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25585#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:34,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {25585#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:34,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:34,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:37:34,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:34,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {25563#false} is VALID [2018-11-23 11:37:34,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-23 11:37:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:34,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:34,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-23 11:37:34,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {25563#false} is VALID [2018-11-23 11:37:34,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-23 11:37:34,721 INFO L273 TraceCheckUtils]: 21: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:34,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:34,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:34,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-23 11:37:34,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {25562#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:34,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-23 11:37:34,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-23 11:37:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:34,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:34,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:37:34,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:37:34,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:34,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:37:34,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:34,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:37:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:37:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:37:34,925 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-11-23 11:37:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:43,909 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2018-11-23 11:37:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:43,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:37:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 199 transitions. [2018-11-23 11:37:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 199 transitions. [2018-11-23 11:37:43,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 199 transitions. [2018-11-23 11:37:44,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:44,380 INFO L225 Difference]: With dead ends: 201 [2018-11-23 11:37:44,380 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 11:37:44,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:37:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 11:37:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 153. [2018-11-23 11:37:44,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:44,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 153 states. [2018-11-23 11:37:44,522 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 153 states. [2018-11-23 11:37:44,522 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 153 states. [2018-11-23 11:37:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:44,526 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2018-11-23 11:37:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-11-23 11:37:44,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:44,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:44,527 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 199 states. [2018-11-23 11:37:44,527 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 199 states. [2018-11-23 11:37:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:44,530 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2018-11-23 11:37:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-11-23 11:37:44,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:44,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:44,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:44,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:37:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-23 11:37:44,532 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 25 [2018-11-23 11:37:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:44,532 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-23 11:37:44,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:37:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-23 11:37:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:44,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:44,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:44,534 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:44,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash -872492849, now seen corresponding path program 1 times [2018-11-23 11:37:44,534 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:44,534 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 37 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 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:44,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:44,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {26533#true} call ULTIMATE.init(); {26533#true} is VALID [2018-11-23 11:37:44,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {26533#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {26533#true} is VALID [2018-11-23 11:37:44,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {26533#true} assume true; {26533#true} is VALID [2018-11-23 11:37:44,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26533#true} {26533#true} #388#return; {26533#true} is VALID [2018-11-23 11:37:44,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {26533#true} call #t~ret15 := main(); {26533#true} is VALID [2018-11-23 11:37:44,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {26533#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26533#true} is VALID [2018-11-23 11:37:44,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {26533#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:44,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {26556#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:44,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:44,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26567#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:37:44,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {26567#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:44,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:44,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:44,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:44,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:44,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:44,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26610#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:44,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {26610#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {26534#false} is VALID [2018-11-23 11:37:44,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {26534#false} assume !false; {26534#false} is VALID [2018-11-23 11:37:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:44,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:45,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {26534#false} assume !false; {26534#false} is VALID [2018-11-23 11:37:45,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {26620#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {26534#false} is VALID [2018-11-23 11:37:45,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26620#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} is VALID [2018-11-23 11:37:45,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:45,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:45,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {26663#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:45,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26663#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-23 11:37:45,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:45,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {26533#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:45,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {26533#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26533#true} is VALID [2018-11-23 11:37:45,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {26533#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26533#true} is VALID [2018-11-23 11:37:45,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {26533#true} call #t~ret15 := main(); {26533#true} is VALID [2018-11-23 11:37:45,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26533#true} {26533#true} #388#return; {26533#true} is VALID [2018-11-23 11:37:45,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {26533#true} assume true; {26533#true} is VALID [2018-11-23 11:37:45,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {26533#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {26533#true} is VALID [2018-11-23 11:37:45,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {26533#true} call ULTIMATE.init(); {26533#true} is VALID [2018-11-23 11:37:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:45,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:37:45,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:37:45,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:45,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:37:45,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:45,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:37:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:37:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:37:45,750 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 15 states. [2018-11-23 11:37:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:56,652 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-11-23 11:37:56,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:37:56,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:37:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2018-11-23 11:37:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2018-11-23 11:37:56,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 163 transitions. [2018-11-23 11:37:57,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:57,051 INFO L225 Difference]: With dead ends: 155 [2018-11-23 11:37:57,051 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:37:57,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:37:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:37:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-11-23 11:37:57,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:57,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 145 states. [2018-11-23 11:37:57,162 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 145 states. [2018-11-23 11:37:57,162 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 145 states. [2018-11-23 11:37:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,164 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-11-23 11:37:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-11-23 11:37:57,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:57,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:57,165 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 149 states. [2018-11-23 11:37:57,165 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 149 states. [2018-11-23 11:37:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,167 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-11-23 11:37:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-11-23 11:37:57,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:57,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:57,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:57,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 11:37:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2018-11-23 11:37:57,169 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 25 [2018-11-23 11:37:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:57,170 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2018-11-23 11:37:57,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:37:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2018-11-23 11:37:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:57,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:57,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:57,171 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:57,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1527334546, now seen corresponding path program 1 times [2018-11-23 11:37:57,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:57,171 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 38 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 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:57,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:57,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {27338#true} call ULTIMATE.init(); {27338#true} is VALID [2018-11-23 11:37:57,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {27338#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {27338#true} is VALID [2018-11-23 11:37:57,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {27338#true} assume true; {27338#true} is VALID [2018-11-23 11:37:57,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27338#true} {27338#true} #388#return; {27338#true} is VALID [2018-11-23 11:37:57,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {27338#true} call #t~ret15 := main(); {27338#true} is VALID [2018-11-23 11:37:57,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {27338#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27338#true} is VALID [2018-11-23 11:37:57,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {27338#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:57,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:57,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:57,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {27371#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-23 11:37:57,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {27371#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:57,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:57,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:57,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:57,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:57,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:57,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:57,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:57,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:57,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {27405#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~7 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-23 11:37:57,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {27405#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~7 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27409#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:37:57,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {27409#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:37:57,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:37:57,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {27420#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:57,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {27420#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {27339#false} is VALID [2018-11-23 11:37:57,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {27339#false} assume !false; {27339#false} is VALID [2018-11-23 11:37:57,636 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:37:57,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:57,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:37:57,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 11:37:57,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:57,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:37:57,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:57,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:37:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:37:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:57,674 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 11 states. [2018-11-23 11:38:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:00,861 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-23 11:38:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:00,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 11:38:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2018-11-23 11:38:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2018-11-23 11:38:00,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 181 transitions. [2018-11-23 11:38:01,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:01,087 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:38:01,088 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 11:38:01,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 11:38:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 155. [2018-11-23 11:38:01,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:01,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 155 states. [2018-11-23 11:38:01,124 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 155 states. [2018-11-23 11:38:01,124 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 155 states. [2018-11-23 11:38:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:01,128 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2018-11-23 11:38:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-11-23 11:38:01,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:01,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:01,128 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 188 states. [2018-11-23 11:38:01,128 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 188 states. [2018-11-23 11:38:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:01,132 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2018-11-23 11:38:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-11-23 11:38:01,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:01,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:01,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:01,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 11:38:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2018-11-23 11:38:01,135 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 26 [2018-11-23 11:38:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:01,135 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2018-11-23 11:38:01,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:38:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2018-11-23 11:38:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:01,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:01,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:01,136 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:01,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1221230889, now seen corresponding path program 1 times [2018-11-23 11:38:01,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:01,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 39 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 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:01,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:01,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:01,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {28184#true} call ULTIMATE.init(); {28184#true} is VALID [2018-11-23 11:38:01,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {28184#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {28184#true} is VALID [2018-11-23 11:38:01,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {28184#true} assume true; {28184#true} is VALID [2018-11-23 11:38:01,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28184#true} {28184#true} #388#return; {28184#true} is VALID [2018-11-23 11:38:01,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {28184#true} call #t~ret15 := main(); {28184#true} is VALID [2018-11-23 11:38:01,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {28184#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {28184#true} is VALID [2018-11-23 11:38:01,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {28184#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28259#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {28259#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {28259#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:01,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {28259#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {28266#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:01,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {28266#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {28185#false} is VALID [2018-11-23 11:38:01,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {28185#false} assume !false; {28185#false} is VALID [2018-11-23 11:38:01,399 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:38:01,399 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:01,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:01,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:01,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:38:01,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:01,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:01,437 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:38:01,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:01,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:01,438 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand 8 states. [2018-11-23 11:38:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:03,950 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-23 11:38:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:03,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:38:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2018-11-23 11:38:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2018-11-23 11:38:03,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 212 transitions. [2018-11-23 11:38:04,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:04,196 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:38:04,196 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 11:38:04,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 11:38:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-11-23 11:38:04,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:04,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 157 states. [2018-11-23 11:38:04,268 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 157 states. [2018-11-23 11:38:04,268 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 157 states. [2018-11-23 11:38:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:04,272 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-23 11:38:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2018-11-23 11:38:04,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:04,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:04,272 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 196 states. [2018-11-23 11:38:04,272 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 196 states. [2018-11-23 11:38:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:04,275 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-23 11:38:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2018-11-23 11:38:04,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:04,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:04,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:04,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 11:38:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-11-23 11:38:04,277 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 27 [2018-11-23 11:38:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:04,278 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-11-23 11:38:04,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-11-23 11:38:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:04,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:04,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:04,279 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:04,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1807131842, now seen corresponding path program 1 times [2018-11-23 11:38:04,279 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 40 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 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:04,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:04,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {29057#true} call ULTIMATE.init(); {29057#true} is VALID [2018-11-23 11:38:04,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {29057#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {29057#true} is VALID [2018-11-23 11:38:04,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {29057#true} assume true; {29057#true} is VALID [2018-11-23 11:38:04,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29057#true} {29057#true} #388#return; {29057#true} is VALID [2018-11-23 11:38:04,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {29057#true} call #t~ret15 := main(); {29057#true} is VALID [2018-11-23 11:38:04,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {29057#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29057#true} is VALID [2018-11-23 11:38:04,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {29057#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {29132#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {29132#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {29132#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {29132#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29139#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:04,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {29139#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29058#false} is VALID [2018-11-23 11:38:04,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {29058#false} assume !false; {29058#false} is VALID [2018-11-23 11:38:04,492 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:38:04,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:04,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:38:04,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:04,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:04,528 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:38:04,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:04,529 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 8 states. [2018-11-23 11:38:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,043 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-23 11:38:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:07,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:38:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-11-23 11:38:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-11-23 11:38:07,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 210 transitions. [2018-11-23 11:38:07,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:07,315 INFO L225 Difference]: With dead ends: 196 [2018-11-23 11:38:07,315 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:38:07,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:38:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 161. [2018-11-23 11:38:07,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:07,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 161 states. [2018-11-23 11:38:07,495 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 161 states. [2018-11-23 11:38:07,495 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 161 states. [2018-11-23 11:38:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,498 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-23 11:38:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-11-23 11:38:07,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,499 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 194 states. [2018-11-23 11:38:07,499 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 194 states. [2018-11-23 11:38:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,502 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-23 11:38:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-11-23 11:38:07,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:07,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 11:38:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-11-23 11:38:07,507 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 27 [2018-11-23 11:38:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-11-23 11:38:07,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-11-23 11:38:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:07,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:07,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:07,508 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:07,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash 211380849, now seen corresponding path program 1 times [2018-11-23 11:38:07,509 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:07,509 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 41 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 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:07,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:08,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {29929#true} call ULTIMATE.init(); {29929#true} is VALID [2018-11-23 11:38:08,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {29929#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {29929#true} is VALID [2018-11-23 11:38:08,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {29929#true} assume true; {29929#true} is VALID [2018-11-23 11:38:08,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29929#true} {29929#true} #388#return; {29929#true} is VALID [2018-11-23 11:38:08,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {29929#true} call #t~ret15 := main(); {29929#true} is VALID [2018-11-23 11:38:08,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {29929#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29929#true} is VALID [2018-11-23 11:38:08,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {29929#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {29962#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-23 11:38:08,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {29962#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:08,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:08,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:08,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:08,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29979#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:08,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {29979#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:08,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:08,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {29990#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~21 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~21 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-23 11:38:08,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {29990#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~21 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~21 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:08,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {30014#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:08,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {30014#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {29930#false} is VALID [2018-11-23 11:38:08,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {29930#false} assume !false; {29930#false} is VALID [2018-11-23 11:38:08,045 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:38:08,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:08,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:08,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:38:08,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 11:38:08,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:08,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:38:08,087 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:38:08,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:38:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:38:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:08,088 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 11 states. [2018-11-23 11:38:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:11,782 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2018-11-23 11:38:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:11,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 11:38:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-23 11:38:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-23 11:38:11,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 187 transitions. [2018-11-23 11:38:11,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:12,001 INFO L225 Difference]: With dead ends: 204 [2018-11-23 11:38:12,001 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 11:38:12,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 11:38:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 166. [2018-11-23 11:38:12,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:12,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 166 states. [2018-11-23 11:38:12,038 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 166 states. [2018-11-23 11:38:12,039 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 166 states. [2018-11-23 11:38:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:12,041 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-11-23 11:38:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2018-11-23 11:38:12,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:12,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:12,042 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 202 states. [2018-11-23 11:38:12,042 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 202 states. [2018-11-23 11:38:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:12,045 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-11-23 11:38:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2018-11-23 11:38:12,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:12,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:12,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:12,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:38:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2018-11-23 11:38:12,047 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 27 [2018-11-23 11:38:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:12,048 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2018-11-23 11:38:12,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:38:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2018-11-23 11:38:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:38:12,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:12,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:12,048 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:12,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 796551166, now seen corresponding path program 1 times [2018-11-23 11:38:12,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:12,049 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 42 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 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:12,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:12,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {30838#true} call ULTIMATE.init(); {30838#true} is VALID [2018-11-23 11:38:12,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {30838#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {30838#true} is VALID [2018-11-23 11:38:12,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {30838#true} assume true; {30838#true} is VALID [2018-11-23 11:38:12,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30838#true} {30838#true} #388#return; {30838#true} is VALID [2018-11-23 11:38:12,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {30838#true} call #t~ret15 := main(); {30838#true} is VALID [2018-11-23 11:38:12,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {30838#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {30838#true} is VALID [2018-11-23 11:38:12,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {30838#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30913#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:12,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {30913#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:12,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:12,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {30924#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:12,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {30924#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {30839#false} is VALID [2018-11-23 11:38:12,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {30839#false} assume !false; {30839#false} is VALID [2018-11-23 11:38:12,240 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:38:12,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:12,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:12,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:38:12,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:12,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:12,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:12,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:12,280 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand 9 states. [2018-11-23 11:38:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,072 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-11-23 11:38:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:15,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:38:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2018-11-23 11:38:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2018-11-23 11:38:15,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 208 transitions. [2018-11-23 11:38:15,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:15,309 INFO L225 Difference]: With dead ends: 199 [2018-11-23 11:38:15,309 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:38:15,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:38:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-11-23 11:38:15,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:15,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2018-11-23 11:38:15,374 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2018-11-23 11:38:15,374 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2018-11-23 11:38:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,377 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-23 11:38:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-11-23 11:38:15,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:15,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:15,378 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2018-11-23 11:38:15,378 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2018-11-23 11:38:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,381 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-23 11:38:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-11-23 11:38:15,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:15,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:15,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:15,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:38:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2018-11-23 11:38:15,383 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 28 [2018-11-23 11:38:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:15,384 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2018-11-23 11:38:15,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2018-11-23 11:38:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:38:15,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:15,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:15,385 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:15,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash -186509162, now seen corresponding path program 1 times [2018-11-23 11:38:15,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 43 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 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:15,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:15,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 11:38:15,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {31721#true} is VALID [2018-11-23 11:38:15,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 11:38:15,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #388#return; {31721#true} is VALID [2018-11-23 11:38:15,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret15 := main(); {31721#true} is VALID [2018-11-23 11:38:15,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31721#true} is VALID [2018-11-23 11:38:15,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {31721#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {31796#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {31796#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {31796#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {31796#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {31803#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:15,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {31803#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {31807#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:15,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {31807#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {31722#false} is VALID [2018-11-23 11:38:15,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 11:38:15,578 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:38:15,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:15,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:15,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:38:15,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:15,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:15,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:15,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:15,618 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand 9 states. [2018-11-23 11:38:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,158 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-23 11:38:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:18,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:38:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2018-11-23 11:38:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2018-11-23 11:38:18,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 203 transitions. [2018-11-23 11:38:18,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:18,387 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:38:18,387 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 11:38:18,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 11:38:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-23 11:38:18,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:18,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 163 states. [2018-11-23 11:38:18,429 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 163 states. [2018-11-23 11:38:18,429 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 163 states. [2018-11-23 11:38:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,433 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-23 11:38:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-11-23 11:38:18,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,433 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 190 states. [2018-11-23 11:38:18,433 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 190 states. [2018-11-23 11:38:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,436 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-23 11:38:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-11-23 11:38:18,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:18,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:38:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2018-11-23 11:38:18,439 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 28 [2018-11-23 11:38:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:18,439 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2018-11-23 11:38:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2018-11-23 11:38:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:38:18,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:18,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:18,440 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:18,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 945669773, now seen corresponding path program 1 times [2018-11-23 11:38:18,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 44 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 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:18,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:18,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {32589#true} call ULTIMATE.init(); {32589#true} is VALID [2018-11-23 11:38:18,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {32589#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {32589#true} is VALID [2018-11-23 11:38:18,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {32589#true} assume true; {32589#true} is VALID [2018-11-23 11:38:18,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32589#true} {32589#true} #388#return; {32589#true} is VALID [2018-11-23 11:38:18,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {32589#true} call #t~ret15 := main(); {32589#true} is VALID [2018-11-23 11:38:18,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {32589#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {32589#true} is VALID [2018-11-23 11:38:18,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {32589#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32670#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:18,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {32670#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {32674#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:18,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {32674#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {32590#false} is VALID [2018-11-23 11:38:18,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {32590#false} assume !false; {32590#false} is VALID [2018-11-23 11:38:18,923 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:38:18,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:18,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:18,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:38:18,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:18,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:18,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:18,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:18,979 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand 8 states. [2018-11-23 11:38:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,477 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-23 11:38:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:21,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:38:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2018-11-23 11:38:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2018-11-23 11:38:21,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 199 transitions. [2018-11-23 11:38:21,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:21,707 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:38:21,707 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 11:38:21,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 11:38:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2018-11-23 11:38:21,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:21,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 166 states. [2018-11-23 11:38:21,775 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 166 states. [2018-11-23 11:38:21,775 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 166 states. [2018-11-23 11:38:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,779 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-11-23 11:38:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-23 11:38:21,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:21,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:21,780 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 188 states. [2018-11-23 11:38:21,780 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 188 states. [2018-11-23 11:38:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,783 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-11-23 11:38:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-23 11:38:21,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:21,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:21,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:21,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:38:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 194 transitions. [2018-11-23 11:38:21,786 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 194 transitions. Word has length 28 [2018-11-23 11:38:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 194 transitions. [2018-11-23 11:38:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 194 transitions. [2018-11-23 11:38:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:21,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:21,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:21,787 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:21,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1473548689, now seen corresponding path program 1 times [2018-11-23 11:38:21,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 45 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 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:21,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:21,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:21,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {33451#true} call ULTIMATE.init(); {33451#true} is VALID [2018-11-23 11:38:21,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {33451#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {33451#true} is VALID [2018-11-23 11:38:21,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {33451#true} assume true; {33451#true} is VALID [2018-11-23 11:38:21,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33451#true} {33451#true} #388#return; {33451#true} is VALID [2018-11-23 11:38:21,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {33451#true} call #t~ret15 := main(); {33451#true} is VALID [2018-11-23 11:38:21,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {33451#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33451#true} is VALID [2018-11-23 11:38:21,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {33451#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {33539#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:21,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {33539#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {33452#false} is VALID [2018-11-23 11:38:21,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {33452#false} assume !false; {33452#false} is VALID [2018-11-23 11:38:21,985 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:38:21,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:21,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:21,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:21,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:21,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:22,024 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:38:22,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:22,025 INFO L87 Difference]: Start difference. First operand 166 states and 194 transitions. Second operand 8 states. [2018-11-23 11:38:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:24,912 INFO L93 Difference]: Finished difference Result 247 states and 281 transitions. [2018-11-23 11:38:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:24,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2018-11-23 11:38:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2018-11-23 11:38:24,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 259 transitions. [2018-11-23 11:38:25,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:25,234 INFO L225 Difference]: With dead ends: 247 [2018-11-23 11:38:25,234 INFO L226 Difference]: Without dead ends: 245 [2018-11-23 11:38:25,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-23 11:38:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 169. [2018-11-23 11:38:25,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:25,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand 169 states. [2018-11-23 11:38:25,299 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 169 states. [2018-11-23 11:38:25,299 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 169 states. [2018-11-23 11:38:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:25,304 INFO L93 Difference]: Finished difference Result 245 states and 279 transitions. [2018-11-23 11:38:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-11-23 11:38:25,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:25,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:25,304 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 245 states. [2018-11-23 11:38:25,304 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 245 states. [2018-11-23 11:38:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:25,308 INFO L93 Difference]: Finished difference Result 245 states and 279 transitions. [2018-11-23 11:38:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-11-23 11:38:25,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:25,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:25,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:25,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-23 11:38:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2018-11-23 11:38:25,311 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 29 [2018-11-23 11:38:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:25,311 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2018-11-23 11:38:25,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2018-11-23 11:38:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:25,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:25,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:25,312 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:25,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1472009489, now seen corresponding path program 1 times [2018-11-23 11:38:25,312 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 46 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 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:25,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:25,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:25,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {34504#true} call ULTIMATE.init(); {34504#true} is VALID [2018-11-23 11:38:25,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {34504#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {34504#true} is VALID [2018-11-23 11:38:25,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {34504#true} assume true; {34504#true} is VALID [2018-11-23 11:38:25,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34504#true} {34504#true} #388#return; {34504#true} is VALID [2018-11-23 11:38:25,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {34504#true} call #t~ret15 := main(); {34504#true} is VALID [2018-11-23 11:38:25,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {34504#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34504#true} is VALID [2018-11-23 11:38:25,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {34504#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:25,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {34592#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:25,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {34592#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {34505#false} is VALID [2018-11-23 11:38:25,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {34505#false} assume !false; {34505#false} is VALID [2018-11-23 11:38:25,499 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:38:25,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:25,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:25,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:25,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:25,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:25,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:25,538 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:38:25,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:25,539 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand 8 states. [2018-11-23 11:38:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,022 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2018-11-23 11:38:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:28,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2018-11-23 11:38:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2018-11-23 11:38:28,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 195 transitions. [2018-11-23 11:38:28,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:28,248 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:38:28,248 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 11:38:28,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 11:38:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2018-11-23 11:38:28,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:28,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 170 states. [2018-11-23 11:38:28,294 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 170 states. [2018-11-23 11:38:28,294 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 170 states. [2018-11-23 11:38:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,297 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2018-11-23 11:38:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2018-11-23 11:38:28,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:28,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:28,298 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 183 states. [2018-11-23 11:38:28,298 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 183 states. [2018-11-23 11:38:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,300 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2018-11-23 11:38:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2018-11-23 11:38:28,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:28,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:28,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:28,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 11:38:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2018-11-23 11:38:28,303 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 29 [2018-11-23 11:38:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:28,303 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2018-11-23 11:38:28,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2018-11-23 11:38:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:28,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:28,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:28,304 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:28,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash -748577978, now seen corresponding path program 1 times [2018-11-23 11:38:28,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 47 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 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:28,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:28,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:28,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {35359#true} call ULTIMATE.init(); {35359#true} is VALID [2018-11-23 11:38:28,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {35359#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {35359#true} is VALID [2018-11-23 11:38:28,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {35359#true} assume true; {35359#true} is VALID [2018-11-23 11:38:28,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35359#true} {35359#true} #388#return; {35359#true} is VALID [2018-11-23 11:38:28,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {35359#true} call #t~ret15 := main(); {35359#true} is VALID [2018-11-23 11:38:28,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {35359#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35359#true} is VALID [2018-11-23 11:38:28,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {35359#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35440#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {35440#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35440#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:28,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {35440#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {35447#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:28,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {35447#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {35360#false} is VALID [2018-11-23 11:38:28,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {35360#false} assume !false; {35360#false} is VALID [2018-11-23 11:38:28,491 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:38:28,491 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:38:28,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:28,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:28,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:28,532 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:38:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:28,532 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand 8 states. [2018-11-23 11:38:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:31,660 INFO L93 Difference]: Finished difference Result 226 states and 258 transitions. [2018-11-23 11:38:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:31,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:38:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2018-11-23 11:38:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2018-11-23 11:38:31,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 256 transitions. [2018-11-23 11:38:31,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:31,957 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:38:31,957 INFO L226 Difference]: Without dead ends: 224 [2018-11-23 11:38:31,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-23 11:38:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2018-11-23 11:38:32,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:32,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand 172 states. [2018-11-23 11:38:32,054 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 172 states. [2018-11-23 11:38:32,054 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 172 states. [2018-11-23 11:38:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:32,059 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2018-11-23 11:38:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2018-11-23 11:38:32,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:32,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:32,060 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 224 states. [2018-11-23 11:38:32,060 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 224 states. [2018-11-23 11:38:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:32,064 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2018-11-23 11:38:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2018-11-23 11:38:32,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:32,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:32,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:32,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 11:38:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2018-11-23 11:38:32,067 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 29 [2018-11-23 11:38:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:32,067 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2018-11-23 11:38:32,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2018-11-23 11:38:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:32,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:32,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:32,068 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:32,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:32,068 INFO L82 PathProgramCache]: Analyzing trace with hash -749004982, now seen corresponding path program 1 times [2018-11-23 11:38:32,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:32,068 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 48 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 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:32,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:32,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:32,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {36350#true} call ULTIMATE.init(); {36350#true} is VALID [2018-11-23 11:38:32,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {36350#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {36350#true} is VALID [2018-11-23 11:38:32,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {36350#true} assume true; {36350#true} is VALID [2018-11-23 11:38:32,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36350#true} {36350#true} #388#return; {36350#true} is VALID [2018-11-23 11:38:32,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {36350#true} call #t~ret15 := main(); {36350#true} is VALID [2018-11-23 11:38:32,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {36350#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {36350#true} is VALID [2018-11-23 11:38:32,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {36350#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36431#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {36431#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {36435#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:32,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {36435#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {36439#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:32,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {36439#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {36351#false} is VALID [2018-11-23 11:38:32,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {36351#false} assume !false; {36351#false} is VALID [2018-11-23 11:38:32,273 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:38:32,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:32,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:32,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:38:32,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:32,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:32,311 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:38:32,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:32,312 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 9 states. [2018-11-23 11:38:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:35,275 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-11-23 11:38:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:35,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:38:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2018-11-23 11:38:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2018-11-23 11:38:35,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2018-11-23 11:38:35,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:35,544 INFO L225 Difference]: With dead ends: 181 [2018-11-23 11:38:35,544 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 11:38:35,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 11:38:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-11-23 11:38:35,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:35,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 171 states. [2018-11-23 11:38:35,595 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 171 states. [2018-11-23 11:38:35,595 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 171 states. [2018-11-23 11:38:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:35,598 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-23 11:38:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-11-23 11:38:35,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:35,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:35,599 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 177 states. [2018-11-23 11:38:35,599 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 177 states. [2018-11-23 11:38:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:35,601 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-23 11:38:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-11-23 11:38:35,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:35,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:35,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:35,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:38:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2018-11-23 11:38:35,604 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 29 [2018-11-23 11:38:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:35,604 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2018-11-23 11:38:35,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2018-11-23 11:38:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:35,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:35,605 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:35,605 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:35,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -791316104, now seen corresponding path program 1 times [2018-11-23 11:38:35,606 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 49 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 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:35,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:35,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:35,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {37191#true} call ULTIMATE.init(); {37191#true} is VALID [2018-11-23 11:38:35,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {37191#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {37191#true} is VALID [2018-11-23 11:38:35,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {37191#true} assume true; {37191#true} is VALID [2018-11-23 11:38:35,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37191#true} {37191#true} #388#return; {37191#true} is VALID [2018-11-23 11:38:35,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {37191#true} call #t~ret15 := main(); {37191#true} is VALID [2018-11-23 11:38:35,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {37191#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37191#true} is VALID [2018-11-23 11:38:35,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {37191#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:35,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:35,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:35,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {37224#(and (= (_ bv0 32) main_~main__t~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-23 11:38:35,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {37224#(and (= (_ bv0 32) main_~main__t~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:35,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37247#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:35,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {37247#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:35,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:36,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37258#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:38:36,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {37258#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37282#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:36,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {37282#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {37192#false} is VALID [2018-11-23 11:38:36,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {37192#false} assume !false; {37192#false} is VALID [2018-11-23 11:38:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:36,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:36,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {37192#false} assume !false; {37192#false} is VALID [2018-11-23 11:38:36,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {37292#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {37192#false} is VALID [2018-11-23 11:38:36,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37292#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-23 11:38:36,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {37315#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:36,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37315#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-23 11:38:36,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {37191#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37191#true} is VALID [2018-11-23 11:38:36,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {37191#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {37191#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {37191#true} call #t~ret15 := main(); {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37191#true} {37191#true} #388#return; {37191#true} is VALID [2018-11-23 11:38:36,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {37191#true} assume true; {37191#true} is VALID [2018-11-23 11:38:36,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {37191#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {37191#true} is VALID [2018-11-23 11:38:36,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {37191#true} call ULTIMATE.init(); {37191#true} is VALID [2018-11-23 11:38:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:36,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:36,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-23 11:38:36,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 11:38:36,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:36,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:38:36,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:36,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:38:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:38:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:38:36,317 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand 15 states. [2018-11-23 11:38:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,623 INFO L93 Difference]: Finished difference Result 214 states and 247 transitions. [2018-11-23 11:38:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:38:43,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 11:38:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 224 transitions. [2018-11-23 11:38:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 224 transitions. [2018-11-23 11:38:43,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 224 transitions. [2018-11-23 11:38:44,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:44,166 INFO L225 Difference]: With dead ends: 214 [2018-11-23 11:38:44,166 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 11:38:44,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:38:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 11:38:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 154. [2018-11-23 11:38:44,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:44,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 154 states. [2018-11-23 11:38:44,230 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 154 states. [2018-11-23 11:38:44,230 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 154 states. [2018-11-23 11:38:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,233 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2018-11-23 11:38:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2018-11-23 11:38:44,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,234 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 212 states. [2018-11-23 11:38:44,234 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 212 states. [2018-11-23 11:38:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,237 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2018-11-23 11:38:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2018-11-23 11:38:44,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:44,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 11:38:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-11-23 11:38:44,239 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 29 [2018-11-23 11:38:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:44,239 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-11-23 11:38:44,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:38:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-11-23 11:38:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:38:44,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:44,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:44,240 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:44,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -280110353, now seen corresponding path program 1 times [2018-11-23 11:38:44,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 50 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 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:44,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {38253#true} call ULTIMATE.init(); {38253#true} is VALID [2018-11-23 11:38:44,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {38253#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {38253#true} is VALID [2018-11-23 11:38:44,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {38253#true} assume true; {38253#true} is VALID [2018-11-23 11:38:44,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38253#true} {38253#true} #388#return; {38253#true} is VALID [2018-11-23 11:38:44,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {38253#true} call #t~ret15 := main(); {38253#true} is VALID [2018-11-23 11:38:44,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {38253#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {38253#true} is VALID [2018-11-23 11:38:44,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {38253#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {38341#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {38341#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {38341#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:44,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {38341#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {38348#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:44,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {38348#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {38254#false} is VALID [2018-11-23 11:38:44,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {38254#false} assume !false; {38254#false} is VALID [2018-11-23 11:38:44,610 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:38:44,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:44,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:44,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:44,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:38:44,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:44,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:44,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:44,655 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 9 states. [2018-11-23 11:38:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:47,747 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-23 11:38:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:47,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:38:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2018-11-23 11:38:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2018-11-23 11:38:47,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 218 transitions. [2018-11-23 11:38:47,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:48,000 INFO L225 Difference]: With dead ends: 193 [2018-11-23 11:38:48,000 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 11:38:48,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 11:38:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2018-11-23 11:38:48,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:48,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 158 states. [2018-11-23 11:38:48,085 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 158 states. [2018-11-23 11:38:48,085 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 158 states. [2018-11-23 11:38:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,087 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-23 11:38:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-11-23 11:38:48,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,088 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 191 states. [2018-11-23 11:38:48,088 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 191 states. [2018-11-23 11:38:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,091 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-23 11:38:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-11-23 11:38:48,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:48,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 11:38:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-11-23 11:38:48,094 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 31 [2018-11-23 11:38:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:48,094 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-11-23 11:38:48,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-11-23 11:38:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:38:48,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:48,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:48,095 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 306565166, now seen corresponding path program 1 times [2018-11-23 11:38:48,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 51 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 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:48,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:48,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {39125#true} call ULTIMATE.init(); {39125#true} is VALID [2018-11-23 11:38:48,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {39125#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {39125#true} is VALID [2018-11-23 11:38:48,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {39125#true} assume true; {39125#true} is VALID [2018-11-23 11:38:48,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39125#true} {39125#true} #388#return; {39125#true} is VALID [2018-11-23 11:38:48,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {39125#true} call #t~ret15 := main(); {39125#true} is VALID [2018-11-23 11:38:48,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {39125#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39125#true} is VALID [2018-11-23 11:38:48,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {39125#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39213#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {39213#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {39213#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {39213#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {39220#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:48,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {39220#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {39126#false} is VALID [2018-11-23 11:38:48,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {39126#false} assume !false; {39126#false} is VALID [2018-11-23 11:38:48,307 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:38:48,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:48,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:48,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:48,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:38:48,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:48,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:48,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:48,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:48,354 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 9 states. [2018-11-23 11:38:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,520 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-23 11:38:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:51,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:38:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2018-11-23 11:38:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2018-11-23 11:38:51,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 216 transitions. [2018-11-23 11:38:51,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:51,777 INFO L225 Difference]: With dead ends: 191 [2018-11-23 11:38:51,777 INFO L226 Difference]: Without dead ends: 189 [2018-11-23 11:38:51,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-23 11:38:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2018-11-23 11:38:51,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:51,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 160 states. [2018-11-23 11:38:51,824 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 160 states. [2018-11-23 11:38:51,824 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 160 states. [2018-11-23 11:38:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,828 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-23 11:38:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-11-23 11:38:51,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,829 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 189 states. [2018-11-23 11:38:51,829 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 189 states. [2018-11-23 11:38:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,831 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-23 11:38:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-11-23 11:38:51,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:51,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 11:38:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2018-11-23 11:38:51,834 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 31 [2018-11-23 11:38:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:51,834 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2018-11-23 11:38:51,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2018-11-23 11:38:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:38:51,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:51,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:51,835 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:51,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -93483259, now seen corresponding path program 1 times [2018-11-23 11:38:51,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:51,835 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 52 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 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:52,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {39994#true} call ULTIMATE.init(); {39994#true} is VALID [2018-11-23 11:38:52,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {39994#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {39994#true} is VALID [2018-11-23 11:38:52,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {39994#true} assume true; {39994#true} is VALID [2018-11-23 11:38:52,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39994#true} {39994#true} #388#return; {39994#true} is VALID [2018-11-23 11:38:52,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {39994#true} call #t~ret15 := main(); {39994#true} is VALID [2018-11-23 11:38:52,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {39994#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39994#true} is VALID [2018-11-23 11:38:52,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {39994#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {40082#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {40082#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {40082#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,055 INFO L273 TraceCheckUtils]: 28: Hoare triple {40082#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {40089#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:52,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {40089#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {40093#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:52,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {40093#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {39995#false} is VALID [2018-11-23 11:38:52,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {39995#false} assume !false; {39995#false} is VALID [2018-11-23 11:38:52,058 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:38:52,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:52,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:52,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:38:52,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:38:52,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:52,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:38:52,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:52,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:38:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:38:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:52,100 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand 10 states. [2018-11-23 11:38:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,298 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-23 11:38:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:38:55,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:38:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2018-11-23 11:38:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2018-11-23 11:38:55,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 214 transitions. [2018-11-23 11:38:55,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:55,547 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:38:55,547 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:38:55,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:38:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2018-11-23 11:38:55,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:55,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 159 states. [2018-11-23 11:38:55,624 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 159 states. [2018-11-23 11:38:55,624 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 159 states. [2018-11-23 11:38:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,628 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-23 11:38:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-11-23 11:38:55,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:55,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:55,628 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 185 states. [2018-11-23 11:38:55,628 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 185 states. [2018-11-23 11:38:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,631 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-23 11:38:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-11-23 11:38:55,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:55,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:55,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:55,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:38:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-11-23 11:38:55,633 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 32 [2018-11-23 11:38:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:55,634 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-11-23 11:38:55,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:38:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-11-23 11:38:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:38:55,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:55,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:55,634 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:55,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 913588615, now seen corresponding path program 1 times [2018-11-23 11:38:55,635 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:55,635 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 53 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 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:55,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:55,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {40856#true} call ULTIMATE.init(); {40856#true} is VALID [2018-11-23 11:38:55,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {40856#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {40856#true} is VALID [2018-11-23 11:38:55,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {40856#true} assume true; {40856#true} is VALID [2018-11-23 11:38:55,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40856#true} {40856#true} #388#return; {40856#true} is VALID [2018-11-23 11:38:55,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {40856#true} call #t~ret15 := main(); {40856#true} is VALID [2018-11-23 11:38:55,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {40856#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {40856#true} is VALID [2018-11-23 11:38:55,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {40856#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40944#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:55,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {40944#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:55,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:55,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {40955#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:55,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {40955#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {40857#false} is VALID [2018-11-23 11:38:55,856 INFO L273 TraceCheckUtils]: 31: Hoare triple {40857#false} assume !false; {40857#false} is VALID [2018-11-23 11:38:55,858 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:38:55,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:55,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:38:55,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:38:55,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:55,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:38:55,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:38:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:38:55,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:55,903 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 10 states. [2018-11-23 11:38:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:59,051 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-23 11:38:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:38:59,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:38:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2018-11-23 11:38:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2018-11-23 11:38:59,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 210 transitions. [2018-11-23 11:38:59,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:59,298 INFO L225 Difference]: With dead ends: 185 [2018-11-23 11:38:59,298 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 11:38:59,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 11:38:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2018-11-23 11:38:59,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:59,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 157 states. [2018-11-23 11:38:59,497 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 157 states. [2018-11-23 11:38:59,497 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 157 states. [2018-11-23 11:38:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:59,500 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-23 11:38:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-11-23 11:38:59,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:59,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:59,501 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 180 states. [2018-11-23 11:38:59,501 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 180 states. [2018-11-23 11:38:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:59,503 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-23 11:38:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-11-23 11:38:59,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:59,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:59,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:59,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 11:38:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-11-23 11:38:59,506 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 32 [2018-11-23 11:38:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:59,506 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-11-23 11:38:59,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:38:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-11-23 11:38:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:38:59,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:59,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:59,507 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:59,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:59,508 INFO L82 PathProgramCache]: Analyzing trace with hash 374825852, now seen corresponding path program 1 times [2018-11-23 11:38:59,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:59,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 54 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 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:59,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:59,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:59,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {41701#true} call ULTIMATE.init(); {41701#true} is VALID [2018-11-23 11:38:59,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {41701#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {41701#true} is VALID [2018-11-23 11:38:59,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {41701#true} assume true; {41701#true} is VALID [2018-11-23 11:38:59,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41701#true} {41701#true} #388#return; {41701#true} is VALID [2018-11-23 11:38:59,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {41701#true} call #t~ret15 := main(); {41701#true} is VALID [2018-11-23 11:38:59,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {41701#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {41701#true} is VALID [2018-11-23 11:38:59,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {41701#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:59,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {41795#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {41799#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:59,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {41799#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {41702#false} is VALID [2018-11-23 11:38:59,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {41702#false} assume !false; {41702#false} is VALID [2018-11-23 11:38:59,810 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:38:59,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:59,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:59,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:59,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:38:59,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:59,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:59,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:59,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:59,873 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 9 states. [2018-11-23 11:39:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,960 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-23 11:39:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:39:02,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:39:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2018-11-23 11:39:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2018-11-23 11:39:02,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 205 transitions. [2018-11-23 11:39:03,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:03,207 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:39:03,207 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 11:39:03,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 11:39:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-11-23 11:39:03,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:03,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 160 states. [2018-11-23 11:39:03,263 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 160 states. [2018-11-23 11:39:03,263 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 160 states. [2018-11-23 11:39:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,266 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-11-23 11:39:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2018-11-23 11:39:03,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:03,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:03,266 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 178 states. [2018-11-23 11:39:03,266 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 178 states. [2018-11-23 11:39:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,268 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-11-23 11:39:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2018-11-23 11:39:03,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:03,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:03,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:03,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 11:39:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-11-23 11:39:03,271 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 32 [2018-11-23 11:39:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:03,271 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-11-23 11:39:03,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:39:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-11-23 11:39:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:39:03,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:03,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:03,272 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:03,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1410254304, now seen corresponding path program 1 times [2018-11-23 11:39:03,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 55 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 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:03,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:03,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {42538#true} call ULTIMATE.init(); {42538#true} is VALID [2018-11-23 11:39:03,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {42538#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {42538#true} is VALID [2018-11-23 11:39:03,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {42538#true} assume true; {42538#true} is VALID [2018-11-23 11:39:03,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42538#true} {42538#true} #388#return; {42538#true} is VALID [2018-11-23 11:39:03,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {42538#true} call #t~ret15 := main(); {42538#true} is VALID [2018-11-23 11:39:03,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {42538#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42538#true} is VALID [2018-11-23 11:39:03,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {42538#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {42639#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:03,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {42639#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {42539#false} is VALID [2018-11-23 11:39:03,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {42539#false} assume !false; {42539#false} is VALID [2018-11-23 11:39:03,485 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:39:03,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:03,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:39:03,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:03,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:03,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:39:03,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:03,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:39:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:39:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:39:03,526 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 9 states. [2018-11-23 11:39:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,251 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-11-23 11:39:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:39:07,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2018-11-23 11:39:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2018-11-23 11:39:07,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 269 transitions. [2018-11-23 11:39:07,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:07,594 INFO L225 Difference]: With dead ends: 236 [2018-11-23 11:39:07,594 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 11:39:07,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:39:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 11:39:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 163. [2018-11-23 11:39:07,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:07,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 163 states. [2018-11-23 11:39:07,641 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 163 states. [2018-11-23 11:39:07,641 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 163 states. [2018-11-23 11:39:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,645 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2018-11-23 11:39:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-11-23 11:39:07,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:07,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:07,646 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 234 states. [2018-11-23 11:39:07,646 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 234 states. [2018-11-23 11:39:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,649 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2018-11-23 11:39:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-11-23 11:39:07,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:07,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:07,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:07,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:39:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2018-11-23 11:39:07,652 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 33 [2018-11-23 11:39:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:07,652 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2018-11-23 11:39:07,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:39:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2018-11-23 11:39:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:39:07,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:07,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:07,653 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:07,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1411793504, now seen corresponding path program 1 times [2018-11-23 11:39:07,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:07,653 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 56 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 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:07,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:07,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:07,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {43566#true} call ULTIMATE.init(); {43566#true} is VALID [2018-11-23 11:39:07,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {43566#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {43566#true} is VALID [2018-11-23 11:39:07,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {43566#true} assume true; {43566#true} is VALID [2018-11-23 11:39:07,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43566#true} {43566#true} #388#return; {43566#true} is VALID [2018-11-23 11:39:07,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {43566#true} call #t~ret15 := main(); {43566#true} is VALID [2018-11-23 11:39:07,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {43566#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {43566#true} is VALID [2018-11-23 11:39:07,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {43566#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:07,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {43667#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:07,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {43667#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {43567#false} is VALID [2018-11-23 11:39:07,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {43567#false} assume !false; {43567#false} is VALID [2018-11-23 11:39:07,893 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:39:07,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:07,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:07,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:39:07,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:07,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:07,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:39:07,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:07,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:39:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:39:07,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:39:07,937 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 9 states. [2018-11-23 11:39:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:11,501 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2018-11-23 11:39:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:39:11,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-11-23 11:39:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-11-23 11:39:11,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 201 transitions. [2018-11-23 11:39:11,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:11,739 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:39:11,740 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:39:11,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:39:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2018-11-23 11:39:11,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:11,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 164 states. [2018-11-23 11:39:11,785 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 164 states. [2018-11-23 11:39:11,786 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 164 states. [2018-11-23 11:39:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:11,789 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-23 11:39:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-23 11:39:11,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:11,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:11,789 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 173 states. [2018-11-23 11:39:11,789 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 173 states. [2018-11-23 11:39:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:11,792 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-23 11:39:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-23 11:39:11,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:11,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:11,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:11,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:39:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2018-11-23 11:39:11,794 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 33 [2018-11-23 11:39:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:11,794 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2018-11-23 11:39:11,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:39:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2018-11-23 11:39:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:39:11,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:11,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:11,795 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:11,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1264870345, now seen corresponding path program 1 times [2018-11-23 11:39:11,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 57 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 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:11,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:11,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {44396#true} call ULTIMATE.init(); {44396#true} is VALID [2018-11-23 11:39:11,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {44396#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {44396#true} is VALID [2018-11-23 11:39:11,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {44396#true} assume true; {44396#true} is VALID [2018-11-23 11:39:11,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44396#true} {44396#true} #388#return; {44396#true} is VALID [2018-11-23 11:39:11,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {44396#true} call #t~ret15 := main(); {44396#true} is VALID [2018-11-23 11:39:11,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {44396#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {44396#true} is VALID [2018-11-23 11:39:11,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {44396#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:11,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44490#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {44490#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44490#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:12,006 INFO L273 TraceCheckUtils]: 30: Hoare triple {44490#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {44497#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:12,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {44497#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {44397#false} is VALID [2018-11-23 11:39:12,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {44397#false} assume !false; {44397#false} is VALID [2018-11-23 11:39:12,009 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:39:12,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:12,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:12,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:39:12,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:12,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:12,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:39:12,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:12,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:39:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:39:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:39:12,054 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 9 states. [2018-11-23 11:39:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:15,993 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2018-11-23 11:39:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:39:15,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:39:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 273 transitions. [2018-11-23 11:39:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:39:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 273 transitions. [2018-11-23 11:39:15,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 273 transitions. [2018-11-23 11:39:16,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:16,351 INFO L225 Difference]: With dead ends: 238 [2018-11-23 11:39:16,351 INFO L226 Difference]: Without dead ends: 236 [2018-11-23 11:39:16,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:39:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-23 11:39:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 166. [2018-11-23 11:39:16,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:16,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 166 states. [2018-11-23 11:39:16,410 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 166 states. [2018-11-23 11:39:16,410 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 166 states. [2018-11-23 11:39:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:16,415 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-11-23 11:39:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-11-23 11:39:16,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:16,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:16,416 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 236 states. [2018-11-23 11:39:16,416 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 236 states. [2018-11-23 11:39:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:16,419 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-11-23 11:39:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-11-23 11:39:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:16,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:16,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:16,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:39:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-11-23 11:39:16,422 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 33 [2018-11-23 11:39:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:16,422 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-11-23 11:39:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:39:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-11-23 11:39:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:39:16,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:16,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:16,423 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:16,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1265297349, now seen corresponding path program 1 times [2018-11-23 11:39:16,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:16,424 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 58 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 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:16,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:16,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:16,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {45435#true} call ULTIMATE.init(); {45435#true} is VALID [2018-11-23 11:39:16,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {45435#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {45435#true} is VALID [2018-11-23 11:39:16,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {45435#true} assume true; {45435#true} is VALID [2018-11-23 11:39:16,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45435#true} {45435#true} #388#return; {45435#true} is VALID [2018-11-23 11:39:16,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {45435#true} call #t~ret15 := main(); {45435#true} is VALID [2018-11-23 11:39:16,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {45435#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {45435#true} is VALID [2018-11-23 11:39:16,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {45435#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45529#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:16,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {45529#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {45533#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:39:16,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {45533#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {45537#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:16,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {45537#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {45436#false} is VALID [2018-11-23 11:39:16,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {45436#false} assume !false; {45436#false} is VALID [2018-11-23 11:39:16,696 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:39:16,696 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:16,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:39:16,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 11:39:16,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:16,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:39:16,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:16,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:39:16,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:39:16,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:16,739 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 10 states. [2018-11-23 11:39:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:19,883 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-11-23 11:39:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:39:19,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 11:39:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:39:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2018-11-23 11:39:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:39:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2018-11-23 11:39:19,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 196 transitions. [2018-11-23 11:39:20,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:20,159 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:39:20,160 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:39:20,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:39:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:39:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 11:39:20,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:20,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 11:39:20,639 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 11:39:20,639 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 11:39:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:20,642 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-23 11:39:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2018-11-23 11:39:20,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:20,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:20,643 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 11:39:20,643 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 11:39:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:20,645 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-23 11:39:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2018-11-23 11:39:20,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:20,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:20,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:20,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:39:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-11-23 11:39:20,648 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 33 [2018-11-23 11:39:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-11-23 11:39:20,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:39:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-11-23 11:39:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:39:20,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:20,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:20,649 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:20,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1825167237, now seen corresponding path program 1 times [2018-11-23 11:39:20,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 59 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 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:20,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:20,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {46251#true} call ULTIMATE.init(); {46251#true} is VALID [2018-11-23 11:39:20,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {46251#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {46251#true} is VALID [2018-11-23 11:39:20,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {46251#true} assume true; {46251#true} is VALID [2018-11-23 11:39:20,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46251#true} {46251#true} #388#return; {46251#true} is VALID [2018-11-23 11:39:20,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {46251#true} call #t~ret15 := main(); {46251#true} is VALID [2018-11-23 11:39:20,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {46251#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46251#true} is VALID [2018-11-23 11:39:20,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {46251#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46352#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {46352#(= (_ bv6 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {46352#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:20,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {46352#(= (_ bv6 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {46359#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:20,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {46359#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {46252#false} is VALID [2018-11-23 11:39:20,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {46252#false} assume !false; {46252#false} is VALID [2018-11-23 11:39:20,890 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:39:20,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:39:20,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 11:39:20,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:20,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:39:20,951 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:39:20,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:39:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:39:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:20,952 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand 10 states.