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/AutomizerC.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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:43:28,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:43:28,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:43:28,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:43:28,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:43:28,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:43:28,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:43:28,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:43:28,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:43:28,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:43:28,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:43:28,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:43:28,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:43:28,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:43:28,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:43:28,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:43:28,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:43:28,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:43:28,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:43:28,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:43:28,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:43:28,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:43:28,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:43:28,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:43:28,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:43:28,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:43:28,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:43:28,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:43:28,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:43:28,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:43:28,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:43:28,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:43:28,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:43:28,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:43:28,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:43:28,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:43:28,721 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-14 16:43:28,753 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:43:28,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:43:28,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:43:28,754 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:43:28,755 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:43:28,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:43:28,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:43:28,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:43:28,756 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:43:28,756 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:43:28,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:43:28,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:43:28,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:43:28,757 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:43:28,757 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:43:28,759 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:43:28,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:43:28,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:43:28,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:43:28,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:43:28,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:43:28,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:43:28,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:43:28,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:43:28,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:43:28,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:43:28,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:43:28,763 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:43:28,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:43:28,763 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:43:28,763 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:43:28,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:43:28,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:43:28,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:43:28,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:43:28,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:43:28,861 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:43:28,862 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+nlh-reducer.c [2018-11-14 16:43:28,934 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d98d1a4/6ccc17468fd54fa9a1e998fcdd96f5b8/FLAG53d70140c [2018-11-14 16:43:29,526 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:43:29,527 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2018-11-14 16:43:29,545 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d98d1a4/6ccc17468fd54fa9a1e998fcdd96f5b8/FLAG53d70140c [2018-11-14 16:43:29,565 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d98d1a4/6ccc17468fd54fa9a1e998fcdd96f5b8 [2018-11-14 16:43:29,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:43:29,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:43:29,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:29,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:43:29,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:43:29,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30414706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29, skipping insertion in model container [2018-11-14 16:43:29,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:43:29,703 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:43:30,449 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:30,458 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:43:30,732 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:30,752 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:43:30,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30 WrapperNode [2018-11-14 16:43:30,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:30,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:43:30,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:43:30,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:43:30,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:30,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:30,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:30,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:31,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:31,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:31,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (1/1) ... [2018-11-14 16:43:31,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:43:31,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:43:31,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:43:31,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:43:31,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (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-14 16:43:31,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:43:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:43:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:43:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:43:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:43:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:43:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:43:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:43:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:43:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:43:35,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:43:35,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:35 BoogieIcfgContainer [2018-11-14 16:43:35,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:43:35,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:43:35,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:43:35,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:43:35,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:43:29" (1/3) ... [2018-11-14 16:43:35,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c014547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:35, skipping insertion in model container [2018-11-14 16:43:35,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:30" (2/3) ... [2018-11-14 16:43:35,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c014547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:35, skipping insertion in model container [2018-11-14 16:43:35,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:35" (3/3) ... [2018-11-14 16:43:35,249 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2018-11-14 16:43:35,260 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:43:35,270 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 16:43:35,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 16:43:35,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:43:35,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:43:35,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:43:35,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:43:35,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:43:35,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:43:35,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:43:35,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:43:35,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:43:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2018-11-14 16:43:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:43:35,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:35,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:35,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:35,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2018-11-14 16:43:35,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:35,390 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-14 16:43:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:35,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:35,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2018-11-14 16:43:35,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {312#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {312#true} is VALID [2018-11-14 16:43:35,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2018-11-14 16:43:35,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {312#true} {312#true} #1227#return; {312#true} is VALID [2018-11-14 16:43:35,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {312#true} call #t~ret66 := main(); {312#true} is VALID [2018-11-14 16:43:35,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {312#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {312#true} is VALID [2018-11-14 16:43:35,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {335#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:35,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {335#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:35,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(= (_ 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; {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:35,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {313#false} is VALID [2018-11-14 16:43:35,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {313#false} assume !false; {313#false} is VALID [2018-11-14 16:43:35,746 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-14 16:43:35,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:35,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:35,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:35,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 16:43:35,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:35,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:35,882 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-14 16:43:35,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:35,894 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2018-11-14 16:43:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:40,032 INFO L93 Difference]: Finished difference Result 332 states and 596 transitions. [2018-11-14 16:43:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:43:40,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 16:43:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2018-11-14 16:43:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2018-11-14 16:43:40,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 596 transitions. [2018-11-14 16:43:41,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:41,084 INFO L225 Difference]: With dead ends: 332 [2018-11-14 16:43:41,084 INFO L226 Difference]: Without dead ends: 316 [2018-11-14 16:43:41,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-14 16:43:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2018-11-14 16:43:41,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:41,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand 306 states. [2018-11-14 16:43:41,219 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand 306 states. [2018-11-14 16:43:41,219 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 306 states. [2018-11-14 16:43:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:41,249 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2018-11-14 16:43:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 438 transitions. [2018-11-14 16:43:41,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:41,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:41,256 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 316 states. [2018-11-14 16:43:41,256 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 316 states. [2018-11-14 16:43:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:41,278 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2018-11-14 16:43:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 438 transitions. [2018-11-14 16:43:41,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:41,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:41,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:41,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-14 16:43:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 429 transitions. [2018-11-14 16:43:41,303 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 429 transitions. Word has length 11 [2018-11-14 16:43:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:41,303 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 429 transitions. [2018-11-14 16:43:41,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 429 transitions. [2018-11-14 16:43:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:43:41,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:41,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:41,305 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:41,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2018-11-14 16:43:41,306 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:41,306 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-14 16:43:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:41,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:41,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {1643#true} call ULTIMATE.init(); {1643#true} is VALID [2018-11-14 16:43:41,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {1643#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {1643#true} is VALID [2018-11-14 16:43:41,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {1643#true} assume true; {1643#true} is VALID [2018-11-14 16:43:41,453 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1643#true} {1643#true} #1227#return; {1643#true} is VALID [2018-11-14 16:43:41,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {1643#true} call #t~ret66 := main(); {1643#true} is VALID [2018-11-14 16:43:41,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {1643#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1643#true} is VALID [2018-11-14 16:43:41,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {1643#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1666#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:41,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {1666#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {1670#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:43:41,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {1670#(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; {1670#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:43:41,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {1670#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);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; {1677#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:41,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1677#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {1644#false} is VALID [2018-11-14 16:43:41,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {1644#false} assume !false; {1644#false} is VALID [2018-11-14 16:43:41,484 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-14 16:43:41,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:41,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:41,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:41,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:43:41,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:41,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:41,506 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-14 16:43:41,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:41,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:41,509 INFO L87 Difference]: Start difference. First operand 306 states and 429 transitions. Second operand 5 states. [2018-11-14 16:43:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:44,899 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2018-11-14 16:43:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:44,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:43:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2018-11-14 16:43:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2018-11-14 16:43:44,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2018-11-14 16:43:45,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:45,428 INFO L225 Difference]: With dead ends: 316 [2018-11-14 16:43:45,428 INFO L226 Difference]: Without dead ends: 311 [2018-11-14 16:43:45,430 INFO L604 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-14 16:43:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-14 16:43:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 304. [2018-11-14 16:43:45,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:45,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand 304 states. [2018-11-14 16:43:45,488 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand 304 states. [2018-11-14 16:43:45,488 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 304 states. [2018-11-14 16:43:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:45,504 INFO L93 Difference]: Finished difference Result 311 states and 433 transitions. [2018-11-14 16:43:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 433 transitions. [2018-11-14 16:43:45,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:45,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:45,515 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 311 states. [2018-11-14 16:43:45,515 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 311 states. [2018-11-14 16:43:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:45,529 INFO L93 Difference]: Finished difference Result 311 states and 433 transitions. [2018-11-14 16:43:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 433 transitions. [2018-11-14 16:43:45,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:45,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:45,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:45,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-14 16:43:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2018-11-14 16:43:45,544 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 12 [2018-11-14 16:43:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:45,544 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2018-11-14 16:43:45,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2018-11-14 16:43:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:43:45,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:45,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:45,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:45,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2018-11-14 16:43:45,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:45,546 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-14 16:43:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:45,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:45,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2018-11-14 16:43:45,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {2947#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {2947#true} is VALID [2018-11-14 16:43:45,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {2947#true} assume true; {2947#true} is VALID [2018-11-14 16:43:45,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2947#true} {2947#true} #1227#return; {2947#true} is VALID [2018-11-14 16:43:45,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {2947#true} call #t~ret66 := main(); {2947#true} is VALID [2018-11-14 16:43:45,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {2947#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2947#true} is VALID [2018-11-14 16:43:45,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {2947#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2970#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {2970#(= (_ 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; {2970#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {2970#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {2970#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {2970#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {2980#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:45,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {2980#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~2 == 0bv32; {2948#false} is VALID [2018-11-14 16:43:45,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2018-11-14 16:43:45,726 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-14 16:43:45,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:45,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:45,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:45,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:43:45,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:45,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:45,777 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-14 16:43:45,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:45,778 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand 4 states. [2018-11-14 16:43:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:48,425 INFO L93 Difference]: Finished difference Result 347 states and 471 transitions. [2018-11-14 16:43:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:48,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:43:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2018-11-14 16:43:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2018-11-14 16:43:48,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2018-11-14 16:43:49,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:49,225 INFO L225 Difference]: With dead ends: 347 [2018-11-14 16:43:49,225 INFO L226 Difference]: Without dead ends: 345 [2018-11-14 16:43:49,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-14 16:43:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-14 16:43:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 306. [2018-11-14 16:43:49,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:49,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand 306 states. [2018-11-14 16:43:49,402 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand 306 states. [2018-11-14 16:43:49,402 INFO L87 Difference]: Start difference. First operand 345 states. Second operand 306 states. [2018-11-14 16:43:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:49,416 INFO L93 Difference]: Finished difference Result 345 states and 469 transitions. [2018-11-14 16:43:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 469 transitions. [2018-11-14 16:43:49,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:49,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:49,418 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 345 states. [2018-11-14 16:43:49,418 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 345 states. [2018-11-14 16:43:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:49,433 INFO L93 Difference]: Finished difference Result 345 states and 469 transitions. [2018-11-14 16:43:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 469 transitions. [2018-11-14 16:43:49,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:49,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:49,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:49,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-14 16:43:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 428 transitions. [2018-11-14 16:43:49,446 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 428 transitions. Word has length 12 [2018-11-14 16:43:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:49,446 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 428 transitions. [2018-11-14 16:43:49,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 428 transitions. [2018-11-14 16:43:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:43:49,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:49,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:49,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:49,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2018-11-14 16:43:49,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:49,449 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-14 16:43:49,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:49,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:49,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {4353#true} call ULTIMATE.init(); {4353#true} is VALID [2018-11-14 16:43:49,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {4353#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {4353#true} is VALID [2018-11-14 16:43:49,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {4353#true} assume true; {4353#true} is VALID [2018-11-14 16:43:49,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4353#true} {4353#true} #1227#return; {4353#true} is VALID [2018-11-14 16:43:49,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {4353#true} call #t~ret66 := main(); {4353#true} is VALID [2018-11-14 16:43:49,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {4353#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4353#true} is VALID [2018-11-14 16:43:49,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {4353#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 16:43:49,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 16:43:49,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 16:43:49,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 16:43:49,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {4376#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {4389#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {4389#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~3 == 0bv32; {4354#false} is VALID [2018-11-14 16:43:49,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {4354#false} assume !false; {4354#false} is VALID [2018-11-14 16:43:49,707 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-14 16:43:49,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:49,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:49,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:49,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 16:43:49,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:49,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:49,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:49,735 INFO L87 Difference]: Start difference. First operand 306 states and 428 transitions. Second operand 4 states. [2018-11-14 16:43:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:53,317 INFO L93 Difference]: Finished difference Result 345 states and 469 transitions. [2018-11-14 16:43:53,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:53,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 16:43:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2018-11-14 16:43:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2018-11-14 16:43:53,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 469 transitions. [2018-11-14 16:43:53,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:53,909 INFO L225 Difference]: With dead ends: 345 [2018-11-14 16:43:53,909 INFO L226 Difference]: Without dead ends: 343 [2018-11-14 16:43:53,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-14 16:43:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-14 16:43:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 307. [2018-11-14 16:43:54,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:54,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 307 states. [2018-11-14 16:43:54,004 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 307 states. [2018-11-14 16:43:54,004 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 307 states. [2018-11-14 16:43:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:54,014 INFO L93 Difference]: Finished difference Result 343 states and 467 transitions. [2018-11-14 16:43:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-11-14 16:43:54,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:54,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:54,015 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 343 states. [2018-11-14 16:43:54,015 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 343 states. [2018-11-14 16:43:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:54,026 INFO L93 Difference]: Finished difference Result 343 states and 467 transitions. [2018-11-14 16:43:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-11-14 16:43:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:54,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:54,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-14 16:43:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 429 transitions. [2018-11-14 16:43:54,036 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 429 transitions. Word has length 13 [2018-11-14 16:43:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:54,037 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 429 transitions. [2018-11-14 16:43:54,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2018-11-14 16:43:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:43:54,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:54,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:54,038 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:54,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -582157959, now seen corresponding path program 1 times [2018-11-14 16:43:54,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:54,039 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-14 16:43:54,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:54,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:54,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {5757#true} call ULTIMATE.init(); {5757#true} is VALID [2018-11-14 16:43:54,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {5757#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {5757#true} is VALID [2018-11-14 16:43:54,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {5757#true} assume true; {5757#true} is VALID [2018-11-14 16:43:54,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5757#true} {5757#true} #1227#return; {5757#true} is VALID [2018-11-14 16:43:54,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {5757#true} call #t~ret66 := main(); {5757#true} is VALID [2018-11-14 16:43:54,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {5757#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5757#true} is VALID [2018-11-14 16:43:54,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {5757#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5780#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {5780#(= (_ 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; {5780#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {5780#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {5780#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {5780#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {5780#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {5780#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5793#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {5793#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {5793#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:54,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {5793#(= (_ 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; {5800#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:54,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {5800#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {5758#false} is VALID [2018-11-14 16:43:54,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {5758#false} assume !false; {5758#false} is VALID [2018-11-14 16:43:54,292 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-14 16:43:54,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:54,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:54,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:54,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:54,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:54,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:54,310 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-14 16:43:54,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:54,311 INFO L87 Difference]: Start difference. First operand 307 states and 429 transitions. Second operand 5 states. [2018-11-14 16:43:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:57,873 INFO L93 Difference]: Finished difference Result 350 states and 473 transitions. [2018-11-14 16:43:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:57,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2018-11-14 16:43:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2018-11-14 16:43:57,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2018-11-14 16:43:58,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:58,743 INFO L225 Difference]: With dead ends: 350 [2018-11-14 16:43:58,743 INFO L226 Difference]: Without dead ends: 348 [2018-11-14 16:43:58,744 INFO L604 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-14 16:43:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-14 16:43:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2018-11-14 16:43:58,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:58,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand 309 states. [2018-11-14 16:43:58,795 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand 309 states. [2018-11-14 16:43:58,795 INFO L87 Difference]: Start difference. First operand 348 states. Second operand 309 states. [2018-11-14 16:43:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:58,807 INFO L93 Difference]: Finished difference Result 348 states and 471 transitions. [2018-11-14 16:43:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 471 transitions. [2018-11-14 16:43:58,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:58,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:58,808 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand 348 states. [2018-11-14 16:43:58,808 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 348 states. [2018-11-14 16:43:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:58,819 INFO L93 Difference]: Finished difference Result 348 states and 471 transitions. [2018-11-14 16:43:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 471 transitions. [2018-11-14 16:43:58,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:58,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:58,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:58,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-14 16:43:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2018-11-14 16:43:58,829 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 15 [2018-11-14 16:43:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:58,829 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2018-11-14 16:43:58,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2018-11-14 16:43:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:43:58,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:58,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:58,831 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:58,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2018-11-14 16:43:58,831 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:58,831 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-14 16:43:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:58,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:59,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {7188#true} call ULTIMATE.init(); {7188#true} is VALID [2018-11-14 16:43:59,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {7188#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {7188#true} is VALID [2018-11-14 16:43:59,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {7188#true} assume true; {7188#true} is VALID [2018-11-14 16:43:59,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7188#true} {7188#true} #1227#return; {7188#true} is VALID [2018-11-14 16:43:59,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {7188#true} call #t~ret66 := main(); {7188#true} is VALID [2018-11-14 16:43:59,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {7188#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7188#true} is VALID [2018-11-14 16:43:59,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {7188#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7211#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {7211#(= (_ 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; {7211#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {7211#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {7211#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {7211#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {7211#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {7211#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {7211#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {7211#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7227#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {7227#(= (_ 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; {7231#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:59,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {7231#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {7189#false} is VALID [2018-11-14 16:43:59,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {7189#false} assume !false; {7189#false} is VALID [2018-11-14 16:43:59,529 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-14 16:43:59,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:59,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:59,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:59,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:59,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:59,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:59,549 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-14 16:43:59,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:59,550 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand 5 states. [2018-11-14 16:44:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,042 INFO L93 Difference]: Finished difference Result 348 states and 471 transitions. [2018-11-14 16:44:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:44:03,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:44:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2018-11-14 16:44:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2018-11-14 16:44:03,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2018-11-14 16:44:05,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:05,577 INFO L225 Difference]: With dead ends: 348 [2018-11-14 16:44:05,577 INFO L226 Difference]: Without dead ends: 346 [2018-11-14 16:44:05,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-14 16:44:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 311. [2018-11-14 16:44:05,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:05,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand 311 states. [2018-11-14 16:44:05,625 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand 311 states. [2018-11-14 16:44:05,625 INFO L87 Difference]: Start difference. First operand 346 states. Second operand 311 states. [2018-11-14 16:44:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,635 INFO L93 Difference]: Finished difference Result 346 states and 469 transitions. [2018-11-14 16:44:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 469 transitions. [2018-11-14 16:44:05,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:05,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:05,637 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand 346 states. [2018-11-14 16:44:05,637 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 346 states. [2018-11-14 16:44:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,647 INFO L93 Difference]: Finished difference Result 346 states and 469 transitions. [2018-11-14 16:44:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 469 transitions. [2018-11-14 16:44:05,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:05,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:05,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:05,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-14 16:44:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 434 transitions. [2018-11-14 16:44:05,657 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 434 transitions. Word has length 15 [2018-11-14 16:44:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:05,658 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 434 transitions. [2018-11-14 16:44:05,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 434 transitions. [2018-11-14 16:44:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:44:05,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:05,659 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:05,659 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:05,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash -867024484, now seen corresponding path program 1 times [2018-11-14 16:44:05,660 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:05,660 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-14 16:44:05,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:06,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {8616#true} call ULTIMATE.init(); {8616#true} is VALID [2018-11-14 16:44:06,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {8616#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {8616#true} is VALID [2018-11-14 16:44:06,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {8616#true} assume true; {8616#true} is VALID [2018-11-14 16:44:06,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8616#true} {8616#true} #1227#return; {8616#true} is VALID [2018-11-14 16:44:06,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {8616#true} call #t~ret66 := main(); {8616#true} is VALID [2018-11-14 16:44:06,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {8616#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8616#true} is VALID [2018-11-14 16:44:06,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {8616#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8639#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:06,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {8639#(= (_ 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; {8639#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:06,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {8639#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {8639#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:06,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {8639#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {8639#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:06,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {8639#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8652#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:06,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {8652#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {8656#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:06,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {8656#(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; {8656#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:06,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {8656#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);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; {8663#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:06,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {8663#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {8617#false} is VALID [2018-11-14 16:44:06,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {8617#false} assume !false; {8617#false} is VALID [2018-11-14 16:44:06,274 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-14 16:44:06,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:06,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:06,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:06,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:44:06,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:06,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:06,295 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-14 16:44:06,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:06,296 INFO L87 Difference]: Start difference. First operand 311 states and 434 transitions. Second operand 6 states. [2018-11-14 16:44:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:10,652 INFO L93 Difference]: Finished difference Result 346 states and 469 transitions. [2018-11-14 16:44:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:10,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:44:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2018-11-14 16:44:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2018-11-14 16:44:10,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 469 transitions. [2018-11-14 16:44:11,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:11,195 INFO L225 Difference]: With dead ends: 346 [2018-11-14 16:44:11,195 INFO L226 Difference]: Without dead ends: 341 [2018-11-14 16:44:11,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-14 16:44:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 309. [2018-11-14 16:44:11,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:11,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand 309 states. [2018-11-14 16:44:11,209 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand 309 states. [2018-11-14 16:44:11,209 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 309 states. [2018-11-14 16:44:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:11,218 INFO L93 Difference]: Finished difference Result 341 states and 464 transitions. [2018-11-14 16:44:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 464 transitions. [2018-11-14 16:44:11,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:11,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:11,220 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand 341 states. [2018-11-14 16:44:11,220 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 341 states. [2018-11-14 16:44:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:11,227 INFO L93 Difference]: Finished difference Result 341 states and 464 transitions. [2018-11-14 16:44:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 464 transitions. [2018-11-14 16:44:11,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:11,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:11,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:11,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-14 16:44:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2018-11-14 16:44:11,234 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 16 [2018-11-14 16:44:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:11,235 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2018-11-14 16:44:11,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2018-11-14 16:44:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:44:11,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:11,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:11,236 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:11,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash -861052382, now seen corresponding path program 1 times [2018-11-14 16:44:11,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:11,237 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-14 16:44:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:11,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:11,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {10033#true} call ULTIMATE.init(); {10033#true} is VALID [2018-11-14 16:44:11,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {10033#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {10033#true} is VALID [2018-11-14 16:44:11,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {10033#true} assume true; {10033#true} is VALID [2018-11-14 16:44:11,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10033#true} {10033#true} #1227#return; {10033#true} is VALID [2018-11-14 16:44:11,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {10033#true} call #t~ret66 := main(); {10033#true} is VALID [2018-11-14 16:44:11,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {10033#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10033#true} is VALID [2018-11-14 16:44:11,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {10033#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10056#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {10056#(= (_ 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; {10056#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {10056#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {10056#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {10056#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {10056#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {10056#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10069#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {10069#(= (_ 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; {10069#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {10069#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {10069#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:11,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {10069#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {10079#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:11,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {10079#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~2 == 0bv32; {10034#false} is VALID [2018-11-14 16:44:11,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {10034#false} assume !false; {10034#false} is VALID [2018-11-14 16:44:11,376 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-14 16:44:11,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:11,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:11,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:11,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 16:44:11,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:11,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:11,453 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-14 16:44:11,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:11,454 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand 5 states. [2018-11-14 16:44:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,747 INFO L93 Difference]: Finished difference Result 377 states and 502 transitions. [2018-11-14 16:44:14,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:14,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 16:44:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 502 transitions. [2018-11-14 16:44:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 502 transitions. [2018-11-14 16:44:14,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 502 transitions. [2018-11-14 16:44:15,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:15,337 INFO L225 Difference]: With dead ends: 377 [2018-11-14 16:44:15,337 INFO L226 Difference]: Without dead ends: 375 [2018-11-14 16:44:15,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-14 16:44:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-14 16:44:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 311. [2018-11-14 16:44:15,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:15,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand 311 states. [2018-11-14 16:44:15,379 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 311 states. [2018-11-14 16:44:15,379 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 311 states. [2018-11-14 16:44:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:15,388 INFO L93 Difference]: Finished difference Result 375 states and 500 transitions. [2018-11-14 16:44:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 500 transitions. [2018-11-14 16:44:15,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:15,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:15,390 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand 375 states. [2018-11-14 16:44:15,390 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 375 states. [2018-11-14 16:44:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:15,400 INFO L93 Difference]: Finished difference Result 375 states and 500 transitions. [2018-11-14 16:44:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 500 transitions. [2018-11-14 16:44:15,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:15,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:15,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:15,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-14 16:44:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 433 transitions. [2018-11-14 16:44:15,409 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 433 transitions. Word has length 16 [2018-11-14 16:44:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:15,409 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 433 transitions. [2018-11-14 16:44:15,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 433 transitions. [2018-11-14 16:44:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:44:15,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:15,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:15,410 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:15,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2018-11-14 16:44:15,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:15,411 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-14 16:44:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:15,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:15,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {11554#true} call ULTIMATE.init(); {11554#true} is VALID [2018-11-14 16:44:15,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {11554#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {11554#true} is VALID [2018-11-14 16:44:15,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {11554#true} assume true; {11554#true} is VALID [2018-11-14 16:44:15,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11554#true} {11554#true} #1227#return; {11554#true} is VALID [2018-11-14 16:44:15,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {11554#true} call #t~ret66 := main(); {11554#true} is VALID [2018-11-14 16:44:15,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {11554#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11554#true} is VALID [2018-11-14 16:44:15,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {11554#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11577#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {11577#(= (_ 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; {11577#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {11577#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {11577#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {11577#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {11577#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {11577#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {11577#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {11577#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11593#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:15,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {11593#(= (_ 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; {11597#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:15,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {11597#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);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; {11601#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:15,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {11601#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {11555#false} is VALID [2018-11-14 16:44:15,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {11555#false} assume !false; {11555#false} is VALID [2018-11-14 16:44:15,572 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-14 16:44:15,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:15,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:15,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:15,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:44:15,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:15,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:15,595 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-14 16:44:15,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:15,596 INFO L87 Difference]: Start difference. First operand 311 states and 433 transitions. Second operand 6 states. [2018-11-14 16:44:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,000 INFO L93 Difference]: Finished difference Result 339 states and 462 transitions. [2018-11-14 16:44:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:19,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:44:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2018-11-14 16:44:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2018-11-14 16:44:19,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 462 transitions. [2018-11-14 16:44:19,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:19,509 INFO L225 Difference]: With dead ends: 339 [2018-11-14 16:44:19,509 INFO L226 Difference]: Without dead ends: 335 [2018-11-14 16:44:19,510 INFO L604 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-14 16:44:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-14 16:44:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 310. [2018-11-14 16:44:19,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:19,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand 310 states. [2018-11-14 16:44:19,566 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand 310 states. [2018-11-14 16:44:19,566 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 310 states. [2018-11-14 16:44:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,575 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2018-11-14 16:44:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2018-11-14 16:44:19,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:19,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:19,577 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand 335 states. [2018-11-14 16:44:19,577 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 335 states. [2018-11-14 16:44:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,585 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2018-11-14 16:44:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2018-11-14 16:44:19,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:19,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:19,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:19,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-14 16:44:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2018-11-14 16:44:19,594 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 16 [2018-11-14 16:44:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:19,594 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2018-11-14 16:44:19,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2018-11-14 16:44:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:44:19,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:19,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:19,595 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:19,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2018-11-14 16:44:19,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:19,596 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-14 16:44:19,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:19,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:19,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {12953#true} call ULTIMATE.init(); {12953#true} is VALID [2018-11-14 16:44:19,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {12953#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {12953#true} is VALID [2018-11-14 16:44:19,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {12953#true} assume true; {12953#true} is VALID [2018-11-14 16:44:19,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12953#true} {12953#true} #1227#return; {12953#true} is VALID [2018-11-14 16:44:19,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {12953#true} call #t~ret66 := main(); {12953#true} is VALID [2018-11-14 16:44:19,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {12953#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12953#true} is VALID [2018-11-14 16:44:19,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {12953#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12976#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:19,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {12976#(= (_ 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; {12980#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:19,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {12980#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {12980#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:19,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {12980#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {12987#(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-14 16:44:19,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {12987#(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 !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12991#(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-14 16:44:19,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {12991#(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; {12991#(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-14 16:44:19,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {12991#(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____CPAchecker_TMP_0~1 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {12991#(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-14 16:44:19,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {12991#(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_2609_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; {12991#(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-14 16:44:19,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {12991#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {13004#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:19,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {13004#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~3 == 0bv32; {12954#false} is VALID [2018-11-14 16:44:19,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {12954#false} assume !false; {12954#false} is VALID [2018-11-14 16:44:19,832 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-14 16:44:19,832 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:19,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:19,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 16:44:19,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:19,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:19,867 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-14 16:44:19,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:19,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:19,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:19,868 INFO L87 Difference]: Start difference. First operand 310 states and 431 transitions. Second operand 7 states. [2018-11-14 16:44:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:23,491 INFO L93 Difference]: Finished difference Result 349 states and 472 transitions. [2018-11-14 16:44:23,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:23,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 16:44:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 471 transitions. [2018-11-14 16:44:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 471 transitions. [2018-11-14 16:44:23,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 471 transitions. [2018-11-14 16:44:24,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:24,026 INFO L225 Difference]: With dead ends: 349 [2018-11-14 16:44:24,026 INFO L226 Difference]: Without dead ends: 347 [2018-11-14 16:44:24,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-14 16:44:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 311. [2018-11-14 16:44:24,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:24,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand 311 states. [2018-11-14 16:44:24,256 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand 311 states. [2018-11-14 16:44:24,257 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 311 states. [2018-11-14 16:44:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,266 INFO L93 Difference]: Finished difference Result 347 states and 470 transitions. [2018-11-14 16:44:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 470 transitions. [2018-11-14 16:44:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:24,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:24,268 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand 347 states. [2018-11-14 16:44:24,268 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 347 states. [2018-11-14 16:44:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,278 INFO L93 Difference]: Finished difference Result 347 states and 470 transitions. [2018-11-14 16:44:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 470 transitions. [2018-11-14 16:44:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:24,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:24,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:24,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-14 16:44:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 432 transitions. [2018-11-14 16:44:24,288 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 432 transitions. Word has length 17 [2018-11-14 16:44:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:24,288 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 432 transitions. [2018-11-14 16:44:24,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 432 transitions. [2018-11-14 16:44:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:44:24,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:24,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:24,290 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:24,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2018-11-14 16:44:24,291 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:24,291 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-14 16:44:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:24,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:24,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {14392#true} call ULTIMATE.init(); {14392#true} is VALID [2018-11-14 16:44:24,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {14392#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {14392#true} is VALID [2018-11-14 16:44:24,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {14392#true} assume true; {14392#true} is VALID [2018-11-14 16:44:24,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14392#true} {14392#true} #1227#return; {14392#true} is VALID [2018-11-14 16:44:24,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {14392#true} call #t~ret66 := main(); {14392#true} is VALID [2018-11-14 16:44:24,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {14392#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14392#true} is VALID [2018-11-14 16:44:24,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {14392#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14415#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {14415#(= (_ 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; {14415#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {14415#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {14415#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {14415#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {14415#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {14415#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {14415#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {14415#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14431#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {14431#(= (_ 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; {14431#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {14431#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {14431#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:24,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {14431#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);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; {14441#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:24,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {14441#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {14393#false} is VALID [2018-11-14 16:44:24,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {14393#false} assume !false; {14393#false} is VALID [2018-11-14 16:44:24,436 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-14 16:44:24,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:24,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:24,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:24,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:44:24,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:24,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:24,477 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-14 16:44:24,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:24,478 INFO L87 Difference]: Start difference. First operand 311 states and 432 transitions. Second operand 5 states. [2018-11-14 16:44:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:27,863 INFO L93 Difference]: Finished difference Result 363 states and 488 transitions. [2018-11-14 16:44:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:27,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:44:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2018-11-14 16:44:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2018-11-14 16:44:27,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 488 transitions. [2018-11-14 16:44:28,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:28,584 INFO L225 Difference]: With dead ends: 363 [2018-11-14 16:44:28,584 INFO L226 Difference]: Without dead ends: 361 [2018-11-14 16:44:28,584 INFO L604 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-14 16:44:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-14 16:44:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 314. [2018-11-14 16:44:28,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:28,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand 314 states. [2018-11-14 16:44:28,611 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand 314 states. [2018-11-14 16:44:28,612 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 314 states. [2018-11-14 16:44:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,620 INFO L93 Difference]: Finished difference Result 361 states and 486 transitions. [2018-11-14 16:44:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2018-11-14 16:44:28,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,621 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 361 states. [2018-11-14 16:44:28,621 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 361 states. [2018-11-14 16:44:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,630 INFO L93 Difference]: Finished difference Result 361 states and 486 transitions. [2018-11-14 16:44:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2018-11-14 16:44:28,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:28,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-14 16:44:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 437 transitions. [2018-11-14 16:44:28,638 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 437 transitions. Word has length 17 [2018-11-14 16:44:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:28,638 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 437 transitions. [2018-11-14 16:44:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 437 transitions. [2018-11-14 16:44:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:44:28,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:28,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:28,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:28,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2018-11-14 16:44:28,640 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:28,641 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-14 16:44:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:28,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {15875#true} call ULTIMATE.init(); {15875#true} is VALID [2018-11-14 16:44:28,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {15875#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {15875#true} is VALID [2018-11-14 16:44:28,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {15875#true} assume true; {15875#true} is VALID [2018-11-14 16:44:28,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15875#true} {15875#true} #1227#return; {15875#true} is VALID [2018-11-14 16:44:28,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {15875#true} call #t~ret66 := main(); {15875#true} is VALID [2018-11-14 16:44:28,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {15875#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15875#true} is VALID [2018-11-14 16:44:28,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {15875#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15898#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {15898#(= (_ 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; {15898#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {15898#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {15898#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {15898#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {15898#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {15898#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {15898#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {15898#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15914#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {15914#(= (_ 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; {15914#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {15914#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {15914#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {15914#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);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; {15924#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:28,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {15924#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {15876#false} is VALID [2018-11-14 16:44:28,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {15876#false} assume !false; {15876#false} is VALID [2018-11-14 16:44:28,770 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-14 16:44:28,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:28,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:44:28,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:28,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:28,788 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-14 16:44:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:28,789 INFO L87 Difference]: Start difference. First operand 314 states and 437 transitions. Second operand 5 states. [2018-11-14 16:44:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:31,933 INFO L93 Difference]: Finished difference Result 331 states and 454 transitions. [2018-11-14 16:44:31,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:44:31,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:44:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2018-11-14 16:44:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2018-11-14 16:44:31,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 454 transitions. [2018-11-14 16:44:32,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:32,495 INFO L225 Difference]: With dead ends: 331 [2018-11-14 16:44:32,496 INFO L226 Difference]: Without dead ends: 329 [2018-11-14 16:44:32,496 INFO L604 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-14 16:44:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-14 16:44:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 316. [2018-11-14 16:44:32,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:32,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand 316 states. [2018-11-14 16:44:32,548 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand 316 states. [2018-11-14 16:44:32,548 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 316 states. [2018-11-14 16:44:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:32,554 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2018-11-14 16:44:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 452 transitions. [2018-11-14 16:44:32,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:32,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:32,555 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand 329 states. [2018-11-14 16:44:32,555 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 329 states. [2018-11-14 16:44:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:32,562 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2018-11-14 16:44:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 452 transitions. [2018-11-14 16:44:32,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:32,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:32,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:32,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-14 16:44:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2018-11-14 16:44:32,571 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 17 [2018-11-14 16:44:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:32,571 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2018-11-14 16:44:32,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2018-11-14 16:44:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:44:32,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:32,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:32,572 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:32,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2018-11-14 16:44:32,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:32,573 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-14 16:44:32,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:32,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:32,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {17262#true} call ULTIMATE.init(); {17262#true} is VALID [2018-11-14 16:44:32,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {17262#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {17262#true} is VALID [2018-11-14 16:44:32,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {17262#true} assume true; {17262#true} is VALID [2018-11-14 16:44:32,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17262#true} {17262#true} #1227#return; {17262#true} is VALID [2018-11-14 16:44:32,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {17262#true} call #t~ret66 := main(); {17262#true} is VALID [2018-11-14 16:44:32,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {17262#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17262#true} is VALID [2018-11-14 16:44:32,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {17262#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17285#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {17285#(= (_ 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; {17285#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {17285#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {17285#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {17285#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {17285#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {17285#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {17285#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {17285#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17301#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {17301#(= (_ 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; {17301#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {17301#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {17301#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {17301#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {17301#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:32,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {17301#(= (_ 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; {17314#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:32,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {17314#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {17263#false} is VALID [2018-11-14 16:44:32,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {17263#false} assume !false; {17263#false} is VALID [2018-11-14 16:44:32,724 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-14 16:44:32,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:32,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:32,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:32,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 16:44:32,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:32,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:32,749 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-14 16:44:32,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:32,750 INFO L87 Difference]: Start difference. First operand 316 states and 440 transitions. Second operand 5 states. [2018-11-14 16:44:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,056 INFO L93 Difference]: Finished difference Result 359 states and 484 transitions. [2018-11-14 16:44:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:36,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 16:44:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2018-11-14 16:44:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2018-11-14 16:44:36,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 484 transitions. [2018-11-14 16:44:36,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:36,582 INFO L225 Difference]: With dead ends: 359 [2018-11-14 16:44:36,582 INFO L226 Difference]: Without dead ends: 357 [2018-11-14 16:44:36,583 INFO L604 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-14 16:44:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-14 16:44:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 318. [2018-11-14 16:44:36,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:36,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand 318 states. [2018-11-14 16:44:36,606 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand 318 states. [2018-11-14 16:44:36,606 INFO L87 Difference]: Start difference. First operand 357 states. Second operand 318 states. [2018-11-14 16:44:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,614 INFO L93 Difference]: Finished difference Result 357 states and 482 transitions. [2018-11-14 16:44:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2018-11-14 16:44:36,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,614 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand 357 states. [2018-11-14 16:44:36,615 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 357 states. [2018-11-14 16:44:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,623 INFO L93 Difference]: Finished difference Result 357 states and 482 transitions. [2018-11-14 16:44:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2018-11-14 16:44:36,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:36,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-14 16:44:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 442 transitions. [2018-11-14 16:44:36,632 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 442 transitions. Word has length 18 [2018-11-14 16:44:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:36,632 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 442 transitions. [2018-11-14 16:44:36,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 442 transitions. [2018-11-14 16:44:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:44:36,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:36,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:36,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:36,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2018-11-14 16:44:36,634 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:36,634 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-14 16:44:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:36,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:36,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {18741#true} call ULTIMATE.init(); {18741#true} is VALID [2018-11-14 16:44:36,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {18741#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {18741#true} is VALID [2018-11-14 16:44:36,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {18741#true} assume true; {18741#true} is VALID [2018-11-14 16:44:36,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18741#true} {18741#true} #1227#return; {18741#true} is VALID [2018-11-14 16:44:36,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {18741#true} call #t~ret66 := main(); {18741#true} is VALID [2018-11-14 16:44:36,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {18741#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18741#true} is VALID [2018-11-14 16:44:36,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {18741#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18764#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {18764#(= (_ 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; {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:36,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:36,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:36,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {18768#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {18778#(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-14 16:44:36,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {18778#(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 !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18782#(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-14 16:44:36,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {18782#(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; {18782#(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-14 16:44:36,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {18782#(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____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {18782#(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-14 16:44:36,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {18782#(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____CPAchecker_TMP_4~0 == 0bv32);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; {18782#(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-14 16:44:36,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {18782#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);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; {18795#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:36,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {18795#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {18742#false} is VALID [2018-11-14 16:44:36,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {18742#false} assume !false; {18742#false} is VALID [2018-11-14 16:44:36,888 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-14 16:44:36,889 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:36,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:36,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:36,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:44:36,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:36,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:36,913 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-14 16:44:36,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:36,914 INFO L87 Difference]: Start difference. First operand 318 states and 442 transitions. Second operand 7 states. [2018-11-14 16:44:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:41,570 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2018-11-14 16:44:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:41,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:44:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 482 transitions. [2018-11-14 16:44:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 482 transitions. [2018-11-14 16:44:41,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 482 transitions. [2018-11-14 16:44:42,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:42,093 INFO L225 Difference]: With dead ends: 360 [2018-11-14 16:44:42,093 INFO L226 Difference]: Without dead ends: 358 [2018-11-14 16:44:42,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-14 16:44:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 319. [2018-11-14 16:44:42,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:42,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand 319 states. [2018-11-14 16:44:42,107 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand 319 states. [2018-11-14 16:44:42,107 INFO L87 Difference]: Start difference. First operand 358 states. Second operand 319 states. [2018-11-14 16:44:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:42,115 INFO L93 Difference]: Finished difference Result 358 states and 483 transitions. [2018-11-14 16:44:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 483 transitions. [2018-11-14 16:44:42,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:42,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:42,116 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand 358 states. [2018-11-14 16:44:42,116 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 358 states. [2018-11-14 16:44:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:42,123 INFO L93 Difference]: Finished difference Result 358 states and 483 transitions. [2018-11-14 16:44:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 483 transitions. [2018-11-14 16:44:42,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:42,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:42,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:42,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-14 16:44:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 443 transitions. [2018-11-14 16:44:42,130 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 443 transitions. Word has length 18 [2018-11-14 16:44:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:42,130 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 443 transitions. [2018-11-14 16:44:42,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 443 transitions. [2018-11-14 16:44:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:44:42,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:42,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:42,131 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:42,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2018-11-14 16:44:42,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:42,132 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-14 16:44:42,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:42,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:42,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {20226#true} call ULTIMATE.init(); {20226#true} is VALID [2018-11-14 16:44:42,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {20226#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {20226#true} is VALID [2018-11-14 16:44:42,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {20226#true} assume true; {20226#true} is VALID [2018-11-14 16:44:42,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20226#true} {20226#true} #1227#return; {20226#true} is VALID [2018-11-14 16:44:42,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {20226#true} call #t~ret66 := main(); {20226#true} is VALID [2018-11-14 16:44:42,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {20226#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20226#true} is VALID [2018-11-14 16:44:42,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {20226#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20249#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {20249#(= (_ 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; {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:42,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:42,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:42,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {20253#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {20263#(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-14 16:44:42,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {20263#(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 !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20267#(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-14 16:44:42,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {20267#(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; {20267#(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-14 16:44:42,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {20267#(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____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {20267#(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-14 16:44:42,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {20267#(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____CPAchecker_TMP_6~0 == 0bv32);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; {20267#(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-14 16:44:42,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {20267#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~12 == 0bv32);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; {20280#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:42,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {20280#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {20227#false} is VALID [2018-11-14 16:44:42,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {20227#false} assume !false; {20227#false} is VALID [2018-11-14 16:44:42,611 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-14 16:44:42,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:42,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:42,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:42,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:44:42,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:42,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:42,655 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-14 16:44:42,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:42,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:42,656 INFO L87 Difference]: Start difference. First operand 319 states and 443 transitions. Second operand 7 states. [2018-11-14 16:44:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:47,465 INFO L93 Difference]: Finished difference Result 325 states and 448 transitions. [2018-11-14 16:44:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:47,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:44:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 445 transitions. [2018-11-14 16:44:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 445 transitions. [2018-11-14 16:44:47,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 445 transitions. [2018-11-14 16:44:48,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:48,063 INFO L225 Difference]: With dead ends: 325 [2018-11-14 16:44:48,063 INFO L226 Difference]: Without dead ends: 321 [2018-11-14 16:44:48,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-14 16:44:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2018-11-14 16:44:48,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:48,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand 318 states. [2018-11-14 16:44:48,083 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand 318 states. [2018-11-14 16:44:48,083 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 318 states. [2018-11-14 16:44:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:48,090 INFO L93 Difference]: Finished difference Result 321 states and 444 transitions. [2018-11-14 16:44:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2018-11-14 16:44:48,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:48,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:48,090 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand 321 states. [2018-11-14 16:44:48,090 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 321 states. [2018-11-14 16:44:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:48,098 INFO L93 Difference]: Finished difference Result 321 states and 444 transitions. [2018-11-14 16:44:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2018-11-14 16:44:48,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:48,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:48,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:48,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-14 16:44:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 441 transitions. [2018-11-14 16:44:48,106 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 441 transitions. Word has length 18 [2018-11-14 16:44:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:48,106 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 441 transitions. [2018-11-14 16:44:48,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 441 transitions. [2018-11-14 16:44:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:44:48,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:48,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:48,108 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:48,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2063762805, now seen corresponding path program 1 times [2018-11-14 16:44:48,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:48,109 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-14 16:44:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:48,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:48,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {21599#true} call ULTIMATE.init(); {21599#true} is VALID [2018-11-14 16:44:48,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {21599#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {21599#true} is VALID [2018-11-14 16:44:48,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {21599#true} assume true; {21599#true} is VALID [2018-11-14 16:44:48,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21599#true} {21599#true} #1227#return; {21599#true} is VALID [2018-11-14 16:44:48,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {21599#true} call #t~ret66 := main(); {21599#true} is VALID [2018-11-14 16:44:48,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {21599#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21599#true} is VALID [2018-11-14 16:44:48,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {21599#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21622#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {21622#(= (_ 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; {21622#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {21622#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {21622#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {21622#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {21622#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {21622#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {21635#(= (_ 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; {21635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {21635#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {21635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {21635#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {21635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {21635#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {21635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {21635#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21651#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {21651#(= (_ 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; {21655#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:48,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {21655#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {21600#false} is VALID [2018-11-14 16:44:48,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {21600#false} assume !false; {21600#false} is VALID [2018-11-14 16:44:48,230 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-14 16:44:48,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:48,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:48,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:44:48,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:48,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:48,256 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-14 16:44:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:48,257 INFO L87 Difference]: Start difference. First operand 318 states and 441 transitions. Second operand 6 states. [2018-11-14 16:44:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:52,639 INFO L93 Difference]: Finished difference Result 371 states and 495 transitions. [2018-11-14 16:44:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:52,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:44:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2018-11-14 16:44:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2018-11-14 16:44:52,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 495 transitions. [2018-11-14 16:44:53,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:53,299 INFO L225 Difference]: With dead ends: 371 [2018-11-14 16:44:53,299 INFO L226 Difference]: Without dead ends: 369 [2018-11-14 16:44:53,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-14 16:44:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-14 16:44:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 321. [2018-11-14 16:44:53,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:53,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand 321 states. [2018-11-14 16:44:53,428 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand 321 states. [2018-11-14 16:44:53,428 INFO L87 Difference]: Start difference. First operand 369 states. Second operand 321 states. [2018-11-14 16:44:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:53,439 INFO L93 Difference]: Finished difference Result 369 states and 493 transitions. [2018-11-14 16:44:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2018-11-14 16:44:53,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:53,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:53,440 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand 369 states. [2018-11-14 16:44:53,440 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 369 states. [2018-11-14 16:44:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:53,450 INFO L93 Difference]: Finished difference Result 369 states and 493 transitions. [2018-11-14 16:44:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2018-11-14 16:44:53,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:53,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:53,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:53,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-14 16:44:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 446 transitions. [2018-11-14 16:44:53,460 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 446 transitions. Word has length 19 [2018-11-14 16:44:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:53,460 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 446 transitions. [2018-11-14 16:44:53,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 446 transitions. [2018-11-14 16:44:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:44:53,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:53,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:53,461 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:53,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash -917529072, now seen corresponding path program 1 times [2018-11-14 16:44:53,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:53,462 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-14 16:44:53,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:53,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:53,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {23124#true} call ULTIMATE.init(); {23124#true} is VALID [2018-11-14 16:44:53,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {23124#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {23124#true} is VALID [2018-11-14 16:44:53,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {23124#true} assume true; {23124#true} is VALID [2018-11-14 16:44:53,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23124#true} {23124#true} #1227#return; {23124#true} is VALID [2018-11-14 16:44:53,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {23124#true} call #t~ret66 := main(); {23124#true} is VALID [2018-11-14 16:44:53,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {23124#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23124#true} is VALID [2018-11-14 16:44:53,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {23124#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23147#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {23147#(= (_ 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; {23147#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {23147#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);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; {23147#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {23147#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);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; {23147#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {23147#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23160#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {23160#(= (_ 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; {23160#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {23160#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);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; {23160#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {23160#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);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; {23160#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {23160#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23173#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {23173#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {23173#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {23173#(= (_ 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; {23180#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:53,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {23180#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {23125#false} is VALID [2018-11-14 16:44:53,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {23125#false} assume !false; {23125#false} is VALID [2018-11-14 16:44:53,694 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-14 16:44:53,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:53,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:44:53,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:53,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:53,716 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-14 16:44:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:53,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:53,717 INFO L87 Difference]: Start difference. First operand 321 states and 446 transitions. Second operand 6 states. [2018-11-14 16:44:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:58,139 INFO L93 Difference]: Finished difference Result 369 states and 493 transitions. [2018-11-14 16:44:58,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:58,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:44:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2018-11-14 16:44:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2018-11-14 16:44:58,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 493 transitions. [2018-11-14 16:44:58,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:58,685 INFO L225 Difference]: With dead ends: 369 [2018-11-14 16:44:58,685 INFO L226 Difference]: Without dead ends: 367 [2018-11-14 16:44:58,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-14 16:44:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-14 16:44:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 323. [2018-11-14 16:44:58,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:58,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand 323 states. [2018-11-14 16:44:58,719 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand 323 states. [2018-11-14 16:44:58,720 INFO L87 Difference]: Start difference. First operand 367 states. Second operand 323 states. [2018-11-14 16:44:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:58,728 INFO L93 Difference]: Finished difference Result 367 states and 491 transitions. [2018-11-14 16:44:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 491 transitions. [2018-11-14 16:44:58,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:58,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:58,729 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 367 states. [2018-11-14 16:44:58,729 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 367 states. [2018-11-14 16:44:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:58,738 INFO L93 Difference]: Finished difference Result 367 states and 491 transitions. [2018-11-14 16:44:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 491 transitions. [2018-11-14 16:44:58,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:58,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:58,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:58,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-14 16:44:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2018-11-14 16:44:58,746 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 19 [2018-11-14 16:44:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:58,746 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2018-11-14 16:44:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2018-11-14 16:44:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:44:58,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:58,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:58,748 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:58,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2018-11-14 16:44:58,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:58,748 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-14 16:44:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:58,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:58,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {24646#true} call ULTIMATE.init(); {24646#true} is VALID [2018-11-14 16:44:58,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {24646#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2609_0~0 := 0bv32;~__tmp_3904_0~0 := 0bv32;~__tmp_3904_1~0 := 0bv32; {24646#true} is VALID [2018-11-14 16:44:58,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {24646#true} assume true; {24646#true} is VALID [2018-11-14 16:44:58,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24646#true} {24646#true} #1227#return; {24646#true} is VALID [2018-11-14 16:44:58,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {24646#true} call #t~ret66 := main(); {24646#true} is VALID [2018-11-14 16:44:58,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {24646#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24646#true} is VALID [2018-11-14 16:44:58,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {24646#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24669#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:58,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {24669#(= (_ 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; {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:58,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:58,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_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; {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:58,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {24673#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);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; {24683#(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-14 16:44:58,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {24683#(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 !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24687#(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-14 16:44:58,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {24687#(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; {24687#(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-14 16:44:58,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {24687#(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____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {24687#(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-14 16:44:58,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {24687#(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____CPAchecker_TMP_4~0 == 0bv32); {24687#(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-14 16:44:58,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {24687#(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; {24687#(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-14 16:44:58,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {24687#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);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; {24703#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:58,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {24703#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {24647#false} is VALID [2018-11-14 16:44:58,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {24647#false} assume !false; {24647#false} is VALID [2018-11-14 16:44:58,950 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-14 16:44:58,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:58,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-14 16:44:58,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:58,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:58,975 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-14 16:44:58,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:58,976 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand 7 states.